./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/triangular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/triangular-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b585114ab4aff9777d36c84f93f7abe0931f77338421f004296c8a8d328d3dfd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:08:37,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:08:37,781 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:08:37,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:08:37,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:08:37,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:08:37,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:08:37,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:08:37,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:08:37,808 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:08:37,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:08:37,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:08:37,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:08:37,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:08:37,808 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:08:37,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:08:37,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:08:37,809 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:08:37,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:08:37,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:08:37,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:08:37,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:08:37,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:08:37,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:08:37,809 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:08:37,809 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:08:37,809 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:08:37,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:08:37,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:08:37,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:08:37,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:08:37,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:08:37,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:08:37,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:08:37,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:08:37,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:08:37,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:08:37,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:08:37,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:08:37,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:08:37,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:08:37,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:08:37,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:08:37,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:08:37,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:08:37,811 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b585114ab4aff9777d36c84f93f7abe0931f77338421f004296c8a8d328d3dfd [2025-03-04 15:08:38,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:08:38,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:08:38,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:08:38,020 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:08:38,020 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:08:38,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-1.i [2025-03-04 15:08:39,098 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a933e83ca/070eae7b4b6042b7b3e8f796903db58d/FLAG6a9fff894 [2025-03-04 15:08:39,407 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:08:39,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-1.i [2025-03-04 15:08:39,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a933e83ca/070eae7b4b6042b7b3e8f796903db58d/FLAG6a9fff894 [2025-03-04 15:08:39,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a933e83ca/070eae7b4b6042b7b3e8f796903db58d [2025-03-04 15:08:39,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:08:39,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:08:39,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:08:39,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:08:39,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:08:39,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:08:39" (1/1) ... [2025-03-04 15:08:39,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57472dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:39, skipping insertion in model container [2025-03-04 15:08:39,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:08:39" (1/1) ... [2025-03-04 15:08:39,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:08:39,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:08:39,657 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:08:39,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:08:39,708 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:08:39,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:39 WrapperNode [2025-03-04 15:08:39,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:08:39,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:08:39,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:08:39,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:08:39,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:39" (1/1) ... [2025-03-04 15:08:39,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:39" (1/1) ... [2025-03-04 15:08:39,739 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-03-04 15:08:39,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:08:39,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:08:39,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:08:39,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:08:39,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:39" (1/1) ... [2025-03-04 15:08:39,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:39" (1/1) ... [2025-03-04 15:08:39,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:39" (1/1) ... [2025-03-04 15:08:39,753 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 15:08:39,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:39" (1/1) ... [2025-03-04 15:08:39,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:39" (1/1) ... [2025-03-04 15:08:39,758 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:39" (1/1) ... [2025-03-04 15:08:39,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:39" (1/1) ... [2025-03-04 15:08:39,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:39" (1/1) ... [2025-03-04 15:08:39,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:39" (1/1) ... [2025-03-04 15:08:39,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:08:39,761 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:08:39,761 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:08:39,762 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:08:39,762 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:39" (1/1) ... [2025-03-04 15:08:39,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:08:39,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:39,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:08:39,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:08:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 15:08:39,803 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 15:08:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 15:08:39,803 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 15:08:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:08:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:08:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:08:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:08:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:08:39,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:08:39,804 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:08:39,891 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:08:39,892 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:08:40,037 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:08:40,037 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:08:40,113 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:08:40,113 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:08:40,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:08:40 BoogieIcfgContainer [2025-03-04 15:08:40,114 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:08:40,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:08:40,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:08:40,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:08:40,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:08:39" (1/3) ... [2025-03-04 15:08:40,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d5d7b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:08:40, skipping insertion in model container [2025-03-04 15:08:40,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:08:39" (2/3) ... [2025-03-04 15:08:40,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d5d7b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:08:40, skipping insertion in model container [2025-03-04 15:08:40,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:08:40" (3/3) ... [2025-03-04 15:08:40,119 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-1.i [2025-03-04 15:08:40,129 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:08:40,130 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-1.i that has 3 procedures, 31 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-04 15:08:40,130 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:08:40,159 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:08:40,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 72 flow [2025-03-04 15:08:40,194 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2025-03-04 15:08:40,196 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:08:40,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 2/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-03-04 15:08:40,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 32 transitions, 72 flow [2025-03-04 15:08:40,199 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 30 transitions, 66 flow [2025-03-04 15:08:40,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:08:40,217 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;@1b3e311a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:08:40,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 15:08:40,225 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:08:40,225 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:08:40,225 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:08:40,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:40,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:08:40,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:40,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:40,234 INFO L85 PathProgramCache]: Analyzing trace with hash 185325867, now seen corresponding path program 1 times [2025-03-04 15:08:40,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:40,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102739613] [2025-03-04 15:08:40,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:40,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:40,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:08:40,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:08:40,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:40,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:40,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:40,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102739613] [2025-03-04 15:08:40,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102739613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:40,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:40,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:08:40,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448853866] [2025-03-04 15:08:40,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:40,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:40,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:40,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:40,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:40,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:40,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:40,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:40,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:40,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:40,637 INFO L124 PetriNetUnfolderBase]: 510/941 cut-off events. [2025-03-04 15:08:40,637 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:08:40,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 941 events. 510/941 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4953 event pairs, 208 based on Foata normal form. 0/715 useless extension candidates. Maximal degree in co-relation 1748. Up to 421 conditions per place. [2025-03-04 15:08:40,646 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 31 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-03-04 15:08:40,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 162 flow [2025-03-04 15:08:40,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:40,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 15:08:40,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395833333333334 [2025-03-04 15:08:40,659 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 66 flow. Second operand 3 states and 71 transitions. [2025-03-04 15:08:40,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 162 flow [2025-03-04 15:08:40,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:40,666 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 86 flow [2025-03-04 15:08:40,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-03-04 15:08:40,671 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-03-04 15:08:40,673 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 86 flow [2025-03-04 15:08:40,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:40,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:40,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:08:40,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:08:40,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:40,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:40,675 INFO L85 PathProgramCache]: Analyzing trace with hash 185325868, now seen corresponding path program 1 times [2025-03-04 15:08:40,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:40,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776645934] [2025-03-04 15:08:40,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:40,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:40,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:08:40,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:08:40,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:40,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:40,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:40,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776645934] [2025-03-04 15:08:40,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776645934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:40,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:40,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:08:40,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363811996] [2025-03-04 15:08:40,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:40,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:40,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:40,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:40,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:40,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:40,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:40,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:40,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:40,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:40,871 INFO L124 PetriNetUnfolderBase]: 499/971 cut-off events. [2025-03-04 15:08:40,871 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2025-03-04 15:08:40,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1955 conditions, 971 events. 499/971 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5049 event pairs, 182 based on Foata normal form. 26/890 useless extension candidates. Maximal degree in co-relation 1943. Up to 466 conditions per place. [2025-03-04 15:08:40,880 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 31 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-03-04 15:08:40,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 186 flow [2025-03-04 15:08:40,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-04 15:08:40,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2025-03-04 15:08:40,882 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 86 flow. Second operand 3 states and 70 transitions. [2025-03-04 15:08:40,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 186 flow [2025-03-04 15:08:40,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:40,883 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 100 flow [2025-03-04 15:08:40,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-03-04 15:08:40,884 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-03-04 15:08:40,884 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 100 flow [2025-03-04 15:08:40,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:40,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:40,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:40,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:08:40,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:40,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:40,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2004506799, now seen corresponding path program 1 times [2025-03-04 15:08:40,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:40,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235390628] [2025-03-04 15:08:40,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:40,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:40,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:08:40,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:08:40,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:40,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:40,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:40,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235390628] [2025-03-04 15:08:40,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235390628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:40,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:40,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:40,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626530937] [2025-03-04 15:08:40,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:40,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:40,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:40,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:40,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:41,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-04 15:08:41,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:41,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:41,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-04 15:08:41,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:41,214 INFO L124 PetriNetUnfolderBase]: 1181/2230 cut-off events. [2025-03-04 15:08:41,214 INFO L125 PetriNetUnfolderBase]: For 710/710 co-relation queries the response was YES. [2025-03-04 15:08:41,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4651 conditions, 2230 events. 1181/2230 cut-off events. For 710/710 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14007 event pairs, 558 based on Foata normal form. 104/2089 useless extension candidates. Maximal degree in co-relation 4638. Up to 1241 conditions per place. [2025-03-04 15:08:41,226 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 56 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2025-03-04 15:08:41,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 322 flow [2025-03-04 15:08:41,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:41,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-03-04 15:08:41,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7109375 [2025-03-04 15:08:41,227 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 100 flow. Second operand 4 states and 91 transitions. [2025-03-04 15:08:41,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 322 flow [2025-03-04 15:08:41,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 66 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:41,229 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 120 flow [2025-03-04 15:08:41,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-03-04 15:08:41,230 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-03-04 15:08:41,230 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 120 flow [2025-03-04 15:08:41,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:41,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:41,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:41,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:08:41,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:41,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:41,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1984850697, now seen corresponding path program 1 times [2025-03-04 15:08:41,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:41,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680248072] [2025-03-04 15:08:41,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:41,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:41,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:08:41,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:08:41,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:41,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:41,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:41,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680248072] [2025-03-04 15:08:41,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680248072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:41,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:41,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:08:41,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202983473] [2025-03-04 15:08:41,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:41,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:41,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:41,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:41,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:41,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:41,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:41,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:41,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:41,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:41,421 INFO L124 PetriNetUnfolderBase]: 791/1734 cut-off events. [2025-03-04 15:08:41,421 INFO L125 PetriNetUnfolderBase]: For 752/768 co-relation queries the response was YES. [2025-03-04 15:08:41,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3921 conditions, 1734 events. 791/1734 cut-off events. For 752/768 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 11553 event pairs, 279 based on Foata normal form. 6/1619 useless extension candidates. Maximal degree in co-relation 3906. Up to 791 conditions per place. [2025-03-04 15:08:41,433 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 41 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-03-04 15:08:41,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 279 flow [2025-03-04 15:08:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-04 15:08:41,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7604166666666666 [2025-03-04 15:08:41,435 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 120 flow. Second operand 3 states and 73 transitions. [2025-03-04 15:08:41,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 279 flow [2025-03-04 15:08:41,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:41,437 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 140 flow [2025-03-04 15:08:41,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2025-03-04 15:08:41,437 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2025-03-04 15:08:41,439 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 140 flow [2025-03-04 15:08:41,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:41,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:41,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:41,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:08:41,439 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:41,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:41,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1984850698, now seen corresponding path program 1 times [2025-03-04 15:08:41,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:41,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426235210] [2025-03-04 15:08:41,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:41,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:41,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:08:41,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:08:41,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:41,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:41,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:41,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426235210] [2025-03-04 15:08:41,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426235210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:41,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:41,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:08:41,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126435571] [2025-03-04 15:08:41,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:41,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:08:41,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:41,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:08:41,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:08:41,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:41,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:41,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:41,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:41,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:41,608 INFO L124 PetriNetUnfolderBase]: 753/1716 cut-off events. [2025-03-04 15:08:41,608 INFO L125 PetriNetUnfolderBase]: For 1013/1029 co-relation queries the response was YES. [2025-03-04 15:08:41,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4132 conditions, 1716 events. 753/1716 cut-off events. For 1013/1029 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 11602 event pairs, 217 based on Foata normal form. 42/1701 useless extension candidates. Maximal degree in co-relation 4114. Up to 835 conditions per place. [2025-03-04 15:08:41,633 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 41 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-03-04 15:08:41,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 302 flow [2025-03-04 15:08:41,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:41,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-04 15:08:41,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-04 15:08:41,635 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 140 flow. Second operand 3 states and 72 transitions. [2025-03-04 15:08:41,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 302 flow [2025-03-04 15:08:41,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:41,637 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 154 flow [2025-03-04 15:08:41,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2025-03-04 15:08:41,638 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2025-03-04 15:08:41,638 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 154 flow [2025-03-04 15:08:41,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:41,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:41,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:41,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:08:41,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:41,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:41,639 INFO L85 PathProgramCache]: Analyzing trace with hash 476048493, now seen corresponding path program 1 times [2025-03-04 15:08:41,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:41,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345550707] [2025-03-04 15:08:41,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:41,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:41,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:08:41,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:08:41,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:41,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:41,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:41,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345550707] [2025-03-04 15:08:41,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345550707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:41,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:41,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:41,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021644681] [2025-03-04 15:08:41,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:41,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:41,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:41,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:41,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:41,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-04 15:08:41,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:41,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:41,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-04 15:08:41,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:41,846 INFO L124 PetriNetUnfolderBase]: 1197/2294 cut-off events. [2025-03-04 15:08:41,846 INFO L125 PetriNetUnfolderBase]: For 1748/1947 co-relation queries the response was YES. [2025-03-04 15:08:41,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5719 conditions, 2294 events. 1197/2294 cut-off events. For 1748/1947 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 14882 event pairs, 700 based on Foata normal form. 147/2346 useless extension candidates. Maximal degree in co-relation 5700. Up to 1481 conditions per place. [2025-03-04 15:08:41,857 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 57 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2025-03-04 15:08:41,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 396 flow [2025-03-04 15:08:41,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:41,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-03-04 15:08:41,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2025-03-04 15:08:41,859 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 154 flow. Second operand 4 states and 87 transitions. [2025-03-04 15:08:41,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 396 flow [2025-03-04 15:08:41,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:41,862 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 174 flow [2025-03-04 15:08:41,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-03-04 15:08:41,863 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2025-03-04 15:08:41,863 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 174 flow [2025-03-04 15:08:41,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:41,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:41,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:41,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:08:41,863 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:41,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:41,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1652667496, now seen corresponding path program 1 times [2025-03-04 15:08:41,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:41,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140322089] [2025-03-04 15:08:41,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:41,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:41,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:08:41,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:08:41,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:41,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:41,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:41,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140322089] [2025-03-04 15:08:41,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140322089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:41,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:41,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:41,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087978850] [2025-03-04 15:08:41,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:41,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:41,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:41,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:41,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:41,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:41,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:41,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:41,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:41,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:42,117 INFO L124 PetriNetUnfolderBase]: 1021/2270 cut-off events. [2025-03-04 15:08:42,117 INFO L125 PetriNetUnfolderBase]: For 1871/2056 co-relation queries the response was YES. [2025-03-04 15:08:42,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6024 conditions, 2270 events. 1021/2270 cut-off events. For 1871/2056 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 16343 event pairs, 193 based on Foata normal form. 120/2344 useless extension candidates. Maximal degree in co-relation 6003. Up to 674 conditions per place. [2025-03-04 15:08:42,129 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 58 selfloop transitions, 11 changer transitions 0/81 dead transitions. [2025-03-04 15:08:42,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 477 flow [2025-03-04 15:08:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:08:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:08:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-03-04 15:08:42,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.725 [2025-03-04 15:08:42,130 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 174 flow. Second operand 5 states and 116 transitions. [2025-03-04 15:08:42,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 477 flow [2025-03-04 15:08:42,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 472 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:42,133 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 272 flow [2025-03-04 15:08:42,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-03-04 15:08:42,134 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2025-03-04 15:08:42,134 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 272 flow [2025-03-04 15:08:42,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:42,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:42,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:42,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:08:42,135 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:42,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:42,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1652667497, now seen corresponding path program 1 times [2025-03-04 15:08:42,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:42,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902527642] [2025-03-04 15:08:42,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:42,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:42,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:08:42,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:08:42,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:42,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:42,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:42,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:42,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902527642] [2025-03-04 15:08:42,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902527642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:42,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:42,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:42,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281603050] [2025-03-04 15:08:42,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:42,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:42,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:42,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:42,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:42,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:42,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:42,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:42,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:42,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:42,379 INFO L124 PetriNetUnfolderBase]: 1098/2481 cut-off events. [2025-03-04 15:08:42,379 INFO L125 PetriNetUnfolderBase]: For 4261/4434 co-relation queries the response was YES. [2025-03-04 15:08:42,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6971 conditions, 2481 events. 1098/2481 cut-off events. For 4261/4434 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17971 event pairs, 268 based on Foata normal form. 183/2571 useless extension candidates. Maximal degree in co-relation 6945. Up to 809 conditions per place. [2025-03-04 15:08:42,393 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 63 selfloop transitions, 9 changer transitions 0/84 dead transitions. [2025-03-04 15:08:42,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 564 flow [2025-03-04 15:08:42,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:08:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:08:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-03-04 15:08:42,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.73125 [2025-03-04 15:08:42,396 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 272 flow. Second operand 5 states and 117 transitions. [2025-03-04 15:08:42,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 564 flow [2025-03-04 15:08:42,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 541 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:42,404 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 327 flow [2025-03-04 15:08:42,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=327, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2025-03-04 15:08:42,406 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2025-03-04 15:08:42,406 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 327 flow [2025-03-04 15:08:42,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:42,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:42,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:42,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:08:42,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:42,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:42,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1017608297, now seen corresponding path program 1 times [2025-03-04 15:08:42,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:42,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816803633] [2025-03-04 15:08:42,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:42,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:42,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:08:42,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:08:42,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:42,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:42,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:42,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816803633] [2025-03-04 15:08:42,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816803633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:42,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:42,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:42,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906234911] [2025-03-04 15:08:42,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:42,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:42,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:42,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:42,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:42,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:42,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:42,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:42,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:42,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:42,584 INFO L124 PetriNetUnfolderBase]: 903/1917 cut-off events. [2025-03-04 15:08:42,585 INFO L125 PetriNetUnfolderBase]: For 3740/3971 co-relation queries the response was YES. [2025-03-04 15:08:42,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5573 conditions, 1917 events. 903/1917 cut-off events. For 3740/3971 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12677 event pairs, 696 based on Foata normal form. 161/1993 useless extension candidates. Maximal degree in co-relation 5545. Up to 1466 conditions per place. [2025-03-04 15:08:42,596 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 32 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2025-03-04 15:08:42,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 45 transitions, 330 flow [2025-03-04 15:08:42,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:08:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:08:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-04 15:08:42,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 15:08:42,597 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 327 flow. Second operand 3 states and 56 transitions. [2025-03-04 15:08:42,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 45 transitions, 330 flow [2025-03-04 15:08:42,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 45 transitions, 314 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:42,603 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 250 flow [2025-03-04 15:08:42,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2025-03-04 15:08:42,604 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2025-03-04 15:08:42,604 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 250 flow [2025-03-04 15:08:42,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:42,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:42,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:42,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:08:42,604 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:42,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:42,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1017608296, now seen corresponding path program 1 times [2025-03-04 15:08:42,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:42,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823646507] [2025-03-04 15:08:42,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:42,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:42,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:08:42,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:08:42,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:42,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:42,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:42,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:42,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823646507] [2025-03-04 15:08:42,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823646507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:42,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:42,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:08:42,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642942850] [2025-03-04 15:08:42,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:42,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:42,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:42,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:42,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:42,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:42,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:42,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:42,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:42,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:42,840 INFO L124 PetriNetUnfolderBase]: 1002/2330 cut-off events. [2025-03-04 15:08:42,840 INFO L125 PetriNetUnfolderBase]: For 2596/2781 co-relation queries the response was YES. [2025-03-04 15:08:42,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6223 conditions, 2330 events. 1002/2330 cut-off events. For 2596/2781 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 16530 event pairs, 199 based on Foata normal form. 110/2367 useless extension candidates. Maximal degree in co-relation 6199. Up to 1168 conditions per place. [2025-03-04 15:08:42,851 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 58 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2025-03-04 15:08:42,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 75 transitions, 480 flow [2025-03-04 15:08:42,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:08:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:08:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-03-04 15:08:42,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68125 [2025-03-04 15:08:42,852 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 250 flow. Second operand 5 states and 109 transitions. [2025-03-04 15:08:42,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 75 transitions, 480 flow [2025-03-04 15:08:42,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 75 transitions, 475 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 15:08:42,856 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 271 flow [2025-03-04 15:08:42,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2025-03-04 15:08:42,856 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-03-04 15:08:42,856 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 271 flow [2025-03-04 15:08:42,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:42,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:42,857 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:42,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:08:42,857 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:42,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:42,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2101859406, now seen corresponding path program 1 times [2025-03-04 15:08:42,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:42,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095308496] [2025-03-04 15:08:42,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:42,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:42,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:08:42,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:08:42,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:42,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:42,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:42,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:42,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095308496] [2025-03-04 15:08:42,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095308496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:42,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333938697] [2025-03-04 15:08:42,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:42,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:42,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:42,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:42,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:08:42,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:08:42,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:08:42,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:42,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:42,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:08:42,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:43,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:43,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333938697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:43,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:43,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 15:08:43,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625427004] [2025-03-04 15:08:43,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:43,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:08:43,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:43,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:08:43,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:08:43,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:08:43,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:43,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:43,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:08:43,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:43,234 INFO L124 PetriNetUnfolderBase]: 1858/3390 cut-off events. [2025-03-04 15:08:43,235 INFO L125 PetriNetUnfolderBase]: For 4438/4674 co-relation queries the response was YES. [2025-03-04 15:08:43,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9796 conditions, 3390 events. 1858/3390 cut-off events. For 4438/4674 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 21685 event pairs, 259 based on Foata normal form. 202/3404 useless extension candidates. Maximal degree in co-relation 9769. Up to 1361 conditions per place. [2025-03-04 15:08:43,249 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 63 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2025-03-04 15:08:43,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 566 flow [2025-03-04 15:08:43,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:43,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-04 15:08:43,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-04 15:08:43,250 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 271 flow. Second operand 4 states and 76 transitions. [2025-03-04 15:08:43,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 566 flow [2025-03-04 15:08:43,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 552 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:43,258 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 271 flow [2025-03-04 15:08:43,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2025-03-04 15:08:43,259 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-03-04 15:08:43,260 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 271 flow [2025-03-04 15:08:43,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:43,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:43,260 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:08:43,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:43,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 15:08:43,464 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:43,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:43,465 INFO L85 PathProgramCache]: Analyzing trace with hash -733131992, now seen corresponding path program 1 times [2025-03-04 15:08:43,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:43,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729068344] [2025-03-04 15:08:43,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:43,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:43,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:08:43,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:08:43,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:43,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:08:43,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:43,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729068344] [2025-03-04 15:08:43,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729068344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:43,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:43,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:43,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886721621] [2025-03-04 15:08:43,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:43,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:43,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:43,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:43,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:43,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:08:43,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:43,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:43,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:08:43,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:43,725 INFO L124 PetriNetUnfolderBase]: 1583/3216 cut-off events. [2025-03-04 15:08:43,726 INFO L125 PetriNetUnfolderBase]: For 4752/4869 co-relation queries the response was YES. [2025-03-04 15:08:43,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9374 conditions, 3216 events. 1583/3216 cut-off events. For 4752/4869 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 21736 event pairs, 358 based on Foata normal form. 178/3347 useless extension candidates. Maximal degree in co-relation 9348. Up to 1262 conditions per place. [2025-03-04 15:08:43,738 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 63 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2025-03-04 15:08:43,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 562 flow [2025-03-04 15:08:43,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:43,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-04 15:08:43,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-04 15:08:43,740 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 271 flow. Second operand 4 states and 76 transitions. [2025-03-04 15:08:43,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 562 flow [2025-03-04 15:08:43,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 550 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:43,748 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 275 flow [2025-03-04 15:08:43,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=275, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2025-03-04 15:08:43,749 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-03-04 15:08:43,749 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 275 flow [2025-03-04 15:08:43,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:43,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:43,750 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:43,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:08:43,750 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:43,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:43,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1110404095, now seen corresponding path program 1 times [2025-03-04 15:08:43,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:43,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19380805] [2025-03-04 15:08:43,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:43,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:43,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:08:43,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:08:43,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:43,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:43,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:43,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:43,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19380805] [2025-03-04 15:08:43,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19380805] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:43,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084699923] [2025-03-04 15:08:43,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:43,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:43,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:43,802 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:43,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:08:43,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:08:43,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:08:43,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:43,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:43,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:08:43,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:43,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:43,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:43,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084699923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:43,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:43,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:08:43,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533280336] [2025-03-04 15:08:43,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:43,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:08:43,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:43,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:08:43,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:08:43,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-04 15:08:43,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:43,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:43,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-04 15:08:43,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:44,131 INFO L124 PetriNetUnfolderBase]: 1521/2931 cut-off events. [2025-03-04 15:08:44,132 INFO L125 PetriNetUnfolderBase]: For 5613/5705 co-relation queries the response was YES. [2025-03-04 15:08:44,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8772 conditions, 2931 events. 1521/2931 cut-off events. For 5613/5705 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 19053 event pairs, 142 based on Foata normal form. 207/3017 useless extension candidates. Maximal degree in co-relation 8746. Up to 984 conditions per place. [2025-03-04 15:08:44,142 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 81 selfloop transitions, 6 changer transitions 1/95 dead transitions. [2025-03-04 15:08:44,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 95 transitions, 726 flow [2025-03-04 15:08:44,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:08:44,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:08:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-03-04 15:08:44,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-04 15:08:44,143 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 275 flow. Second operand 6 states and 114 transitions. [2025-03-04 15:08:44,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 95 transitions, 726 flow [2025-03-04 15:08:44,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 95 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:44,149 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 275 flow [2025-03-04 15:08:44,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=65, PETRI_TRANSITIONS=44} [2025-03-04 15:08:44,150 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2025-03-04 15:08:44,150 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 275 flow [2025-03-04 15:08:44,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:44,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:44,150 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:44,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:44,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 15:08:44,350 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:44,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:44,351 INFO L85 PathProgramCache]: Analyzing trace with hash 832893443, now seen corresponding path program 1 times [2025-03-04 15:08:44,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:44,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481016087] [2025-03-04 15:08:44,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:44,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:44,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:08:44,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:08:44,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:44,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:44,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:44,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481016087] [2025-03-04 15:08:44,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481016087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:44,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914185271] [2025-03-04 15:08:44,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:44,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:44,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:44,392 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:44,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:08:44,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:08:44,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:08:44,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:44,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:44,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:08:44,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:44,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:44,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914185271] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:44,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:44,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 15:08:44,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885240695] [2025-03-04 15:08:44,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:44,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:08:44,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:44,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:08:44,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:08:44,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:44,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 44 transitions, 275 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:44,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:44,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:44,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:44,708 INFO L124 PetriNetUnfolderBase]: 1339/2904 cut-off events. [2025-03-04 15:08:44,708 INFO L125 PetriNetUnfolderBase]: For 6270/6352 co-relation queries the response was YES. [2025-03-04 15:08:44,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8846 conditions, 2904 events. 1339/2904 cut-off events. For 6270/6352 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 18824 event pairs, 119 based on Foata normal form. 227/3108 useless extension candidates. Maximal degree in co-relation 8819. Up to 507 conditions per place. [2025-03-04 15:08:44,718 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 73 selfloop transitions, 12 changer transitions 4/99 dead transitions. [2025-03-04 15:08:44,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 99 transitions, 703 flow [2025-03-04 15:08:44,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:08:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:08:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2025-03-04 15:08:44,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7053571428571429 [2025-03-04 15:08:44,719 INFO L175 Difference]: Start difference. First operand has 65 places, 44 transitions, 275 flow. Second operand 7 states and 158 transitions. [2025-03-04 15:08:44,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 99 transitions, 703 flow [2025-03-04 15:08:44,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 99 transitions, 676 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-04 15:08:44,726 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 379 flow [2025-03-04 15:08:44,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=379, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2025-03-04 15:08:44,726 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2025-03-04 15:08:44,726 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 379 flow [2025-03-04 15:08:44,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:44,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:44,727 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:44,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:44,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:44,931 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:44,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:44,931 INFO L85 PathProgramCache]: Analyzing trace with hash 62788742, now seen corresponding path program 1 times [2025-03-04 15:08:44,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:44,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376904304] [2025-03-04 15:08:44,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:44,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:44,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:08:44,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:08:44,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:44,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:08:44,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:44,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376904304] [2025-03-04 15:08:44,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376904304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:44,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:44,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:08:44,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029992708] [2025-03-04 15:08:44,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:44,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:08:44,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:44,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:08:44,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:08:44,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:08:44,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 379 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:44,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:44,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:08:44,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:45,230 INFO L124 PetriNetUnfolderBase]: 2138/3893 cut-off events. [2025-03-04 15:08:45,231 INFO L125 PetriNetUnfolderBase]: For 10005/10082 co-relation queries the response was YES. [2025-03-04 15:08:45,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12733 conditions, 3893 events. 2138/3893 cut-off events. For 10005/10082 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 22890 event pairs, 503 based on Foata normal form. 257/4109 useless extension candidates. Maximal degree in co-relation 12701. Up to 1567 conditions per place. [2025-03-04 15:08:45,249 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 69 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2025-03-04 15:08:45,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 81 transitions, 764 flow [2025-03-04 15:08:45,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:08:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:08:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-03-04 15:08:45,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-04 15:08:45,250 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 379 flow. Second operand 4 states and 72 transitions. [2025-03-04 15:08:45,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 81 transitions, 764 flow [2025-03-04 15:08:45,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 729 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:45,261 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 372 flow [2025-03-04 15:08:45,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=372, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2025-03-04 15:08:45,261 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2025-03-04 15:08:45,261 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 372 flow [2025-03-04 15:08:45,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:45,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:45,262 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:45,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:08:45,262 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:45,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:45,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1967023659, now seen corresponding path program 1 times [2025-03-04 15:08:45,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:45,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116462803] [2025-03-04 15:08:45,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:45,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:45,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:08:45,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:08:45,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:45,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:45,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:45,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116462803] [2025-03-04 15:08:45,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116462803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:45,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260080087] [2025-03-04 15:08:45,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:45,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:45,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:45,330 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:45,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:08:45,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:08:45,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:08:45,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:45,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:45,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:08:45,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:45,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:45,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260080087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:45,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:45,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 15:08:45,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581018535] [2025-03-04 15:08:45,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:45,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:08:45,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:45,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:08:45,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:08:45,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:45,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 372 flow. Second operand has 12 states, 12 states have (on average 14.333333333333334) internal successors, (172), 12 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:45,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:45,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:45,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:45,834 INFO L124 PetriNetUnfolderBase]: 1744/3743 cut-off events. [2025-03-04 15:08:45,834 INFO L125 PetriNetUnfolderBase]: For 12928/12958 co-relation queries the response was YES. [2025-03-04 15:08:45,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11877 conditions, 3743 events. 1744/3743 cut-off events. For 12928/12958 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 23155 event pairs, 59 based on Foata normal form. 200/3940 useless extension candidates. Maximal degree in co-relation 11846. Up to 457 conditions per place. [2025-03-04 15:08:45,851 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 100 selfloop transitions, 17 changer transitions 17/144 dead transitions. [2025-03-04 15:08:45,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 144 transitions, 1032 flow [2025-03-04 15:08:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:08:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:08:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 268 transitions. [2025-03-04 15:08:45,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2025-03-04 15:08:45,852 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 372 flow. Second operand 12 states and 268 transitions. [2025-03-04 15:08:45,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 144 transitions, 1032 flow [2025-03-04 15:08:45,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 144 transitions, 995 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-04 15:08:45,862 INFO L231 Difference]: Finished difference. Result has 87 places, 52 transitions, 429 flow [2025-03-04 15:08:45,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=429, PETRI_PLACES=87, PETRI_TRANSITIONS=52} [2025-03-04 15:08:45,863 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 52 predicate places. [2025-03-04 15:08:45,863 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 52 transitions, 429 flow [2025-03-04 15:08:45,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.333333333333334) internal successors, (172), 12 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:45,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:45,863 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:45,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:08:46,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 15:08:46,064 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:46,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:46,064 INFO L85 PathProgramCache]: Analyzing trace with hash -58641131, now seen corresponding path program 1 times [2025-03-04 15:08:46,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:46,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392153929] [2025-03-04 15:08:46,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:46,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:46,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:08:46,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:08:46,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:46,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:46,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:46,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392153929] [2025-03-04 15:08:46,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392153929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:46,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529838107] [2025-03-04 15:08:46,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:46,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:46,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:46,145 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:46,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:08:46,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:08:46,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:08:46,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:46,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:46,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:08:46,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:46,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:46,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529838107] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:46,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:46,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 15:08:46,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462652254] [2025-03-04 15:08:46,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:46,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 15:08:46,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:46,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:08:46,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:08:46,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-04 15:08:46,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 52 transitions, 429 flow. Second operand has 16 states, 16 states have (on average 14.25) internal successors, (228), 16 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:46,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:46,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-04 15:08:46,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:46,943 INFO L124 PetriNetUnfolderBase]: 2554/5409 cut-off events. [2025-03-04 15:08:46,943 INFO L125 PetriNetUnfolderBase]: For 19397/19439 co-relation queries the response was YES. [2025-03-04 15:08:46,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17144 conditions, 5409 events. 2554/5409 cut-off events. For 19397/19439 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 33758 event pairs, 119 based on Foata normal form. 192/5588 useless extension candidates. Maximal degree in co-relation 17105. Up to 647 conditions per place. [2025-03-04 15:08:46,960 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 120 selfloop transitions, 24 changer transitions 25/179 dead transitions. [2025-03-04 15:08:46,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 179 transitions, 1332 flow [2025-03-04 15:08:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:08:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:08:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 334 transitions. [2025-03-04 15:08:46,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6958333333333333 [2025-03-04 15:08:46,961 INFO L175 Difference]: Start difference. First operand has 87 places, 52 transitions, 429 flow. Second operand 15 states and 334 transitions. [2025-03-04 15:08:46,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 179 transitions, 1332 flow [2025-03-04 15:08:46,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 179 transitions, 1319 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:46,976 INFO L231 Difference]: Finished difference. Result has 105 places, 60 transitions, 580 flow [2025-03-04 15:08:46,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=580, PETRI_PLACES=105, PETRI_TRANSITIONS=60} [2025-03-04 15:08:46,976 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2025-03-04 15:08:46,976 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 60 transitions, 580 flow [2025-03-04 15:08:46,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 14.25) internal successors, (228), 16 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:46,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:46,977 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:46,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:47,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 15:08:47,177 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:08:47,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:47,178 INFO L85 PathProgramCache]: Analyzing trace with hash -233061099, now seen corresponding path program 2 times [2025-03-04 15:08:47,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:47,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200205014] [2025-03-04 15:08:47,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:47,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:47,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-04 15:08:47,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 15:08:47,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:47,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:47,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:47,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200205014] [2025-03-04 15:08:47,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200205014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:47,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42422740] [2025-03-04 15:08:47,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:08:47,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:47,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:47,379 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:47,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:08:47,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-04 15:08:47,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 15:08:47,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:08:47,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:47,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:08:47,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:08:47,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:47,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42422740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:47,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:47,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 26 [2025-03-04 15:08:47,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761683160] [2025-03-04 15:08:47,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:47,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:08:47,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:47,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:08:47,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:08:47,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:08:47,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 60 transitions, 580 flow. Second operand has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:47,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:47,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:08:47,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:48,761 INFO L124 PetriNetUnfolderBase]: 7304/12824 cut-off events. [2025-03-04 15:08:48,761 INFO L125 PetriNetUnfolderBase]: For 30582/30824 co-relation queries the response was YES. [2025-03-04 15:08:48,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41542 conditions, 12824 events. 7304/12824 cut-off events. For 30582/30824 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 87461 event pairs, 293 based on Foata normal form. 552/13370 useless extension candidates. Maximal degree in co-relation 41505. Up to 2208 conditions per place. [2025-03-04 15:08:48,795 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 0 selfloop transitions, 0 changer transitions 243/243 dead transitions. [2025-03-04 15:08:48,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 243 transitions, 2451 flow [2025-03-04 15:08:48,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:08:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:08:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 231 transitions. [2025-03-04 15:08:48,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5552884615384616 [2025-03-04 15:08:48,796 INFO L175 Difference]: Start difference. First operand has 105 places, 60 transitions, 580 flow. Second operand 13 states and 231 transitions. [2025-03-04 15:08:48,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 243 transitions, 2451 flow [2025-03-04 15:08:48,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 243 transitions, 1925 flow, removed 4 selfloop flow, removed 30 redundant places. [2025-03-04 15:08:48,821 INFO L231 Difference]: Finished difference. Result has 82 places, 0 transitions, 0 flow [2025-03-04 15:08:48,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=82, PETRI_TRANSITIONS=0} [2025-03-04 15:08:48,821 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 47 predicate places. [2025-03-04 15:08:48,821 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 0 transitions, 0 flow [2025-03-04 15:08:48,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-04 15:08:48,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-04 15:08:48,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-04 15:08:48,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:08:49,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 15:08:49,024 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:08:49,028 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:08:49,028 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:08:49,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:08:49 BasicIcfg [2025-03-04 15:08:49,031 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:08:49,032 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:08:49,032 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:08:49,032 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:08:49,032 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:08:40" (3/4) ... [2025-03-04 15:08:49,033 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:08:49,035 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-04 15:08:49,035 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-04 15:08:49,036 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-04 15:08:49,036 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-04 15:08:49,036 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 15:08:49,036 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 15:08:49,036 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 15:08:49,085 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:08:49,085 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:08:49,086 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:08:49,086 INFO L158 Benchmark]: Toolchain (without parser) took 9643.36ms. Allocated memory was 201.3MB in the beginning and 444.6MB in the end (delta: 243.3MB). Free memory was 154.1MB in the beginning and 222.3MB in the end (delta: -68.2MB). Peak memory consumption was 170.4MB. Max. memory is 16.1GB. [2025-03-04 15:08:49,086 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:08:49,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.91ms. Allocated memory is still 201.3MB. Free memory was 154.1MB in the beginning and 134.8MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:08:49,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.91ms. Allocated memory is still 201.3MB. Free memory was 134.8MB in the beginning and 133.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:08:49,087 INFO L158 Benchmark]: Boogie Preprocessor took 21.16ms. Allocated memory is still 201.3MB. Free memory was 133.2MB in the beginning and 131.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:08:49,087 INFO L158 Benchmark]: IcfgBuilder took 352.16ms. Allocated memory is still 201.3MB. Free memory was 131.8MB in the beginning and 111.3MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:08:49,090 INFO L158 Benchmark]: TraceAbstraction took 8916.56ms. Allocated memory was 201.3MB in the beginning and 444.6MB in the end (delta: 243.3MB). Free memory was 110.9MB in the beginning and 226.1MB in the end (delta: -115.2MB). Peak memory consumption was 346.5MB. Max. memory is 16.1GB. [2025-03-04 15:08:49,091 INFO L158 Benchmark]: Witness Printer took 53.87ms. Allocated memory is still 444.6MB. Free memory was 226.1MB in the beginning and 222.3MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:08:49,091 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.22ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.91ms. Allocated memory is still 201.3MB. Free memory was 154.1MB in the beginning and 134.8MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.91ms. Allocated memory is still 201.3MB. Free memory was 134.8MB in the beginning and 133.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.16ms. Allocated memory is still 201.3MB. Free memory was 133.2MB in the beginning and 131.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 352.16ms. Allocated memory is still 201.3MB. Free memory was 131.8MB in the beginning and 111.3MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8916.56ms. Allocated memory was 201.3MB in the beginning and 444.6MB in the end (delta: 243.3MB). Free memory was 110.9MB in the beginning and 226.1MB in the end (delta: -115.2MB). Peak memory consumption was 346.5MB. Max. memory is 16.1GB. * Witness Printer took 53.87ms. Allocated memory is still 444.6MB. Free memory was 226.1MB in the beginning and 222.3MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 706]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 706]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 704]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 704]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.8s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1207 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1178 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1959 IncrementalHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 20 mSDtfsCounter, 1959 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.6s 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.5s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 488 ConstructedInterpolants, 0 QuantifiedInterpolants, 1370 SizeOfPredicates, 20 NumberOfNonLiveVariables, 688 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 27 InterpolantComputations, 15 PerfectInterpolantSequences, 123/347 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:08:49,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE