./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/triangular-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-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 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:08:42,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:08:42,864 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:42,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:08:42,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:08:42,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:08:42,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:08:42,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:08:42,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:08:42,890 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:08:42,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:08:42,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:08:42,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:08:42,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:08:42,891 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:08:42,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:08:42,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:08:42,891 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:08:42,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:08:42,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:08:42,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:08:42,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:08:42,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:08:42,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:08:42,891 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:08:42,891 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:08:42,891 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:08:42,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:08:42,892 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:08:42,892 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:08:42,892 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:08:42,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:08:42,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:08:42,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:08:42,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:08:42,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:08:42,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:08:42,892 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:08:42,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:08:42,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:08:42,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:08:42,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:08:42,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:08:42,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:08:42,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:08:42,893 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 -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2025-03-04 15:08:43,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:08:43,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:08:43,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:08:43,113 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:08:43,113 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:08:43,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-2.i [2025-03-04 15:08:44,215 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae41c44e/ba11086684e04ea7bf4283bb83cee27b/FLAGedde0e9cb [2025-03-04 15:08:44,562 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:08:44,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2025-03-04 15:08:44,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae41c44e/ba11086684e04ea7bf4283bb83cee27b/FLAGedde0e9cb [2025-03-04 15:08:44,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae41c44e/ba11086684e04ea7bf4283bb83cee27b [2025-03-04 15:08:44,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:08:44,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:08:44,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:08:44,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:08:44,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:08:44,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:08:44" (1/1) ... [2025-03-04 15:08:44,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f202b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:44, skipping insertion in model container [2025-03-04 15:08:44,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:08:44" (1/1) ... [2025-03-04 15:08:44,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:08:44,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:08:44,865 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:08:44,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:08:44,933 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:08:44,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:44 WrapperNode [2025-03-04 15:08:44,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:08:44,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:08:44,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:08:44,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:08:44,939 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:44" (1/1) ... [2025-03-04 15:08:44,949 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:44" (1/1) ... [2025-03-04 15:08:44,963 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-03-04 15:08:44,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:08:44,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:08:44,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:08:44,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:08:44,968 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:44" (1/1) ... [2025-03-04 15:08:44,968 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:44" (1/1) ... [2025-03-04 15:08:44,969 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:44" (1/1) ... [2025-03-04 15:08:44,979 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:44,980 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:44" (1/1) ... [2025-03-04 15:08:44,980 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:44" (1/1) ... [2025-03-04 15:08:44,982 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:44" (1/1) ... [2025-03-04 15:08:44,983 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:44" (1/1) ... [2025-03-04 15:08:44,984 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:44" (1/1) ... [2025-03-04 15:08:44,984 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:44" (1/1) ... [2025-03-04 15:08:44,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:08:44,986 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:08:44,986 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:08:44,986 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:08:44,987 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:44" (1/1) ... [2025-03-04 15:08:44,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:08:44,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:45,011 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:45,014 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:45,030 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 15:08:45,030 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 15:08:45,030 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 15:08:45,030 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 15:08:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:08:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:08:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:08:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:08:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:08:45,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:08:45,033 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:45,128 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:08:45,130 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:08:45,231 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:08:45,231 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:08:45,283 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:08:45,283 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:08:45,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:08:45 BoogieIcfgContainer [2025-03-04 15:08:45,283 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:08:45,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:08:45,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:08:45,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:08:45,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:08:44" (1/3) ... [2025-03-04 15:08:45,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673904c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:08:45, skipping insertion in model container [2025-03-04 15:08:45,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:44" (2/3) ... [2025-03-04 15:08:45,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673904c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:08:45, skipping insertion in model container [2025-03-04 15:08:45,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:08:45" (3/3) ... [2025-03-04 15:08:45,291 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2025-03-04 15:08:45,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:08:45,305 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-2.i that has 3 procedures, 31 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-04 15:08:45,306 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:08:45,348 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:08:45,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 72 flow [2025-03-04 15:08:45,388 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2025-03-04 15:08:45,390 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:08:45,392 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:45,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 32 transitions, 72 flow [2025-03-04 15:08:45,394 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 30 transitions, 66 flow [2025-03-04 15:08:45,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:08:45,413 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;@1124bd5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:08:45,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 15:08:45,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:08:45,421 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:08:45,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:08:45,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:45,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:08:45,422 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:45,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:45,427 INFO L85 PathProgramCache]: Analyzing trace with hash 185325867, now seen corresponding path program 1 times [2025-03-04 15:08:45,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:45,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125741383] [2025-03-04 15:08:45,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:45,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:45,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:08:45,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:08:45,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:45,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:45,578 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:45,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:45,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125741383] [2025-03-04 15:08:45,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125741383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:45,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:45,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:08:45,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590946233] [2025-03-04 15:08:45,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:45,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:45,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:45,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:45,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:45,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:45,607 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:45,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:45,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:45,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:45,813 INFO L124 PetriNetUnfolderBase]: 510/941 cut-off events. [2025-03-04 15:08:45,813 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:08:45,816 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:45,822 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 31 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-03-04 15:08:45,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 162 flow [2025-03-04 15:08:45,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 15:08:45,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395833333333334 [2025-03-04 15:08:45,834 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:45,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 162 flow [2025-03-04 15:08:45,837 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:45,839 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 86 flow [2025-03-04 15:08:45,840 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:45,844 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-03-04 15:08:45,844 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 86 flow [2025-03-04 15:08:45,845 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:45,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:45,845 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:08:45,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:08:45,845 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:45,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:45,846 INFO L85 PathProgramCache]: Analyzing trace with hash 185325868, now seen corresponding path program 1 times [2025-03-04 15:08:45,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:45,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534482100] [2025-03-04 15:08:45,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:45,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:45,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:08:45,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:08:45,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:45,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:45,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:45,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534482100] [2025-03-04 15:08:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534482100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:45,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:45,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:08:45,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589222737] [2025-03-04 15:08:45,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:45,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:45,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:45,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:45,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:45,898 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:45,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:45,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:45,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:46,002 INFO L124 PetriNetUnfolderBase]: 499/971 cut-off events. [2025-03-04 15:08:46,002 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2025-03-04 15:08:46,005 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:46,010 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 31 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-03-04 15:08:46,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 186 flow [2025-03-04 15:08:46,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-04 15:08:46,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2025-03-04 15:08:46,012 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:46,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 186 flow [2025-03-04 15:08:46,012 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:46,013 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 100 flow [2025-03-04 15:08:46,013 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:46,014 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-03-04 15:08:46,014 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 100 flow [2025-03-04 15:08:46,014 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:46,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:46,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:46,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:08:46,014 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:46,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2004506799, now seen corresponding path program 1 times [2025-03-04 15:08:46,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:46,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509893331] [2025-03-04 15:08:46,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:46,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:46,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:08:46,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:08:46,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:46,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:46,076 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:46,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:46,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509893331] [2025-03-04 15:08:46,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509893331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:46,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:46,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:46,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115964040] [2025-03-04 15:08:46,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:46,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:46,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:46,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:46,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:46,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-04 15:08:46,090 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:46,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:46,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-04 15:08:46,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:46,302 INFO L124 PetriNetUnfolderBase]: 1181/2230 cut-off events. [2025-03-04 15:08:46,302 INFO L125 PetriNetUnfolderBase]: For 710/710 co-relation queries the response was YES. [2025-03-04 15:08:46,306 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:46,313 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 56 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2025-03-04 15:08:46,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 322 flow [2025-03-04 15:08:46,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-03-04 15:08:46,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7109375 [2025-03-04 15:08:46,315 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:46,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 322 flow [2025-03-04 15:08:46,316 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:46,316 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 120 flow [2025-03-04 15:08:46,316 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:46,317 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-03-04 15:08:46,317 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 120 flow [2025-03-04 15:08:46,317 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:46,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:46,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:46,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:08:46,318 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:46,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:46,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1984850697, now seen corresponding path program 1 times [2025-03-04 15:08:46,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:46,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606228498] [2025-03-04 15:08:46,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:46,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:46,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:08:46,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:08:46,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:46,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:46,357 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:46,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:46,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606228498] [2025-03-04 15:08:46,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606228498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:46,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:46,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:08:46,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039014377] [2025-03-04 15:08:46,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:46,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:46,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:46,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:46,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:46,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:46,358 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:46,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:46,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:46,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:46,487 INFO L124 PetriNetUnfolderBase]: 791/1734 cut-off events. [2025-03-04 15:08:46,488 INFO L125 PetriNetUnfolderBase]: For 752/768 co-relation queries the response was YES. [2025-03-04 15:08:46,490 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:46,495 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 41 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-03-04 15:08:46,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 279 flow [2025-03-04 15:08:46,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-04 15:08:46,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7604166666666666 [2025-03-04 15:08:46,496 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:46,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 279 flow [2025-03-04 15:08:46,499 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:46,500 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 140 flow [2025-03-04 15:08:46,500 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:46,501 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2025-03-04 15:08:46,501 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 140 flow [2025-03-04 15:08:46,501 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:46,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:46,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:46,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:08:46,501 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:46,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1984850698, now seen corresponding path program 1 times [2025-03-04 15:08:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:46,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571803398] [2025-03-04 15:08:46,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:46,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:08:46,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:08:46,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:46,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:46,547 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:46,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:46,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571803398] [2025-03-04 15:08:46,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571803398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:46,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:46,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:08:46,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407311981] [2025-03-04 15:08:46,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:46,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:46,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:46,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:46,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:46,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:46,549 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:46,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:46,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:46,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:46,660 INFO L124 PetriNetUnfolderBase]: 753/1716 cut-off events. [2025-03-04 15:08:46,660 INFO L125 PetriNetUnfolderBase]: For 1013/1029 co-relation queries the response was YES. [2025-03-04 15:08:46,662 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:46,668 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 41 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-03-04 15:08:46,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 302 flow [2025-03-04 15:08:46,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-04 15:08:46,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-04 15:08:46,672 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:46,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 302 flow [2025-03-04 15:08:46,673 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:46,674 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 154 flow [2025-03-04 15:08:46,674 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:46,676 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2025-03-04 15:08:46,677 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 154 flow [2025-03-04 15:08:46,677 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:46,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:46,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:46,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:08:46,678 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:46,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:46,679 INFO L85 PathProgramCache]: Analyzing trace with hash 476048493, now seen corresponding path program 1 times [2025-03-04 15:08:46,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:46,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554961798] [2025-03-04 15:08:46,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:46,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:46,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:08:46,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:08:46,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:46,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:46,717 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:46,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:46,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554961798] [2025-03-04 15:08:46,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554961798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:46,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:46,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:46,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339909317] [2025-03-04 15:08:46,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:46,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:46,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:46,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:46,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:46,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-04 15:08:46,724 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:46,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:46,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-04 15:08:46,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:46,895 INFO L124 PetriNetUnfolderBase]: 1197/2294 cut-off events. [2025-03-04 15:08:46,895 INFO L125 PetriNetUnfolderBase]: For 1748/1947 co-relation queries the response was YES. [2025-03-04 15:08:46,898 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:46,906 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 57 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2025-03-04 15:08:46,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 396 flow [2025-03-04 15:08:46,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-03-04 15:08:46,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2025-03-04 15:08:46,908 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:46,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 396 flow [2025-03-04 15:08:46,910 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:46,911 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 174 flow [2025-03-04 15:08:46,911 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:46,911 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2025-03-04 15:08:46,911 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 174 flow [2025-03-04 15:08:46,911 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:46,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:46,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:46,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:08:46,911 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:46,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:46,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1652667496, now seen corresponding path program 1 times [2025-03-04 15:08:46,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:46,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572059793] [2025-03-04 15:08:46,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:46,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:46,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:08:46,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:08:46,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:46,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:46,948 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:46,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:46,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572059793] [2025-03-04 15:08:46,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572059793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:46,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:46,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:46,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843574366] [2025-03-04 15:08:46,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:46,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:46,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:46,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:46,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:46,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:46,949 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:46,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:46,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:46,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:47,142 INFO L124 PetriNetUnfolderBase]: 1021/2270 cut-off events. [2025-03-04 15:08:47,143 INFO L125 PetriNetUnfolderBase]: For 1871/2056 co-relation queries the response was YES. [2025-03-04 15:08:47,147 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:47,155 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 58 selfloop transitions, 11 changer transitions 0/81 dead transitions. [2025-03-04 15:08:47,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 477 flow [2025-03-04 15:08:47,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:08:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:08:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-03-04 15:08:47,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.725 [2025-03-04 15:08:47,157 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:47,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 477 flow [2025-03-04 15:08:47,160 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:47,161 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 272 flow [2025-03-04 15:08:47,161 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:47,162 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2025-03-04 15:08:47,163 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 272 flow [2025-03-04 15:08:47,163 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:47,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:47,163 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:47,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:08:47,163 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:47,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:47,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1652667497, now seen corresponding path program 1 times [2025-03-04 15:08:47,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:47,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374587612] [2025-03-04 15:08:47,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:47,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:47,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:08:47,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:08:47,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:47,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:47,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:47,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374587612] [2025-03-04 15:08:47,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374587612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:47,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:47,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:47,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040662375] [2025-03-04 15:08:47,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:47,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:47,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:47,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:47,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:47,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:47,202 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:47,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:47,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:47,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:47,449 INFO L124 PetriNetUnfolderBase]: 1098/2481 cut-off events. [2025-03-04 15:08:47,450 INFO L125 PetriNetUnfolderBase]: For 4261/4434 co-relation queries the response was YES. [2025-03-04 15:08:47,459 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:47,474 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 63 selfloop transitions, 9 changer transitions 0/84 dead transitions. [2025-03-04 15:08:47,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 564 flow [2025-03-04 15:08:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:08:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:08:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-03-04 15:08:47,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.73125 [2025-03-04 15:08:47,476 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:47,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 564 flow [2025-03-04 15:08:47,482 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:47,483 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 327 flow [2025-03-04 15:08:47,484 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:47,485 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2025-03-04 15:08:47,485 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 327 flow [2025-03-04 15:08:47,486 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:47,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:47,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:47,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:08:47,486 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:47,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:47,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1017608297, now seen corresponding path program 1 times [2025-03-04 15:08:47,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:47,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887017980] [2025-03-04 15:08:47,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:47,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:47,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:08:47,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:08:47,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:47,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:47,523 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:47,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:47,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887017980] [2025-03-04 15:08:47,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887017980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:47,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:47,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:47,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351611518] [2025-03-04 15:08:47,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:47,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:47,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:47,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:47,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:47,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:47,525 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:47,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:47,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:47,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:47,692 INFO L124 PetriNetUnfolderBase]: 903/1917 cut-off events. [2025-03-04 15:08:47,692 INFO L125 PetriNetUnfolderBase]: For 3740/3971 co-relation queries the response was YES. [2025-03-04 15:08:47,695 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:47,699 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 32 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2025-03-04 15:08:47,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 45 transitions, 330 flow [2025-03-04 15:08:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-04 15:08:47,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 15:08:47,700 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:47,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 45 transitions, 330 flow [2025-03-04 15:08:47,704 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:47,704 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 250 flow [2025-03-04 15:08:47,704 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:47,705 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2025-03-04 15:08:47,705 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 250 flow [2025-03-04 15:08:47,705 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:47,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:47,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:47,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:08:47,705 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:47,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:47,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1017608296, now seen corresponding path program 1 times [2025-03-04 15:08:47,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:47,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649612486] [2025-03-04 15:08:47,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:47,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:47,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:08:47,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:08:47,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:47,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:47,741 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:47,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:47,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649612486] [2025-03-04 15:08:47,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649612486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:47,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:47,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:47,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335246712] [2025-03-04 15:08:47,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:47,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:47,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:47,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:47,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:47,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:47,742 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:47,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:47,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:47,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:47,901 INFO L124 PetriNetUnfolderBase]: 1002/2330 cut-off events. [2025-03-04 15:08:47,902 INFO L125 PetriNetUnfolderBase]: For 2596/2781 co-relation queries the response was YES. [2025-03-04 15:08:47,905 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:47,912 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 58 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2025-03-04 15:08:47,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 75 transitions, 480 flow [2025-03-04 15:08:47,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:08:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:08:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-03-04 15:08:47,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68125 [2025-03-04 15:08:47,913 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:47,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 75 transitions, 480 flow [2025-03-04 15:08:47,916 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:47,917 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 271 flow [2025-03-04 15:08:47,917 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:47,918 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-03-04 15:08:47,918 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 271 flow [2025-03-04 15:08:47,918 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:47,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:47,918 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:47,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:08:47,918 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:47,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:47,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2101859406, now seen corresponding path program 1 times [2025-03-04 15:08:47,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:47,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559739038] [2025-03-04 15:08:47,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:47,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:47,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:08:47,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:08:47,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:47,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:47,976 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:47,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:47,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559739038] [2025-03-04 15:08:47,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559739038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:47,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940328943] [2025-03-04 15:08:47,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:47,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:47,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:47,979 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:47,979 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:48,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:08:48,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:08:48,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:48,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:48,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:08:48,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:48,063 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:48,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:48,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940328943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:48,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:48,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 15:08:48,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048508194] [2025-03-04 15:08:48,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:48,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:08:48,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:48,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:08:48,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:08:48,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:08:48,071 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:48,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:48,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:08:48,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:48,301 INFO L124 PetriNetUnfolderBase]: 1858/3390 cut-off events. [2025-03-04 15:08:48,302 INFO L125 PetriNetUnfolderBase]: For 4438/4674 co-relation queries the response was YES. [2025-03-04 15:08:48,306 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:48,314 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 63 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2025-03-04 15:08:48,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 566 flow [2025-03-04 15:08:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-04 15:08:48,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-04 15:08:48,315 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:48,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 566 flow [2025-03-04 15:08:48,322 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:48,324 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 271 flow [2025-03-04 15:08:48,324 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:48,325 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-03-04 15:08:48,325 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 271 flow [2025-03-04 15:08:48,325 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:48,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:48,325 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:08:48,331 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:48,529 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:48,529 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:48,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:48,529 INFO L85 PathProgramCache]: Analyzing trace with hash -733131992, now seen corresponding path program 1 times [2025-03-04 15:08:48,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:48,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118481034] [2025-03-04 15:08:48,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:48,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:08:48,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:08:48,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:48,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:48,563 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:48,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:48,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118481034] [2025-03-04 15:08:48,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118481034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:48,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:48,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:48,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779351654] [2025-03-04 15:08:48,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:48,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:48,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:48,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:48,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:48,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:08:48,569 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:48,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:48,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:08:48,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:48,758 INFO L124 PetriNetUnfolderBase]: 1583/3216 cut-off events. [2025-03-04 15:08:48,759 INFO L125 PetriNetUnfolderBase]: For 4752/4869 co-relation queries the response was YES. [2025-03-04 15:08:48,765 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:48,773 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 63 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2025-03-04 15:08:48,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 562 flow [2025-03-04 15:08:48,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:48,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-04 15:08:48,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-04 15:08:48,774 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:48,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 562 flow [2025-03-04 15:08:48,781 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:48,782 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 275 flow [2025-03-04 15:08:48,782 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:48,783 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-03-04 15:08:48,783 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 275 flow [2025-03-04 15:08:48,783 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:48,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:48,783 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:48,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:08:48,783 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:48,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:48,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1110404095, now seen corresponding path program 1 times [2025-03-04 15:08:48,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:48,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434180543] [2025-03-04 15:08:48,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:48,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:08:48,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:08:48,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:48,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:48,831 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:48,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:48,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434180543] [2025-03-04 15:08:48,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434180543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:48,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298972295] [2025-03-04 15:08:48,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:48,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:48,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:48,834 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:48,835 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:48,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:08:48,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:08:48,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:48,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:48,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:08:48,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:48,909 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:48,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:48,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298972295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:48,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:48,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:08:48,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790192755] [2025-03-04 15:08:48,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:48,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:08:48,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:48,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:08:48,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:08:48,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-04 15:08:48,919 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:48,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:48,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-04 15:08:48,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:49,160 INFO L124 PetriNetUnfolderBase]: 1521/2931 cut-off events. [2025-03-04 15:08:49,161 INFO L125 PetriNetUnfolderBase]: For 5613/5705 co-relation queries the response was YES. [2025-03-04 15:08:49,166 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:49,173 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 81 selfloop transitions, 6 changer transitions 1/95 dead transitions. [2025-03-04 15:08:49,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 95 transitions, 726 flow [2025-03-04 15:08:49,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:08:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:08:49,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-03-04 15:08:49,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-04 15:08:49,175 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:49,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 95 transitions, 726 flow [2025-03-04 15:08:49,182 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:49,183 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 275 flow [2025-03-04 15:08:49,183 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:49,184 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2025-03-04 15:08:49,184 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 275 flow [2025-03-04 15:08:49,184 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:49,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:49,184 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:49,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:49,385 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:49,385 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:49,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:49,386 INFO L85 PathProgramCache]: Analyzing trace with hash 832893443, now seen corresponding path program 1 times [2025-03-04 15:08:49,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:49,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124370244] [2025-03-04 15:08:49,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:49,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:49,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:08:49,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:08:49,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:49,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:49,427 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:49,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:49,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124370244] [2025-03-04 15:08:49,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124370244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:49,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371862085] [2025-03-04 15:08:49,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:49,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:49,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:49,429 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:49,431 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:49,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:08:49,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:08:49,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:49,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:49,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:08:49,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:49,500 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:49,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:49,529 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:49,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371862085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:49,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:49,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 15:08:49,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993734379] [2025-03-04 15:08:49,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:49,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:08:49,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:49,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:08:49,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:08:49,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:49,530 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:49,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:49,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:49,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:49,753 INFO L124 PetriNetUnfolderBase]: 1339/2904 cut-off events. [2025-03-04 15:08:49,753 INFO L125 PetriNetUnfolderBase]: For 6270/6352 co-relation queries the response was YES. [2025-03-04 15:08:49,759 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:49,766 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 73 selfloop transitions, 12 changer transitions 4/99 dead transitions. [2025-03-04 15:08:49,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 99 transitions, 703 flow [2025-03-04 15:08:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:08:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:08:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2025-03-04 15:08:49,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7053571428571429 [2025-03-04 15:08:49,767 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:49,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 99 transitions, 703 flow [2025-03-04 15:08:49,773 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:49,774 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 379 flow [2025-03-04 15:08:49,774 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:49,775 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2025-03-04 15:08:49,775 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 379 flow [2025-03-04 15:08:49,775 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:49,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:49,775 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:49,780 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:49,975 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:49,975 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:49,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:49,976 INFO L85 PathProgramCache]: Analyzing trace with hash 62788742, now seen corresponding path program 1 times [2025-03-04 15:08:49,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:49,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307685527] [2025-03-04 15:08:49,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:49,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:49,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:08:49,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:08:49,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:49,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:50,008 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:50,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:50,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307685527] [2025-03-04 15:08:50,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307685527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:50,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:50,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:50,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602044490] [2025-03-04 15:08:50,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:50,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:50,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:50,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:50,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:50,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:08:50,014 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:50,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:50,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:08:50,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:50,284 INFO L124 PetriNetUnfolderBase]: 2138/3893 cut-off events. [2025-03-04 15:08:50,284 INFO L125 PetriNetUnfolderBase]: For 10005/10082 co-relation queries the response was YES. [2025-03-04 15:08:50,292 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:50,301 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 69 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2025-03-04 15:08:50,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 81 transitions, 764 flow [2025-03-04 15:08:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:50,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-03-04 15:08:50,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-04 15:08:50,302 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:50,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 81 transitions, 764 flow [2025-03-04 15:08:50,313 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:50,314 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 372 flow [2025-03-04 15:08:50,314 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:50,314 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2025-03-04 15:08:50,314 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 372 flow [2025-03-04 15:08:50,315 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:50,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:50,315 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:50,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:08:50,315 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:50,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:50,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1967023659, now seen corresponding path program 1 times [2025-03-04 15:08:50,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:50,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866347834] [2025-03-04 15:08:50,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:50,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:50,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:08:50,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:08:50,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:50,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:50,377 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:50,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:50,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866347834] [2025-03-04 15:08:50,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866347834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:50,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048370791] [2025-03-04 15:08:50,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:50,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:50,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:50,380 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:50,382 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:50,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:08:50,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:08:50,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:50,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:50,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:08:50,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:50,459 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:50,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:50,526 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:50,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048370791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:50,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:50,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 15:08:50,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882981859] [2025-03-04 15:08:50,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:50,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:08:50,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:50,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:08:50,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:08:50,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:50,527 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:50,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:50,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:50,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:50,884 INFO L124 PetriNetUnfolderBase]: 1744/3743 cut-off events. [2025-03-04 15:08:50,885 INFO L125 PetriNetUnfolderBase]: For 12928/12958 co-relation queries the response was YES. [2025-03-04 15:08:50,892 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:50,898 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 100 selfloop transitions, 17 changer transitions 17/144 dead transitions. [2025-03-04 15:08:50,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 144 transitions, 1032 flow [2025-03-04 15:08:50,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:08:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:08:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 268 transitions. [2025-03-04 15:08:50,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2025-03-04 15:08:50,904 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:50,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 144 transitions, 1032 flow [2025-03-04 15:08:50,912 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:50,913 INFO L231 Difference]: Finished difference. Result has 87 places, 52 transitions, 429 flow [2025-03-04 15:08:50,913 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:50,914 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 52 predicate places. [2025-03-04 15:08:50,914 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 52 transitions, 429 flow [2025-03-04 15:08:50,914 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:50,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:50,914 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:50,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:08:51,119 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:51,119 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:51,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:51,119 INFO L85 PathProgramCache]: Analyzing trace with hash -58641131, now seen corresponding path program 1 times [2025-03-04 15:08:51,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:51,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803841816] [2025-03-04 15:08:51,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:51,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:51,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:08:51,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:08:51,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:51,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:51,199 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:51,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:51,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803841816] [2025-03-04 15:08:51,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803841816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:51,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611469674] [2025-03-04 15:08:51,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:51,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:51,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:51,201 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:51,203 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:51,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:08:51,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:08:51,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:51,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:51,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:08:51,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:51,301 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:51,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:51,382 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:51,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611469674] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:51,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:51,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 15:08:51,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862159219] [2025-03-04 15:08:51,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:51,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 15:08:51,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:51,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:08:51,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:08:51,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:51,384 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:51,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:51,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:51,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:51,975 INFO L124 PetriNetUnfolderBase]: 2554/5409 cut-off events. [2025-03-04 15:08:51,975 INFO L125 PetriNetUnfolderBase]: For 19397/19439 co-relation queries the response was YES. [2025-03-04 15:08:51,988 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:51,996 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 120 selfloop transitions, 24 changer transitions 25/179 dead transitions. [2025-03-04 15:08:51,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 179 transitions, 1332 flow [2025-03-04 15:08:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:08:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:08:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 334 transitions. [2025-03-04 15:08:51,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6958333333333333 [2025-03-04 15:08:51,998 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:51,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 179 transitions, 1332 flow [2025-03-04 15:08:52,013 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:52,014 INFO L231 Difference]: Finished difference. Result has 105 places, 60 transitions, 580 flow [2025-03-04 15:08:52,014 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:52,015 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2025-03-04 15:08:52,015 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 60 transitions, 580 flow [2025-03-04 15:08:52,015 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:52,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:52,015 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:52,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:08:52,217 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:52,217 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:52,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:52,218 INFO L85 PathProgramCache]: Analyzing trace with hash -233061099, now seen corresponding path program 2 times [2025-03-04 15:08:52,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:52,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521736083] [2025-03-04 15:08:52,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:52,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:52,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-04 15:08:52,235 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:52,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:52,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:52,444 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:52,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:52,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521736083] [2025-03-04 15:08:52,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521736083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:52,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310876096] [2025-03-04 15:08:52,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:52,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:52,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:52,447 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:52,452 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:52,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-04 15:08:52,501 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:52,502 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:52,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:52,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:08:52,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:08:52,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:52,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310876096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:52,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:52,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 26 [2025-03-04 15:08:52,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552419789] [2025-03-04 15:08:52,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:52,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:08:52,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:52,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:08:52,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:08:52,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:08:52,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 60 transitions, 580 flow. Second operand has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 states have internal predecessors, (147), 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,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:52,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:08:52,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:53,807 INFO L124 PetriNetUnfolderBase]: 7304/12824 cut-off events. [2025-03-04 15:08:53,807 INFO L125 PetriNetUnfolderBase]: For 30582/30824 co-relation queries the response was YES. [2025-03-04 15:08:53,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41542 conditions, 12824 events. 7304/12824 cut-off events. For 30582/30824 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 87461 event pairs, 293 based on Foata normal form. 552/13370 useless extension candidates. Maximal degree in co-relation 41505. Up to 2208 conditions per place. [2025-03-04 15:08:53,843 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 0 selfloop transitions, 0 changer transitions 243/243 dead transitions. [2025-03-04 15:08:53,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 243 transitions, 2451 flow [2025-03-04 15:08:53,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:08:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:08:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 231 transitions. [2025-03-04 15:08:53,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5552884615384616 [2025-03-04 15:08:53,844 INFO L175 Difference]: Start difference. First operand has 105 places, 60 transitions, 580 flow. Second operand 13 states and 231 transitions. [2025-03-04 15:08:53,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 243 transitions, 2451 flow [2025-03-04 15:08:53,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 243 transitions, 1925 flow, removed 4 selfloop flow, removed 30 redundant places. [2025-03-04 15:08:53,870 INFO L231 Difference]: Finished difference. Result has 82 places, 0 transitions, 0 flow [2025-03-04 15:08:53,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=82, PETRI_TRANSITIONS=0} [2025-03-04 15:08:53,870 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 47 predicate places. [2025-03-04 15:08:53,870 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 0 transitions, 0 flow [2025-03-04 15:08:53,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 states have internal predecessors, (147), 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,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-04 15:08:53,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2025-03-04 15:08:53,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-04 15:08:53,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-04 15:08:53,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-04 15:08:53,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-04 15:08:53,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-04 15:08:53,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-04 15:08:53,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-04 15:08:53,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-04 15:08:53,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-04 15:08:53,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-04 15:08:53,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-04 15:08:53,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-04 15:08:53,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-04 15:08:53,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-04 15:08:53,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-04 15:08:53,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-04 15:08:53,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:08:54,073 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:54,074 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:54,077 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:08:54,077 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:08:54,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:08:54 BasicIcfg [2025-03-04 15:08:54,081 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:08:54,081 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:08:54,081 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:08:54,082 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:08:54,082 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:45" (3/4) ... [2025-03-04 15:08:54,083 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:08:54,085 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-04 15:08:54,085 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-04 15:08:54,087 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-04 15:08:54,087 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-04 15:08:54,087 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 15:08:54,087 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 15:08:54,087 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 15:08:54,137 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:08:54,137 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:08:54,137 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:08:54,138 INFO L158 Benchmark]: Toolchain (without parser) took 9542.94ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 122.6MB in the beginning and 273.7MB in the end (delta: -151.0MB). Peak memory consumption was 125.5MB. Max. memory is 16.1GB. [2025-03-04 15:08:54,138 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:08:54,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.79ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 103.8MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:08:54,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.89ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 102.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:08:54,139 INFO L158 Benchmark]: Boogie Preprocessor took 22.08ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 100.8MB in the end (delta: 956.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:08:54,139 INFO L158 Benchmark]: IcfgBuilder took 297.59ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 79.9MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:08:54,139 INFO L158 Benchmark]: TraceAbstraction took 8795.69ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 79.3MB in the beginning and 277.9MB in the end (delta: -198.7MB). Peak memory consumption was 310.0MB. Max. memory is 16.1GB. [2025-03-04 15:08:54,139 INFO L158 Benchmark]: Witness Printer took 56.22ms. Allocated memory is still 444.6MB. Free memory was 277.9MB in the beginning and 273.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:08:54,140 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.55ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.79ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 103.8MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.89ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 102.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.08ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 100.8MB in the end (delta: 956.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 297.59ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 79.9MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8795.69ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 79.3MB in the beginning and 277.9MB in the end (delta: -198.7MB). Peak memory consumption was 310.0MB. Max. memory is 16.1GB. * Witness Printer took 56.22ms. Allocated memory is still 444.6MB. Free memory was 277.9MB in the beginning and 273.7MB in the end (delta: 4.3MB). 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: 8.7s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1207 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1178 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1959 IncrementalHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 20 mSDtfsCounter, 1959 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=580occurred in iteration=17, InterpolantAutomatonStates: 103, 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, 1.4s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 488 ConstructedInterpolants, 0 QuantifiedInterpolants, 1370 SizeOfPredicates, 20 NumberOfNonLiveVariables, 688 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 27 InterpolantComputations, 15 PerfectInterpolantSequences, 123/347 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:08:54,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE