./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/triangular-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:53:42,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:53:43,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:53:43,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:53:43,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:53:43,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:53:43,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:53:43,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:53:43,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:53:43,029 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:53:43,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:53:43,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:53:43,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:53:43,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:53:43,029 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:53:43,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:53:43,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:53:43,029 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:53:43,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:53:43,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:53:43,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:53:43,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:53:43,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:53:43,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:53:43,030 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:53:43,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:53:43,030 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2025-02-08 13:53:43,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:53:43,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:53:43,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:53:43,269 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:53:43,269 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:53:43,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-2.i [2025-02-08 13:53:44,382 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8894ebdd0/4b88e6cc1a6449f69fb9ae25bdefda5f/FLAG24e9e1793 [2025-02-08 13:53:44,656 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:53:44,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2025-02-08 13:53:44,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8894ebdd0/4b88e6cc1a6449f69fb9ae25bdefda5f/FLAG24e9e1793 [2025-02-08 13:53:44,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8894ebdd0/4b88e6cc1a6449f69fb9ae25bdefda5f [2025-02-08 13:53:44,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:53:44,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:53:44,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:53:44,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:53:44,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:53:44,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:53:44" (1/1) ... [2025-02-08 13:53:44,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bbd8ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:44, skipping insertion in model container [2025-02-08 13:53:44,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:53:44" (1/1) ... [2025-02-08 13:53:44,988 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:53:45,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:53:45,198 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:53:45,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:53:45,249 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:53:45,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:45 WrapperNode [2025-02-08 13:53:45,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:53:45,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:53:45,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:53:45,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:53:45,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:45" (1/1) ... [2025-02-08 13:53:45,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:45" (1/1) ... [2025-02-08 13:53:45,274 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-02-08 13:53:45,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:53:45,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:53:45,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:53:45,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:53:45,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:45" (1/1) ... [2025-02-08 13:53:45,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:45" (1/1) ... [2025-02-08 13:53:45,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:45" (1/1) ... [2025-02-08 13:53:45,292 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 13:53:45,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:45" (1/1) ... [2025-02-08 13:53:45,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:45" (1/1) ... [2025-02-08 13:53:45,296 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:45" (1/1) ... [2025-02-08 13:53:45,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:45" (1/1) ... [2025-02-08 13:53:45,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:45" (1/1) ... [2025-02-08 13:53:45,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:45" (1/1) ... [2025-02-08 13:53:45,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:53:45,300 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:53:45,300 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:53:45,300 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:53:45,301 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:45" (1/1) ... [2025-02-08 13:53:45,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:53:45,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:53:45,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:53:45,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:53:45,345 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-08 13:53:45,346 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-08 13:53:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-08 13:53:45,346 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-08 13:53:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 13:53:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:53:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:53:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 13:53:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:53:45,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:53:45,347 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 13:53:45,432 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:53:45,434 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:53:45,577 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 13:53:45,578 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:53:45,674 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:53:45,675 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:53:45,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:53:45 BoogieIcfgContainer [2025-02-08 13:53:45,676 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:53:45,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:53:45,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:53:45,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:53:45,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:53:44" (1/3) ... [2025-02-08 13:53:45,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662b713a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:53:45, skipping insertion in model container [2025-02-08 13:53:45,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:45" (2/3) ... [2025-02-08 13:53:45,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662b713a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:53:45, skipping insertion in model container [2025-02-08 13:53:45,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:53:45" (3/3) ... [2025-02-08 13:53:45,685 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2025-02-08 13:53:45,696 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:53:45,697 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-02-08 13:53:45,697 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 13:53:45,726 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:53:45,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 72 flow [2025-02-08 13:53:45,774 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2025-02-08 13:53:45,775 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:53:45,781 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-02-08 13:53:45,781 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 32 transitions, 72 flow [2025-02-08 13:53:45,784 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 30 transitions, 66 flow [2025-02-08 13:53:45,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:53:45,804 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;@30d90940, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:53:45,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-08 13:53:45,817 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:53:45,817 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-02-08 13:53:45,817 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:53:45,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:45,817 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 13:53:45,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:45,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:45,825 INFO L85 PathProgramCache]: Analyzing trace with hash 184371562, now seen corresponding path program 1 times [2025-02-08 13:53:45,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:45,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92615423] [2025-02-08 13:53:45,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:45,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:45,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 13:53:45,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 13:53:45,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:45,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:46,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:46,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92615423] [2025-02-08 13:53:46,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92615423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:46,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:53:46,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:53:46,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842550627] [2025-02-08 13:53:46,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:46,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:53:46,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:46,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:53:46,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:53:46,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-08 13:53:46,072 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-02-08 13:53:46,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:46,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-08 13:53:46,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:46,267 INFO L124 PetriNetUnfolderBase]: 510/941 cut-off events. [2025-02-08 13:53:46,268 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 13:53:46,270 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-02-08 13:53:46,275 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 31 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-02-08 13:53:46,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 162 flow [2025-02-08 13:53:46,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:53:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:53:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-02-08 13:53:46,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395833333333334 [2025-02-08 13:53:46,285 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 66 flow. Second operand 3 states and 71 transitions. [2025-02-08 13:53:46,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 162 flow [2025-02-08 13:53:46,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:53:46,290 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 86 flow [2025-02-08 13:53:46,292 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-02-08 13:53:46,294 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-02-08 13:53:46,294 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 86 flow [2025-02-08 13:53:46,294 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-02-08 13:53:46,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:46,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 13:53:46,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:53:46,295 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:46,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:46,295 INFO L85 PathProgramCache]: Analyzing trace with hash 184371563, now seen corresponding path program 1 times [2025-02-08 13:53:46,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:46,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158244604] [2025-02-08 13:53:46,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:46,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:46,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 13:53:46,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 13:53:46,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:46,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:46,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:46,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158244604] [2025-02-08 13:53:46,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158244604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:46,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:53:46,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:53:46,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330409995] [2025-02-08 13:53:46,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:46,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:53:46,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:46,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:53:46,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:53:46,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-08 13:53:46,336 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-02-08 13:53:46,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:46,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-08 13:53:46,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:46,464 INFO L124 PetriNetUnfolderBase]: 499/971 cut-off events. [2025-02-08 13:53:46,464 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2025-02-08 13:53:46,466 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-02-08 13:53:46,470 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 31 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-02-08 13:53:46,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 186 flow [2025-02-08 13:53:46,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:53:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:53:46,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-02-08 13:53:46,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2025-02-08 13:53:46,471 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 86 flow. Second operand 3 states and 70 transitions. [2025-02-08 13:53:46,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 186 flow [2025-02-08 13:53:46,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:53:46,473 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 100 flow [2025-02-08 13:53:46,473 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-02-08 13:53:46,474 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-02-08 13:53:46,474 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 100 flow [2025-02-08 13:53:46,474 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-02-08 13:53:46,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:46,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:46,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 13:53:46,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:46,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:46,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1087419662, now seen corresponding path program 1 times [2025-02-08 13:53:46,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:46,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277831340] [2025-02-08 13:53:46,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:46,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:46,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:53:46,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:53:46,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:46,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:46,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:46,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277831340] [2025-02-08 13:53:46,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277831340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:46,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:53:46,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:53:46,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421669157] [2025-02-08 13:53:46,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:46,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:53:46,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:46,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:53:46,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:53:46,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-08 13:53:46,554 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-02-08 13:53:46,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:46,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-08 13:53:46,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:46,750 INFO L124 PetriNetUnfolderBase]: 1181/2230 cut-off events. [2025-02-08 13:53:46,750 INFO L125 PetriNetUnfolderBase]: For 710/710 co-relation queries the response was YES. [2025-02-08 13:53:46,753 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-02-08 13:53:46,761 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 56 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2025-02-08 13:53:46,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 322 flow [2025-02-08 13:53:46,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:53:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:53:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-02-08 13:53:46,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7109375 [2025-02-08 13:53:46,762 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 100 flow. Second operand 4 states and 91 transitions. [2025-02-08 13:53:46,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 322 flow [2025-02-08 13:53:46,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 66 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 13:53:46,764 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 120 flow [2025-02-08 13:53:46,764 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-02-08 13:53:46,764 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-02-08 13:53:46,764 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 120 flow [2025-02-08 13:53:46,765 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-02-08 13:53:46,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:46,765 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:46,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:53:46,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:46,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:46,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1067763560, now seen corresponding path program 1 times [2025-02-08 13:53:46,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:46,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453835466] [2025-02-08 13:53:46,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:46,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:46,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:53:46,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:53:46,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:46,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:46,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:46,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453835466] [2025-02-08 13:53:46,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453835466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:46,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:53:46,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:53:46,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715623493] [2025-02-08 13:53:46,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:46,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:53:46,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:46,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:53:46,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:53:46,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-08 13:53:46,850 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-02-08 13:53:46,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:46,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-08 13:53:46,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:46,981 INFO L124 PetriNetUnfolderBase]: 791/1734 cut-off events. [2025-02-08 13:53:46,981 INFO L125 PetriNetUnfolderBase]: For 752/768 co-relation queries the response was YES. [2025-02-08 13:53:46,986 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-02-08 13:53:46,992 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 41 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-02-08 13:53:46,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 279 flow [2025-02-08 13:53:46,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:53:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:53:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-02-08 13:53:46,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7604166666666666 [2025-02-08 13:53:46,993 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 120 flow. Second operand 3 states and 73 transitions. [2025-02-08 13:53:46,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 279 flow [2025-02-08 13:53:46,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 13:53:46,994 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 140 flow [2025-02-08 13:53:46,994 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-02-08 13:53:46,995 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2025-02-08 13:53:46,995 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 140 flow [2025-02-08 13:53:46,995 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-02-08 13:53:46,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:46,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:46,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:53:46,995 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:46,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:46,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1067763561, now seen corresponding path program 1 times [2025-02-08 13:53:46,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:46,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140796004] [2025-02-08 13:53:46,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:46,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:47,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:53:47,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:53:47,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:47,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:47,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:47,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140796004] [2025-02-08 13:53:47,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140796004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:47,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:53:47,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:53:47,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746439183] [2025-02-08 13:53:47,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:47,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:53:47,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:47,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:53:47,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:53:47,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-08 13:53:47,035 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-02-08 13:53:47,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:47,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-08 13:53:47,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:47,185 INFO L124 PetriNetUnfolderBase]: 753/1716 cut-off events. [2025-02-08 13:53:47,185 INFO L125 PetriNetUnfolderBase]: For 1013/1029 co-relation queries the response was YES. [2025-02-08 13:53:47,187 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-02-08 13:53:47,191 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 41 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-02-08 13:53:47,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 302 flow [2025-02-08 13:53:47,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:53:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:53:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-02-08 13:53:47,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-02-08 13:53:47,192 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 140 flow. Second operand 3 states and 72 transitions. [2025-02-08 13:53:47,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 302 flow [2025-02-08 13:53:47,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:53:47,194 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 154 flow [2025-02-08 13:53:47,194 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-02-08 13:53:47,195 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2025-02-08 13:53:47,195 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 154 flow [2025-02-08 13:53:47,195 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-02-08 13:53:47,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:47,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:47,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:53:47,195 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:47,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:47,198 INFO L85 PathProgramCache]: Analyzing trace with hash -376394516, now seen corresponding path program 1 times [2025-02-08 13:53:47,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:47,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429243395] [2025-02-08 13:53:47,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:47,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:47,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 13:53:47,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 13:53:47,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:47,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:47,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:47,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429243395] [2025-02-08 13:53:47,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429243395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:47,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:53:47,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:53:47,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257117147] [2025-02-08 13:53:47,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:47,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:53:47,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:47,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:53:47,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:53:47,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-08 13:53:47,246 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-02-08 13:53:47,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:47,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-08 13:53:47,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:47,426 INFO L124 PetriNetUnfolderBase]: 1197/2294 cut-off events. [2025-02-08 13:53:47,426 INFO L125 PetriNetUnfolderBase]: For 1748/1947 co-relation queries the response was YES. [2025-02-08 13:53:47,431 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-02-08 13:53:47,439 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 57 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2025-02-08 13:53:47,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 396 flow [2025-02-08 13:53:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:53:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:53:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-02-08 13:53:47,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2025-02-08 13:53:47,442 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 154 flow. Second operand 4 states and 87 transitions. [2025-02-08 13:53:47,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 396 flow [2025-02-08 13:53:47,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 13:53:47,445 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 174 flow [2025-02-08 13:53:47,445 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-02-08 13:53:47,447 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2025-02-08 13:53:47,447 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 174 flow [2025-02-08 13:53:47,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:53:47,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:47,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:47,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:53:47,448 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:47,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:47,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1986370296, now seen corresponding path program 1 times [2025-02-08 13:53:47,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:47,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476904599] [2025-02-08 13:53:47,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:47,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:47,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:53:47,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:53:47,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:47,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:47,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:47,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476904599] [2025-02-08 13:53:47,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476904599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:47,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:53:47,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:53:47,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683462417] [2025-02-08 13:53:47,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:47,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:53:47,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:47,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:53:47,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:53:47,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-08 13:53:47,498 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-02-08 13:53:47,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:47,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-08 13:53:47,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:47,688 INFO L124 PetriNetUnfolderBase]: 1021/2270 cut-off events. [2025-02-08 13:53:47,689 INFO L125 PetriNetUnfolderBase]: For 1871/2056 co-relation queries the response was YES. [2025-02-08 13:53:47,693 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-02-08 13:53:47,702 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 58 selfloop transitions, 11 changer transitions 0/81 dead transitions. [2025-02-08 13:53:47,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 477 flow [2025-02-08 13:53:47,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:53:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 13:53:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-02-08 13:53:47,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.725 [2025-02-08 13:53:47,703 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 174 flow. Second operand 5 states and 116 transitions. [2025-02-08 13:53:47,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 477 flow [2025-02-08 13:53:47,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 472 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 13:53:47,707 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 272 flow [2025-02-08 13:53:47,707 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-02-08 13:53:47,708 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2025-02-08 13:53:47,708 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 272 flow [2025-02-08 13:53:47,708 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-02-08 13:53:47,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:47,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:47,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:53:47,708 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:47,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:47,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1986370295, now seen corresponding path program 1 times [2025-02-08 13:53:47,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:47,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667745679] [2025-02-08 13:53:47,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:47,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:47,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:53:47,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:53:47,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:47,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:47,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:47,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667745679] [2025-02-08 13:53:47,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667745679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:47,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:53:47,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:53:47,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490917830] [2025-02-08 13:53:47,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:47,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:53:47,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:47,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:53:47,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:53:47,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-08 13:53:47,740 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-02-08 13:53:47,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:47,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-08 13:53:47,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:47,941 INFO L124 PetriNetUnfolderBase]: 1098/2481 cut-off events. [2025-02-08 13:53:47,941 INFO L125 PetriNetUnfolderBase]: For 4261/4434 co-relation queries the response was YES. [2025-02-08 13:53:47,947 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-02-08 13:53:47,957 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 63 selfloop transitions, 9 changer transitions 0/84 dead transitions. [2025-02-08 13:53:47,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 564 flow [2025-02-08 13:53:47,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:53:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 13:53:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-02-08 13:53:47,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.73125 [2025-02-08 13:53:47,958 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 272 flow. Second operand 5 states and 117 transitions. [2025-02-08 13:53:47,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 564 flow [2025-02-08 13:53:47,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 541 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 13:53:47,965 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 327 flow [2025-02-08 13:53:47,965 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-02-08 13:53:47,965 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2025-02-08 13:53:47,965 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 327 flow [2025-02-08 13:53:47,965 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-02-08 13:53:47,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:47,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:47,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:53:47,966 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:47,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:47,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1673537801, now seen corresponding path program 1 times [2025-02-08 13:53:47,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:47,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265465074] [2025-02-08 13:53:47,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:47,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:47,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:53:47,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:53:47,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:47,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:47,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265465074] [2025-02-08 13:53:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265465074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:47,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:53:47,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:53:47,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118917342] [2025-02-08 13:53:47,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:47,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:53:47,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:47,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:53:47,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:53:47,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-08 13:53:47,998 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-02-08 13:53:47,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:47,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-08 13:53:47,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:48,138 INFO L124 PetriNetUnfolderBase]: 903/1917 cut-off events. [2025-02-08 13:53:48,139 INFO L125 PetriNetUnfolderBase]: For 3740/3971 co-relation queries the response was YES. [2025-02-08 13:53:48,142 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-02-08 13:53:48,148 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 32 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2025-02-08 13:53:48,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 45 transitions, 330 flow [2025-02-08 13:53:48,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:53:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:53:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-02-08 13:53:48,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-02-08 13:53:48,150 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 327 flow. Second operand 3 states and 56 transitions. [2025-02-08 13:53:48,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 45 transitions, 330 flow [2025-02-08 13:53:48,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 45 transitions, 314 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-02-08 13:53:48,160 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 250 flow [2025-02-08 13:53:48,160 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-02-08 13:53:48,160 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2025-02-08 13:53:48,160 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 250 flow [2025-02-08 13:53:48,165 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-02-08 13:53:48,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:48,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:48,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:53:48,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:48,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:48,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1673537800, now seen corresponding path program 1 times [2025-02-08 13:53:48,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:48,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312717108] [2025-02-08 13:53:48,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:48,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:48,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:53:48,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:53:48,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:48,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:48,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:48,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312717108] [2025-02-08 13:53:48,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312717108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:48,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:53:48,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:53:48,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848462593] [2025-02-08 13:53:48,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:48,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:53:48,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:48,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:53:48,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:53:48,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-08 13:53:48,210 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-02-08 13:53:48,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:48,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-08 13:53:48,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:48,400 INFO L124 PetriNetUnfolderBase]: 1002/2330 cut-off events. [2025-02-08 13:53:48,400 INFO L125 PetriNetUnfolderBase]: For 2596/2781 co-relation queries the response was YES. [2025-02-08 13:53:48,406 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-02-08 13:53:48,413 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 58 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2025-02-08 13:53:48,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 75 transitions, 480 flow [2025-02-08 13:53:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:53:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 13:53:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-02-08 13:53:48,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68125 [2025-02-08 13:53:48,415 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 250 flow. Second operand 5 states and 109 transitions. [2025-02-08 13:53:48,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 75 transitions, 480 flow [2025-02-08 13:53:48,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 75 transitions, 475 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 13:53:48,419 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 271 flow [2025-02-08 13:53:48,419 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-02-08 13:53:48,420 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-02-08 13:53:48,420 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 271 flow [2025-02-08 13:53:48,421 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-02-08 13:53:48,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:48,421 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:48,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:53:48,421 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:48,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:48,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1089920270, now seen corresponding path program 1 times [2025-02-08 13:53:48,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:48,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557702470] [2025-02-08 13:53:48,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:48,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:48,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:53:48,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:53:48,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:48,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:48,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:48,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:48,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557702470] [2025-02-08 13:53:48,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557702470] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:53:48,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310927689] [2025-02-08 13:53:48,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:48,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:53:48,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:53:48,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:53:48,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:53:48,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:53:48,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:53:48,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:48,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:48,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:53:48,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:53:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:48,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:53:48,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310927689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:48,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:53:48,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-02-08 13:53:48,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844239927] [2025-02-08 13:53:48,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:48,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:53:48,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:48,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:53:48,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:53:48,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-02-08 13:53:48,594 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-02-08 13:53:48,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:48,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-02-08 13:53:48,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:48,826 INFO L124 PetriNetUnfolderBase]: 1858/3390 cut-off events. [2025-02-08 13:53:48,826 INFO L125 PetriNetUnfolderBase]: For 4438/4674 co-relation queries the response was YES. [2025-02-08 13:53:48,834 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-02-08 13:53:48,842 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 63 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2025-02-08 13:53:48,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 566 flow [2025-02-08 13:53:48,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:53:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:53:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-02-08 13:53:48,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-02-08 13:53:48,844 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 271 flow. Second operand 4 states and 76 transitions. [2025-02-08 13:53:48,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 566 flow [2025-02-08 13:53:48,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 552 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 13:53:48,851 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 271 flow [2025-02-08 13:53:48,851 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-02-08 13:53:48,852 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-02-08 13:53:48,852 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 271 flow [2025-02-08 13:53:48,852 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-02-08 13:53:48,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:48,852 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 13:53:48,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 13:53:49,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 13:53:49,054 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:49,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:49,054 INFO L85 PathProgramCache]: Analyzing trace with hash 572210151, now seen corresponding path program 1 times [2025-02-08 13:53:49,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:49,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754824884] [2025-02-08 13:53:49,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:49,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:49,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 13:53:49,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 13:53:49,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:49,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:53:49,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:49,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754824884] [2025-02-08 13:53:49,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754824884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:49,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:53:49,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:53:49,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750553835] [2025-02-08 13:53:49,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:49,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:53:49,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:49,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:53:49,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:53:49,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-02-08 13:53:49,093 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-02-08 13:53:49,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:49,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-02-08 13:53:49,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:49,306 INFO L124 PetriNetUnfolderBase]: 1583/3216 cut-off events. [2025-02-08 13:53:49,306 INFO L125 PetriNetUnfolderBase]: For 4752/4869 co-relation queries the response was YES. [2025-02-08 13:53:49,313 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-02-08 13:53:49,320 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 63 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2025-02-08 13:53:49,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 562 flow [2025-02-08 13:53:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:53:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:53:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-02-08 13:53:49,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-02-08 13:53:49,321 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 271 flow. Second operand 4 states and 76 transitions. [2025-02-08 13:53:49,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 562 flow [2025-02-08 13:53:49,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 550 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 13:53:49,328 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 275 flow [2025-02-08 13:53:49,329 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-02-08 13:53:49,329 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-02-08 13:53:49,329 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 275 flow [2025-02-08 13:53:49,329 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-02-08 13:53:49,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:49,329 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:49,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:53:49,330 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:49,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1373662433, now seen corresponding path program 1 times [2025-02-08 13:53:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:49,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297539566] [2025-02-08 13:53:49,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:49,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:49,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 13:53:49,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 13:53:49,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:49,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:49,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:49,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297539566] [2025-02-08 13:53:49,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297539566] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:53:49,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080548721] [2025-02-08 13:53:49,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:49,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:53:49,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:53:49,389 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:53:49,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:53:49,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 13:53:49,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 13:53:49,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:49,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:49,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:53:49,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:53:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:49,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:53:49,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080548721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:49,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:53:49,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 13:53:49,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041104182] [2025-02-08 13:53:49,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:49,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:53:49,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:49,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:53:49,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:53:49,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-08 13:53:49,492 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-02-08 13:53:49,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:49,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-08 13:53:49,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:49,752 INFO L124 PetriNetUnfolderBase]: 1521/2931 cut-off events. [2025-02-08 13:53:49,752 INFO L125 PetriNetUnfolderBase]: For 5613/5705 co-relation queries the response was YES. [2025-02-08 13:53:49,759 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-02-08 13:53:49,766 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 81 selfloop transitions, 6 changer transitions 1/95 dead transitions. [2025-02-08 13:53:49,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 95 transitions, 726 flow [2025-02-08 13:53:49,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:53:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 13:53:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-02-08 13:53:49,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-02-08 13:53:49,768 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 275 flow. Second operand 6 states and 114 transitions. [2025-02-08 13:53:49,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 95 transitions, 726 flow [2025-02-08 13:53:49,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 95 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:53:49,773 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 275 flow [2025-02-08 13:53:49,774 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-02-08 13:53:49,774 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2025-02-08 13:53:49,774 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 275 flow [2025-02-08 13:53:49,774 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-02-08 13:53:49,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:49,774 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:49,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 13:53:49,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:53:49,975 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:49,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:49,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1136242402, now seen corresponding path program 1 times [2025-02-08 13:53:49,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:49,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37136965] [2025-02-08 13:53:49,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:49,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:49,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 13:53:49,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 13:53:49,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:49,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:50,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:50,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37136965] [2025-02-08 13:53:50,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37136965] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:53:50,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111670587] [2025-02-08 13:53:50,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:50,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:53:50,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:53:50,020 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:53:50,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:53:50,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 13:53:50,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 13:53:50,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:50,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:50,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:53:50,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:53:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:50,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:53:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:50,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111670587] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:53:50,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:53:50,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:53:50,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103933716] [2025-02-08 13:53:50,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:53:50,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 13:53:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:50,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 13:53:50,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:53:50,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-08 13:53:50,141 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-02-08 13:53:50,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:50,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-08 13:53:50,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:50,420 INFO L124 PetriNetUnfolderBase]: 1339/2904 cut-off events. [2025-02-08 13:53:50,421 INFO L125 PetriNetUnfolderBase]: For 6270/6352 co-relation queries the response was YES. [2025-02-08 13:53:50,429 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-02-08 13:53:50,437 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 73 selfloop transitions, 12 changer transitions 4/99 dead transitions. [2025-02-08 13:53:50,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 99 transitions, 703 flow [2025-02-08 13:53:50,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:53:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 13:53:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2025-02-08 13:53:50,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7053571428571429 [2025-02-08 13:53:50,439 INFO L175 Difference]: Start difference. First operand has 65 places, 44 transitions, 275 flow. Second operand 7 states and 158 transitions. [2025-02-08 13:53:50,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 99 transitions, 703 flow [2025-02-08 13:53:50,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 99 transitions, 676 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-02-08 13:53:50,447 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 379 flow [2025-02-08 13:53:50,447 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-02-08 13:53:50,447 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2025-02-08 13:53:50,447 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 379 flow [2025-02-08 13:53:50,447 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-02-08 13:53:50,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:50,448 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:50,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 13:53:50,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:53:50,651 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:50,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:50,652 INFO L85 PathProgramCache]: Analyzing trace with hash 366137701, now seen corresponding path program 1 times [2025-02-08 13:53:50,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:50,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856343066] [2025-02-08 13:53:50,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:50,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:50,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 13:53:50,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 13:53:50,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:50,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:53:50,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:50,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856343066] [2025-02-08 13:53:50,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856343066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:50,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:53:50,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:53:50,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428682464] [2025-02-08 13:53:50,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:50,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:53:50,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:50,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:53:50,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:53:50,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-02-08 13:53:50,744 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-02-08 13:53:50,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:50,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-02-08 13:53:50,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:51,219 INFO L124 PetriNetUnfolderBase]: 2138/3893 cut-off events. [2025-02-08 13:53:51,220 INFO L125 PetriNetUnfolderBase]: For 10005/10082 co-relation queries the response was YES. [2025-02-08 13:53:51,229 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-02-08 13:53:51,237 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 69 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2025-02-08 13:53:51,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 81 transitions, 764 flow [2025-02-08 13:53:51,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:53:51,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:53:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-02-08 13:53:51,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-02-08 13:53:51,238 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 379 flow. Second operand 4 states and 72 transitions. [2025-02-08 13:53:51,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 81 transitions, 764 flow [2025-02-08 13:53:51,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 729 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-02-08 13:53:51,249 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 372 flow [2025-02-08 13:53:51,249 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-02-08 13:53:51,249 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2025-02-08 13:53:51,249 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 372 flow [2025-02-08 13:53:51,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:53:51,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:51,249 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:51,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 13:53:51,249 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:51,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:51,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1824892076, now seen corresponding path program 1 times [2025-02-08 13:53:51,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:51,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412084787] [2025-02-08 13:53:51,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:51,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:51,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 13:53:51,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 13:53:51,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:51,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:51,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:51,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412084787] [2025-02-08 13:53:51,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412084787] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:53:51,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64080789] [2025-02-08 13:53:51,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:51,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:53:51,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:53:51,311 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:53:51,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 13:53:51,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 13:53:51,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 13:53:51,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:51,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:51,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:53:51,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:53:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:51,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:53:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:51,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64080789] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:53:51,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:53:51,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 13:53:51,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516821936] [2025-02-08 13:53:51,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:53:51,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 13:53:51,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:51,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 13:53:51,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-02-08 13:53:51,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-08 13:53:51,440 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-02-08 13:53:51,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:51,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-08 13:53:51,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:51,767 INFO L124 PetriNetUnfolderBase]: 1744/3743 cut-off events. [2025-02-08 13:53:51,767 INFO L125 PetriNetUnfolderBase]: For 12928/12958 co-relation queries the response was YES. [2025-02-08 13:53:51,776 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-02-08 13:53:51,783 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 100 selfloop transitions, 17 changer transitions 17/144 dead transitions. [2025-02-08 13:53:51,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 144 transitions, 1032 flow [2025-02-08 13:53:51,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 13:53:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 13:53:51,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 268 transitions. [2025-02-08 13:53:51,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2025-02-08 13:53:51,785 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 372 flow. Second operand 12 states and 268 transitions. [2025-02-08 13:53:51,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 144 transitions, 1032 flow [2025-02-08 13:53:51,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 144 transitions, 995 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-02-08 13:53:51,793 INFO L231 Difference]: Finished difference. Result has 87 places, 52 transitions, 429 flow [2025-02-08 13:53:51,793 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-02-08 13:53:51,794 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 52 predicate places. [2025-02-08 13:53:51,794 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 52 transitions, 429 flow [2025-02-08 13:53:51,794 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-02-08 13:53:51,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:51,794 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:51,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 13:53:51,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 13:53:51,995 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:51,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:51,995 INFO L85 PathProgramCache]: Analyzing trace with hash -266816716, now seen corresponding path program 1 times [2025-02-08 13:53:51,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:51,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607584285] [2025-02-08 13:53:51,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:52,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 13:53:52,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 13:53:52,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:52,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:52,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:52,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607584285] [2025-02-08 13:53:52,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607584285] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:53:52,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529931654] [2025-02-08 13:53:52,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:52,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:53:52,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:53:52,113 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:53:52,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:53:52,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 13:53:52,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 13:53:52,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:52,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:52,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 13:53:52,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:53:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:52,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:53:52,332 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:52,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529931654] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:53:52,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:53:52,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-02-08 13:53:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451207777] [2025-02-08 13:53:52,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:53:52,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 13:53:52,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:52,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 13:53:52,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-02-08 13:53:52,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-08 13:53:52,333 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-02-08 13:53:52,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:52,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-08 13:53:52,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:52,990 INFO L124 PetriNetUnfolderBase]: 2554/5409 cut-off events. [2025-02-08 13:53:52,991 INFO L125 PetriNetUnfolderBase]: For 19397/19439 co-relation queries the response was YES. [2025-02-08 13:53:53,003 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-02-08 13:53:53,010 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 120 selfloop transitions, 24 changer transitions 25/179 dead transitions. [2025-02-08 13:53:53,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 179 transitions, 1332 flow [2025-02-08 13:53:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 13:53:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 13:53:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 334 transitions. [2025-02-08 13:53:53,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6958333333333333 [2025-02-08 13:53:53,017 INFO L175 Difference]: Start difference. First operand has 87 places, 52 transitions, 429 flow. Second operand 15 states and 334 transitions. [2025-02-08 13:53:53,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 179 transitions, 1332 flow [2025-02-08 13:53:53,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 179 transitions, 1319 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-02-08 13:53:53,031 INFO L231 Difference]: Finished difference. Result has 105 places, 60 transitions, 580 flow [2025-02-08 13:53:53,031 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-02-08 13:53:53,032 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2025-02-08 13:53:53,032 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 60 transitions, 580 flow [2025-02-08 13:53:53,032 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-02-08 13:53:53,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:53,032 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:53,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 13:53:53,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 13:53:53,235 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-02-08 13:53:53,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:53,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1867265772, now seen corresponding path program 2 times [2025-02-08 13:53:53,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:53,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58368813] [2025-02-08 13:53:53,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:53:53,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:53,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-02-08 13:53:53,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 13:53:53,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:53:53,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:53,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:53,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58368813] [2025-02-08 13:53:53,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58368813] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:53:53,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249169610] [2025-02-08 13:53:53,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:53:53,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:53:53,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:53:53,567 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:53:53,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:53:53,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-02-08 13:53:53,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 13:53:53,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:53:53,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:53,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 13:53:53,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:53:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:53:53,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:53:53,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249169610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:53,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:53:53,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 26 [2025-02-08 13:53:53,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844886092] [2025-02-08 13:53:53,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:53,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:53:53,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:53,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:53:53,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-02-08 13:53:53,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-02-08 13:53:53,785 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-02-08 13:53:53,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:53,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-02-08 13:53:53,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:54,996 INFO L124 PetriNetUnfolderBase]: 7304/12824 cut-off events. [2025-02-08 13:53:54,996 INFO L125 PetriNetUnfolderBase]: For 30582/30824 co-relation queries the response was YES. [2025-02-08 13:53:55,067 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-02-08 13:53:55,077 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 0 selfloop transitions, 0 changer transitions 243/243 dead transitions. [2025-02-08 13:53:55,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 243 transitions, 2451 flow [2025-02-08 13:53:55,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 13:53:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 13:53:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 231 transitions. [2025-02-08 13:53:55,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5552884615384616 [2025-02-08 13:53:55,078 INFO L175 Difference]: Start difference. First operand has 105 places, 60 transitions, 580 flow. Second operand 13 states and 231 transitions. [2025-02-08 13:53:55,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 243 transitions, 2451 flow [2025-02-08 13:53:55,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 243 transitions, 1925 flow, removed 4 selfloop flow, removed 30 redundant places. [2025-02-08 13:53:55,189 INFO L231 Difference]: Finished difference. Result has 82 places, 0 transitions, 0 flow [2025-02-08 13:53:55,189 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-02-08 13:53:55,190 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 47 predicate places. [2025-02-08 13:53:55,190 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 0 transitions, 0 flow [2025-02-08 13:53:55,190 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-02-08 13:53:55,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-02-08 13:53:55,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2025-02-08 13:53:55,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-02-08 13:53:55,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-02-08 13:53:55,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-02-08 13:53:55,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-02-08 13:53:55,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-02-08 13:53:55,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-02-08 13:53:55,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-02-08 13:53:55,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-02-08 13:53:55,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-02-08 13:53:55,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-02-08 13:53:55,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-02-08 13:53:55,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-02-08 13:53:55,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-02-08 13:53:55,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-02-08 13:53:55,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-02-08 13:53:55,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-02-08 13:53:55,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:53:55,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 13:53:55,394 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:55,398 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 13:53:55,398 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 13:53:55,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:53:55 BasicIcfg [2025-02-08 13:53:55,402 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 13:53:55,403 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 13:53:55,403 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 13:53:55,403 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 13:53:55,403 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:53:45" (3/4) ... [2025-02-08 13:53:55,408 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 13:53:55,409 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-02-08 13:53:55,410 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-02-08 13:53:55,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-02-08 13:53:55,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-08 13:53:55,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 13:53:55,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 13:53:55,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 13:53:55,456 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 13:53:55,456 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 13:53:55,456 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 13:53:55,457 INFO L158 Benchmark]: Toolchain (without parser) took 10498.67ms. Allocated memory was 201.3MB in the beginning and 503.3MB in the end (delta: 302.0MB). Free memory was 158.1MB in the beginning and 306.9MB in the end (delta: -148.8MB). Peak memory consumption was 153.1MB. Max. memory is 16.1GB. [2025-02-08 13:53:55,457 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 218.1MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:53:55,457 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.75ms. Allocated memory is still 201.3MB. Free memory was 157.7MB in the beginning and 138.5MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 13:53:55,457 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.53ms. Allocated memory is still 201.3MB. Free memory was 138.5MB in the beginning and 137.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:53:55,458 INFO L158 Benchmark]: Boogie Preprocessor took 23.90ms. Allocated memory is still 201.3MB. Free memory was 137.2MB in the beginning and 135.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:53:55,458 INFO L158 Benchmark]: IcfgBuilder took 376.07ms. Allocated memory is still 201.3MB. Free memory was 135.8MB in the beginning and 115.0MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 13:53:55,458 INFO L158 Benchmark]: TraceAbstraction took 9723.75ms. Allocated memory was 201.3MB in the beginning and 503.3MB in the end (delta: 302.0MB). Free memory was 114.6MB in the beginning and 311.2MB in the end (delta: -196.7MB). Peak memory consumption was 379.6MB. Max. memory is 16.1GB. [2025-02-08 13:53:55,458 INFO L158 Benchmark]: Witness Printer took 53.71ms. Allocated memory is still 503.3MB. Free memory was 311.2MB in the beginning and 306.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 13:53:55,459 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.14ms. Allocated memory is still 218.1MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.75ms. Allocated memory is still 201.3MB. Free memory was 157.7MB in the beginning and 138.5MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.53ms. Allocated memory is still 201.3MB. Free memory was 138.5MB in the beginning and 137.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.90ms. Allocated memory is still 201.3MB. Free memory was 137.2MB in the beginning and 135.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 376.07ms. Allocated memory is still 201.3MB. Free memory was 135.8MB in the beginning and 115.0MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9723.75ms. Allocated memory was 201.3MB in the beginning and 503.3MB in the end (delta: 302.0MB). Free memory was 114.6MB in the beginning and 311.2MB in the end (delta: -196.7MB). Peak memory consumption was 379.6MB. Max. memory is 16.1GB. * Witness Printer took 53.71ms. Allocated memory is still 503.3MB. Free memory was 311.2MB in the beginning and 306.9MB 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: 9.7s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1207 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1178 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 1.1s 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.6s 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-02-08 13:53:55,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE