./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_15-list_entry_nr.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/goblint-regression/06-symbeq_15-list_entry_nr.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 a7843ed292ba7ad810f8623eae57d1bf23212a957c35d700b564dc03a7df5581 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:20:02,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:20:02,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:20:02,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:20:02,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:20:02,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:20:02,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:20:02,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:20:02,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:20:02,521 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:20:02,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:20:02,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:20:02,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:20:02,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:20:02,522 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:20:02,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:20:02,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:20:02,523 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:20:02,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:20:02,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:20:02,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:20:02,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:20:02,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:20:02,524 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:20:02,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:20:02,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:20:02,524 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 -> a7843ed292ba7ad810f8623eae57d1bf23212a957c35d700b564dc03a7df5581 [2025-03-04 15:20:02,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:20:02,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:20:02,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:20:02,743 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:20:02,744 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:20:02,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_15-list_entry_nr.i [2025-03-04 15:20:03,824 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08edb2242/faead13501544d538d6484956da14d41/FLAGc48d0dcf1 [2025-03-04 15:20:04,117 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:20:04,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_15-list_entry_nr.i [2025-03-04 15:20:04,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08edb2242/faead13501544d538d6484956da14d41/FLAGc48d0dcf1 [2025-03-04 15:20:04,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08edb2242/faead13501544d538d6484956da14d41 [2025-03-04 15:20:04,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:20:04,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:20:04,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:20:04,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:20:04,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:20:04,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:20:04" (1/1) ... [2025-03-04 15:20:04,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@205e8d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:04, skipping insertion in model container [2025-03-04 15:20:04,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:20:04" (1/1) ... [2025-03-04 15:20:04,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:20:04,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:20:04,712 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:20:04,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:20:04,783 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:20:04,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:04 WrapperNode [2025-03-04 15:20:04,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:20:04,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:20:04,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:20:04,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:20:04,788 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:20:04" (1/1) ... [2025-03-04 15:20:04,796 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:20:04" (1/1) ... [2025-03-04 15:20:04,809 INFO L138 Inliner]: procedures = 186, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 57 [2025-03-04 15:20:04,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:20:04,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:20:04,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:20:04,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:20:04,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:04" (1/1) ... [2025-03-04 15:20:04,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:04" (1/1) ... [2025-03-04 15:20:04,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:04" (1/1) ... [2025-03-04 15:20:04,824 INFO L175 MemorySlicer]: Split 5 memory accesses to 1 slices as follows [5]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-03-04 15:20:04,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:04" (1/1) ... [2025-03-04 15:20:04,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:04" (1/1) ... [2025-03-04 15:20:04,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:04" (1/1) ... [2025-03-04 15:20:04,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:04" (1/1) ... [2025-03-04 15:20:04,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:04" (1/1) ... [2025-03-04 15:20:04,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:04" (1/1) ... [2025-03-04 15:20:04,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:20:04,831 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:20:04,831 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:20:04,831 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:20:04,831 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:04" (1/1) ... [2025-03-04 15:20:04,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:20:04,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:04,859 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:20:04,863 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:20:04,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:20:04,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:20:04,879 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:20:04,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:20:04,879 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:20:04,879 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:20:04,879 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:20:04,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:20:04,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:20:04,880 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:20:04,965 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:20:04,966 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:20:05,084 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:20:05,085 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:20:05,154 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:20:05,154 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:20:05,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:20:05 BoogieIcfgContainer [2025-03-04 15:20:05,154 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:20:05,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:20:05,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:20:05,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:20:05,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:20:04" (1/3) ... [2025-03-04 15:20:05,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4164a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:20:05, skipping insertion in model container [2025-03-04 15:20:05,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:04" (2/3) ... [2025-03-04 15:20:05,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4164a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:20:05, skipping insertion in model container [2025-03-04 15:20:05,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:20:05" (3/3) ... [2025-03-04 15:20:05,164 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_15-list_entry_nr.i [2025-03-04 15:20:05,176 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:20:05,179 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_15-list_entry_nr.i that has 2 procedures, 22 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-04 15:20:05,179 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:20:05,217 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:20:05,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 46 flow [2025-03-04 15:20:05,264 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 15:20:05,269 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:20:05,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 31 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-04 15:20:05,270 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 21 transitions, 46 flow [2025-03-04 15:20:05,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 20 transitions, 43 flow [2025-03-04 15:20:05,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:20:05,287 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;@18dbe698, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:20:05,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 15:20:05,294 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:20:05,294 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:20:05,294 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:20:05,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:05,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:20:05,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:05,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:05,300 INFO L85 PathProgramCache]: Analyzing trace with hash 554912112, now seen corresponding path program 1 times [2025-03-04 15:20:05,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:05,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156920396] [2025-03-04 15:20:05,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:05,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:05,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:20:05,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:20:05,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:05,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:05,750 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:20:05,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:05,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156920396] [2025-03-04 15:20:05,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156920396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:05,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:05,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:05,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488809746] [2025-03-04 15:20:05,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:05,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:20:05,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:05,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:20:05,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:20:05,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-03-04 15:20:05,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 43 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:20:05,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:05,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-03-04 15:20:05,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:05,906 INFO L124 PetriNetUnfolderBase]: 42/111 cut-off events. [2025-03-04 15:20:05,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:20:05,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 111 events. 42/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 356 event pairs, 12 based on Foata normal form. 7/114 useless extension candidates. Maximal degree in co-relation 208. Up to 73 conditions per place. [2025-03-04 15:20:05,910 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 23 selfloop transitions, 6 changer transitions 6/39 dead transitions. [2025-03-04 15:20:05,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 39 transitions, 151 flow [2025-03-04 15:20:05,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:20:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:20:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2025-03-04 15:20:05,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-03-04 15:20:05,922 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 43 flow. Second operand 6 states and 69 transitions. [2025-03-04 15:20:05,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 39 transitions, 151 flow [2025-03-04 15:20:05,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 39 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:05,926 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 80 flow [2025-03-04 15:20:05,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=80, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2025-03-04 15:20:05,930 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2025-03-04 15:20:05,930 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 80 flow [2025-03-04 15:20:05,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:20:05,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:05,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:20:05,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:20:05,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:05,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:05,932 INFO L85 PathProgramCache]: Analyzing trace with hash 555458370, now seen corresponding path program 1 times [2025-03-04 15:20:05,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:05,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963409653] [2025-03-04 15:20:05,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:05,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:05,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:20:05,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:20:05,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:05,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:06,107 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:20:06,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:06,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963409653] [2025-03-04 15:20:06,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963409653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:06,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:06,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:06,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018901967] [2025-03-04 15:20:06,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:06,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:20:06,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:06,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:20:06,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:20:06,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-03-04 15:20:06,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:20:06,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:06,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-03-04 15:20:06,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:06,235 INFO L124 PetriNetUnfolderBase]: 29/96 cut-off events. [2025-03-04 15:20:06,235 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-04 15:20:06,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 96 events. 29/96 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 325 event pairs, 8 based on Foata normal form. 14/110 useless extension candidates. Maximal degree in co-relation 219. Up to 51 conditions per place. [2025-03-04 15:20:06,239 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 22 selfloop transitions, 7 changer transitions 4/37 dead transitions. [2025-03-04 15:20:06,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 196 flow [2025-03-04 15:20:06,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:20:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:20:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2025-03-04 15:20:06,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-03-04 15:20:06,240 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 80 flow. Second operand 6 states and 66 transitions. [2025-03-04 15:20:06,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 196 flow [2025-03-04 15:20:06,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 186 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:06,242 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 115 flow [2025-03-04 15:20:06,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2025-03-04 15:20:06,242 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 14 predicate places. [2025-03-04 15:20:06,242 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 115 flow [2025-03-04 15:20:06,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:20:06,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:06,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:06,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:20:06,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:06,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:06,243 INFO L85 PathProgramCache]: Analyzing trace with hash 960140925, now seen corresponding path program 1 times [2025-03-04 15:20:06,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:06,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147448348] [2025-03-04 15:20:06,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:06,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:06,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:20:06,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:20:06,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:06,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:06,442 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:20:06,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:06,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147448348] [2025-03-04 15:20:06,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147448348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:06,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:06,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:20:06,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082692264] [2025-03-04 15:20:06,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:06,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:20:06,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:06,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:20:06,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:20:06,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 21 [2025-03-04 15:20:06,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:20:06,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:06,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 21 [2025-03-04 15:20:06,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:06,553 INFO L124 PetriNetUnfolderBase]: 25/90 cut-off events. [2025-03-04 15:20:06,554 INFO L125 PetriNetUnfolderBase]: For 71/75 co-relation queries the response was YES. [2025-03-04 15:20:06,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 90 events. 25/90 cut-off events. For 71/75 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 327 event pairs, 1 based on Foata normal form. 7/97 useless extension candidates. Maximal degree in co-relation 240. Up to 27 conditions per place. [2025-03-04 15:20:06,556 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 30 selfloop transitions, 9 changer transitions 0/45 dead transitions. [2025-03-04 15:20:06,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 271 flow [2025-03-04 15:20:06,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:20:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:20:06,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-03-04 15:20:06,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-04 15:20:06,559 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 115 flow. Second operand 5 states and 66 transitions. [2025-03-04 15:20:06,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 271 flow [2025-03-04 15:20:06,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 260 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:06,561 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 154 flow [2025-03-04 15:20:06,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2025-03-04 15:20:06,563 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 17 predicate places. [2025-03-04 15:20:06,563 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 154 flow [2025-03-04 15:20:06,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:20:06,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:06,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:06,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:20:06,564 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:06,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:06,565 INFO L85 PathProgramCache]: Analyzing trace with hash 552836031, now seen corresponding path program 2 times [2025-03-04 15:20:06,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:06,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752930632] [2025-03-04 15:20:06,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:06,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:06,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:20:06,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:20:06,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:06,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:06,712 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:20:06,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:06,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752930632] [2025-03-04 15:20:06,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752930632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:06,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:06,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:20:06,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989570045] [2025-03-04 15:20:06,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:06,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:20:06,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:06,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:20:06,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:20:06,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 21 [2025-03-04 15:20:06,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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:20:06,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:06,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 21 [2025-03-04 15:20:06,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:06,820 INFO L124 PetriNetUnfolderBase]: 25/104 cut-off events. [2025-03-04 15:20:06,820 INFO L125 PetriNetUnfolderBase]: For 136/140 co-relation queries the response was YES. [2025-03-04 15:20:06,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 104 events. 25/104 cut-off events. For 136/140 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 421 event pairs, 0 based on Foata normal form. 7/111 useless extension candidates. Maximal degree in co-relation 314. Up to 21 conditions per place. [2025-03-04 15:20:06,821 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 30 selfloop transitions, 20 changer transitions 0/56 dead transitions. [2025-03-04 15:20:06,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 386 flow [2025-03-04 15:20:06,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:20:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:20:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2025-03-04 15:20:06,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5654761904761905 [2025-03-04 15:20:06,822 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 154 flow. Second operand 8 states and 95 transitions. [2025-03-04 15:20:06,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 386 flow [2025-03-04 15:20:06,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:06,825 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 229 flow [2025-03-04 15:20:06,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2025-03-04 15:20:06,825 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 23 predicate places. [2025-03-04 15:20:06,825 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 229 flow [2025-03-04 15:20:06,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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:20:06,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:06,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:06,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:20:06,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:06,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:06,826 INFO L85 PathProgramCache]: Analyzing trace with hash 382263617, now seen corresponding path program 3 times [2025-03-04 15:20:06,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:06,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594573194] [2025-03-04 15:20:06,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:20:06,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:06,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:20:06,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:20:06,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:20:06,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:06,915 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:20:06,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:06,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594573194] [2025-03-04 15:20:06,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594573194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:06,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:06,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:20:06,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781924397] [2025-03-04 15:20:06,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:06,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:20:06,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:06,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:20:06,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:20:06,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 21 [2025-03-04 15:20:06,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:20:06,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:06,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 21 [2025-03-04 15:20:06,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:06,995 INFO L124 PetriNetUnfolderBase]: 30/133 cut-off events. [2025-03-04 15:20:06,995 INFO L125 PetriNetUnfolderBase]: For 196/200 co-relation queries the response was YES. [2025-03-04 15:20:06,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 133 events. 30/133 cut-off events. For 196/200 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 616 event pairs, 6 based on Foata normal form. 10/142 useless extension candidates. Maximal degree in co-relation 425. Up to 57 conditions per place. [2025-03-04 15:20:06,997 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 39 selfloop transitions, 17 changer transitions 0/62 dead transitions. [2025-03-04 15:20:06,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 469 flow [2025-03-04 15:20:06,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:20:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:20:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-03-04 15:20:06,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2025-03-04 15:20:06,998 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 229 flow. Second operand 5 states and 72 transitions. [2025-03-04 15:20:06,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 469 flow [2025-03-04 15:20:07,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 436 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:07,001 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 337 flow [2025-03-04 15:20:07,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=337, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2025-03-04 15:20:07,001 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 29 predicate places. [2025-03-04 15:20:07,001 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 337 flow [2025-03-04 15:20:07,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:20:07,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:07,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:07,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:20:07,002 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:07,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:07,002 INFO L85 PathProgramCache]: Analyzing trace with hash 238316052, now seen corresponding path program 1 times [2025-03-04 15:20:07,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:07,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223015152] [2025-03-04 15:20:07,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:07,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:07,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:20:07,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:20:07,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:07,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:07,131 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:20:07,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:07,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223015152] [2025-03-04 15:20:07,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223015152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:07,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:07,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:20:07,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039814547] [2025-03-04 15:20:07,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:07,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:20:07,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:07,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:20:07,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:20:07,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 21 [2025-03-04 15:20:07,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 337 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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:20:07,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:07,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 21 [2025-03-04 15:20:07,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:07,241 INFO L124 PetriNetUnfolderBase]: 20/96 cut-off events. [2025-03-04 15:20:07,241 INFO L125 PetriNetUnfolderBase]: For 257/261 co-relation queries the response was YES. [2025-03-04 15:20:07,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 96 events. 20/96 cut-off events. For 257/261 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 369 event pairs, 0 based on Foata normal form. 10/106 useless extension candidates. Maximal degree in co-relation 357. Up to 20 conditions per place. [2025-03-04 15:20:07,242 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 28 selfloop transitions, 26 changer transitions 0/60 dead transitions. [2025-03-04 15:20:07,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 511 flow [2025-03-04 15:20:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:20:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:20:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2025-03-04 15:20:07,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-04 15:20:07,244 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 337 flow. Second operand 6 states and 78 transitions. [2025-03-04 15:20:07,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 511 flow [2025-03-04 15:20:07,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 497 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:07,250 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 421 flow [2025-03-04 15:20:07,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-03-04 15:20:07,250 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 32 predicate places. [2025-03-04 15:20:07,251 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 421 flow [2025-03-04 15:20:07,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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:20:07,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:07,251 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:07,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:20:07,251 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:07,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:07,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1020845331, now seen corresponding path program 1 times [2025-03-04 15:20:07,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:07,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054308773] [2025-03-04 15:20:07,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:07,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:07,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:20:07,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:20:07,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:07,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:07,545 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:20:07,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:07,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054308773] [2025-03-04 15:20:07,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054308773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:07,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:07,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:07,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804641141] [2025-03-04 15:20:07,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:07,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:07,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:07,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:07,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:07,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-03-04 15:20:07,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 421 flow. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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:20:07,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:07,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-03-04 15:20:07,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:07,808 INFO L124 PetriNetUnfolderBase]: 29/110 cut-off events. [2025-03-04 15:20:07,809 INFO L125 PetriNetUnfolderBase]: For 384/386 co-relation queries the response was YES. [2025-03-04 15:20:07,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 110 events. 29/110 cut-off events. For 384/386 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 399 event pairs, 0 based on Foata normal form. 4/114 useless extension candidates. Maximal degree in co-relation 478. Up to 55 conditions per place. [2025-03-04 15:20:07,810 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 52 selfloop transitions, 22 changer transitions 0/75 dead transitions. [2025-03-04 15:20:07,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 718 flow [2025-03-04 15:20:07,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:20:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:20:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2025-03-04 15:20:07,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2025-03-04 15:20:07,812 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 421 flow. Second operand 13 states and 78 transitions. [2025-03-04 15:20:07,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 718 flow [2025-03-04 15:20:07,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 75 transitions, 696 flow, removed 11 selfloop flow, removed 0 redundant places. [2025-03-04 15:20:07,816 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 536 flow [2025-03-04 15:20:07,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=536, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2025-03-04 15:20:07,817 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 48 predicate places. [2025-03-04 15:20:07,817 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 536 flow [2025-03-04 15:20:07,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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:20:07,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:07,817 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:07,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:20:07,817 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:07,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:07,818 INFO L85 PathProgramCache]: Analyzing trace with hash -41473743, now seen corresponding path program 2 times [2025-03-04 15:20:07,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:07,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406637619] [2025-03-04 15:20:07,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:07,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:07,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:20:07,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:20:07,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:07,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:08,101 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:20:08,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:08,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406637619] [2025-03-04 15:20:08,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406637619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:08,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:08,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:08,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709887896] [2025-03-04 15:20:08,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:08,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:08,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:08,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:08,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:08,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-03-04 15:20:08,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 536 flow. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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:20:08,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:08,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-03-04 15:20:08,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:08,314 INFO L124 PetriNetUnfolderBase]: 32/126 cut-off events. [2025-03-04 15:20:08,314 INFO L125 PetriNetUnfolderBase]: For 531/533 co-relation queries the response was YES. [2025-03-04 15:20:08,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 126 events. 32/126 cut-off events. For 531/533 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 509 event pairs, 2 based on Foata normal form. 4/130 useless extension candidates. Maximal degree in co-relation 578. Up to 64 conditions per place. [2025-03-04 15:20:08,319 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 61 selfloop transitions, 25 changer transitions 0/87 dead transitions. [2025-03-04 15:20:08,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 87 transitions, 904 flow [2025-03-04 15:20:08,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:20:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:20:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2025-03-04 15:20:08,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27106227106227104 [2025-03-04 15:20:08,321 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 536 flow. Second operand 13 states and 74 transitions. [2025-03-04 15:20:08,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 87 transitions, 904 flow [2025-03-04 15:20:08,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 87 transitions, 862 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 15:20:08,327 INFO L231 Difference]: Finished difference. Result has 85 places, 72 transitions, 672 flow [2025-03-04 15:20:08,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=672, PETRI_PLACES=85, PETRI_TRANSITIONS=72} [2025-03-04 15:20:08,329 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 61 predicate places. [2025-03-04 15:20:08,329 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 72 transitions, 672 flow [2025-03-04 15:20:08,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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:20:08,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:08,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:08,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:20:08,330 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:08,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:08,330 INFO L85 PathProgramCache]: Analyzing trace with hash -824233585, now seen corresponding path program 3 times [2025-03-04 15:20:08,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:08,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789069659] [2025-03-04 15:20:08,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:20:08,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:08,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:20:08,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:20:08,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:20:08,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:08,586 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:20:08,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:08,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789069659] [2025-03-04 15:20:08,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789069659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:08,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:08,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:08,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653977263] [2025-03-04 15:20:08,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:08,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:08,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:08,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:08,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:08,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-03-04 15:20:08,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 72 transitions, 672 flow. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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:20:08,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:08,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-03-04 15:20:08,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:08,796 INFO L124 PetriNetUnfolderBase]: 35/140 cut-off events. [2025-03-04 15:20:08,796 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2025-03-04 15:20:08,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 140 events. 35/140 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 610 event pairs, 0 based on Foata normal form. 2/142 useless extension candidates. Maximal degree in co-relation 693. Up to 70 conditions per place. [2025-03-04 15:20:08,798 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 67 selfloop transitions, 28 changer transitions 0/96 dead transitions. [2025-03-04 15:20:08,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 96 transitions, 1051 flow [2025-03-04 15:20:08,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:20:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:20:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 82 transitions. [2025-03-04 15:20:08,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2789115646258503 [2025-03-04 15:20:08,800 INFO L175 Difference]: Start difference. First operand has 85 places, 72 transitions, 672 flow. Second operand 14 states and 82 transitions. [2025-03-04 15:20:08,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 96 transitions, 1051 flow [2025-03-04 15:20:08,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 96 transitions, 1017 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 15:20:08,806 INFO L231 Difference]: Finished difference. Result has 101 places, 81 transitions, 818 flow [2025-03-04 15:20:08,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=818, PETRI_PLACES=101, PETRI_TRANSITIONS=81} [2025-03-04 15:20:08,807 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 77 predicate places. [2025-03-04 15:20:08,807 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 81 transitions, 818 flow [2025-03-04 15:20:08,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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:20:08,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:08,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:08,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:20:08,807 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:08,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:08,808 INFO L85 PathProgramCache]: Analyzing trace with hash 645804627, now seen corresponding path program 4 times [2025-03-04 15:20:08,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:08,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195699537] [2025-03-04 15:20:08,808 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:20:08,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:08,813 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 12 statements into 2 equivalence classes. [2025-03-04 15:20:08,816 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:20:08,817 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:20:08,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:08,987 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:20:08,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:08,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195699537] [2025-03-04 15:20:08,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195699537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:08,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:08,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:08,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116361222] [2025-03-04 15:20:08,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:08,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:08,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:08,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:08,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:09,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-03-04 15:20:09,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 81 transitions, 818 flow. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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:20:09,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:09,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-03-04 15:20:09,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:09,220 INFO L124 PetriNetUnfolderBase]: 34/136 cut-off events. [2025-03-04 15:20:09,221 INFO L125 PetriNetUnfolderBase]: For 844/844 co-relation queries the response was YES. [2025-03-04 15:20:09,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 136 events. 34/136 cut-off events. For 844/844 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 576 event pairs, 3 based on Foata normal form. 2/138 useless extension candidates. Maximal degree in co-relation 732. Up to 35 conditions per place. [2025-03-04 15:20:09,222 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 54 selfloop transitions, 46 changer transitions 0/101 dead transitions. [2025-03-04 15:20:09,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 101 transitions, 1184 flow [2025-03-04 15:20:09,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:20:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:20:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2025-03-04 15:20:09,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2571428571428571 [2025-03-04 15:20:09,224 INFO L175 Difference]: Start difference. First operand has 101 places, 81 transitions, 818 flow. Second operand 15 states and 81 transitions. [2025-03-04 15:20:09,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 101 transitions, 1184 flow [2025-03-04 15:20:09,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 101 transitions, 1135 flow, removed 12 selfloop flow, removed 7 redundant places. [2025-03-04 15:20:09,231 INFO L231 Difference]: Finished difference. Result has 107 places, 88 transitions, 936 flow [2025-03-04 15:20:09,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=936, PETRI_PLACES=107, PETRI_TRANSITIONS=88} [2025-03-04 15:20:09,232 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 83 predicate places. [2025-03-04 15:20:09,233 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 88 transitions, 936 flow [2025-03-04 15:20:09,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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:20:09,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:09,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:09,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:20:09,233 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:09,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:09,234 INFO L85 PathProgramCache]: Analyzing trace with hash -134780674, now seen corresponding path program 1 times [2025-03-04 15:20:09,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:09,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450131392] [2025-03-04 15:20:09,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:09,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:09,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:20:09,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:20:09,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:09,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:09,424 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:20:09,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:09,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450131392] [2025-03-04 15:20:09,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450131392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:09,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:09,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:09,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874660944] [2025-03-04 15:20:09,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:09,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:09,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:09,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:09,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:09,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-03-04 15:20:09,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 88 transitions, 936 flow. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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:20:09,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:09,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-03-04 15:20:09,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:09,652 INFO L124 PetriNetUnfolderBase]: 39/156 cut-off events. [2025-03-04 15:20:09,652 INFO L125 PetriNetUnfolderBase]: For 883/883 co-relation queries the response was YES. [2025-03-04 15:20:09,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 156 events. 39/156 cut-off events. For 883/883 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 714 event pairs, 1 based on Foata normal form. 2/158 useless extension candidates. Maximal degree in co-relation 831. Up to 86 conditions per place. [2025-03-04 15:20:09,654 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 75 selfloop transitions, 28 changer transitions 0/113 dead transitions. [2025-03-04 15:20:09,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 113 transitions, 1300 flow [2025-03-04 15:20:09,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:20:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:20:09,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2025-03-04 15:20:09,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2755102040816326 [2025-03-04 15:20:09,656 INFO L175 Difference]: Start difference. First operand has 107 places, 88 transitions, 936 flow. Second operand 14 states and 81 transitions. [2025-03-04 15:20:09,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 113 transitions, 1300 flow [2025-03-04 15:20:09,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 113 transitions, 1201 flow, removed 21 selfloop flow, removed 11 redundant places. [2025-03-04 15:20:09,662 INFO L231 Difference]: Finished difference. Result has 115 places, 98 transitions, 1004 flow [2025-03-04 15:20:09,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1004, PETRI_PLACES=115, PETRI_TRANSITIONS=98} [2025-03-04 15:20:09,663 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 91 predicate places. [2025-03-04 15:20:09,663 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 98 transitions, 1004 flow [2025-03-04 15:20:09,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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:20:09,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:09,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:09,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:20:09,663 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:09,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:09,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1202614502, now seen corresponding path program 2 times [2025-03-04 15:20:09,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:09,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810913510] [2025-03-04 15:20:09,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:09,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:09,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:20:09,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:20:09,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:09,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:09,859 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:20:09,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:09,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810913510] [2025-03-04 15:20:09,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810913510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:09,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:09,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:09,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881659561] [2025-03-04 15:20:09,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:09,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:09,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:09,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:09,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:09,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-03-04 15:20:09,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 98 transitions, 1004 flow. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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:20:09,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:09,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-03-04 15:20:09,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:10,081 INFO L124 PetriNetUnfolderBase]: 37/157 cut-off events. [2025-03-04 15:20:10,081 INFO L125 PetriNetUnfolderBase]: For 927/927 co-relation queries the response was YES. [2025-03-04 15:20:10,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 157 events. 37/157 cut-off events. For 927/927 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 736 event pairs, 4 based on Foata normal form. 2/159 useless extension candidates. Maximal degree in co-relation 858. Up to 88 conditions per place. [2025-03-04 15:20:10,082 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 76 selfloop transitions, 29 changer transitions 0/115 dead transitions. [2025-03-04 15:20:10,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 115 transitions, 1334 flow [2025-03-04 15:20:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:20:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:20:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2025-03-04 15:20:10,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28205128205128205 [2025-03-04 15:20:10,083 INFO L175 Difference]: Start difference. First operand has 115 places, 98 transitions, 1004 flow. Second operand 13 states and 77 transitions. [2025-03-04 15:20:10,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 115 transitions, 1334 flow [2025-03-04 15:20:10,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 115 transitions, 1304 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 15:20:10,089 INFO L231 Difference]: Finished difference. Result has 127 places, 103 transitions, 1087 flow [2025-03-04 15:20:10,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1087, PETRI_PLACES=127, PETRI_TRANSITIONS=103} [2025-03-04 15:20:10,090 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 103 predicate places. [2025-03-04 15:20:10,090 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 103 transitions, 1087 flow [2025-03-04 15:20:10,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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:20:10,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:10,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:10,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:20:10,091 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:10,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:10,091 INFO L85 PathProgramCache]: Analyzing trace with hash 934392834, now seen corresponding path program 3 times [2025-03-04 15:20:10,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:10,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45752082] [2025-03-04 15:20:10,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:20:10,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:10,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:20:10,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:20:10,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:20:10,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:10,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:10,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45752082] [2025-03-04 15:20:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45752082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:10,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:10,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:10,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97288177] [2025-03-04 15:20:10,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:10,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:20:10,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:10,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:20:10,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:20:10,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-03-04 15:20:10,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 103 transitions, 1087 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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:20:10,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:10,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-03-04 15:20:10,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:10,387 INFO L124 PetriNetUnfolderBase]: 37/170 cut-off events. [2025-03-04 15:20:10,387 INFO L125 PetriNetUnfolderBase]: For 1104/1104 co-relation queries the response was YES. [2025-03-04 15:20:10,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 170 events. 37/170 cut-off events. For 1104/1104 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 860 event pairs, 0 based on Foata normal form. 2/172 useless extension candidates. Maximal degree in co-relation 959. Up to 78 conditions per place. [2025-03-04 15:20:10,389 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 72 selfloop transitions, 43 changer transitions 0/121 dead transitions. [2025-03-04 15:20:10,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 121 transitions, 1451 flow [2025-03-04 15:20:10,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:20:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:20:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 78 transitions. [2025-03-04 15:20:10,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2025-03-04 15:20:10,390 INFO L175 Difference]: Start difference. First operand has 127 places, 103 transitions, 1087 flow. Second operand 12 states and 78 transitions. [2025-03-04 15:20:10,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 121 transitions, 1451 flow [2025-03-04 15:20:10,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 121 transitions, 1402 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 15:20:10,397 INFO L231 Difference]: Finished difference. Result has 137 places, 115 transitions, 1250 flow [2025-03-04 15:20:10,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1250, PETRI_PLACES=137, PETRI_TRANSITIONS=115} [2025-03-04 15:20:10,398 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 113 predicate places. [2025-03-04 15:20:10,398 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 115 transitions, 1250 flow [2025-03-04 15:20:10,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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:20:10,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:10,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:10,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:20:10,398 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:10,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:10,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1793862010, now seen corresponding path program 4 times [2025-03-04 15:20:10,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:10,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182037011] [2025-03-04 15:20:10,399 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:20:10,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:10,404 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 12 statements into 2 equivalence classes. [2025-03-04 15:20:10,407 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:20:10,408 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:20:10,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:10,549 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:20:10,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:10,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182037011] [2025-03-04 15:20:10,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182037011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:10,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:10,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:10,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78179099] [2025-03-04 15:20:10,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:10,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:10,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:10,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:10,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:10,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-03-04 15:20:10,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 115 transitions, 1250 flow. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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:20:10,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:10,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-03-04 15:20:10,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:10,743 INFO L124 PetriNetUnfolderBase]: 43/186 cut-off events. [2025-03-04 15:20:10,743 INFO L125 PetriNetUnfolderBase]: For 1381/1381 co-relation queries the response was YES. [2025-03-04 15:20:10,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 186 events. 43/186 cut-off events. For 1381/1381 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 964 event pairs, 2 based on Foata normal form. 2/188 useless extension candidates. Maximal degree in co-relation 1106. Up to 96 conditions per place. [2025-03-04 15:20:10,745 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 92 selfloop transitions, 37 changer transitions 0/139 dead transitions. [2025-03-04 15:20:10,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 139 transitions, 1717 flow [2025-03-04 15:20:10,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:20:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:20:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2025-03-04 15:20:10,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2673992673992674 [2025-03-04 15:20:10,746 INFO L175 Difference]: Start difference. First operand has 137 places, 115 transitions, 1250 flow. Second operand 13 states and 73 transitions. [2025-03-04 15:20:10,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 139 transitions, 1717 flow [2025-03-04 15:20:10,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 139 transitions, 1652 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:10,753 INFO L231 Difference]: Finished difference. Result has 151 places, 122 transitions, 1378 flow [2025-03-04 15:20:10,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1378, PETRI_PLACES=151, PETRI_TRANSITIONS=122} [2025-03-04 15:20:10,754 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 127 predicate places. [2025-03-04 15:20:10,754 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 122 transitions, 1378 flow [2025-03-04 15:20:10,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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:20:10,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:10,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:10,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:20:10,755 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:10,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:10,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1586516650, now seen corresponding path program 5 times [2025-03-04 15:20:10,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:10,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315973943] [2025-03-04 15:20:10,755 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:20:10,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:10,760 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:20:10,763 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:20:10,763 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:10,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:10,905 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:20:10,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:10,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315973943] [2025-03-04 15:20:10,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315973943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:10,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:10,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:10,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796923025] [2025-03-04 15:20:10,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:10,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:10,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:10,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:10,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:10,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-03-04 15:20:10,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 122 transitions, 1378 flow. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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:20:10,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:10,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-03-04 15:20:10,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:11,142 INFO L124 PetriNetUnfolderBase]: 42/183 cut-off events. [2025-03-04 15:20:11,142 INFO L125 PetriNetUnfolderBase]: For 1520/1520 co-relation queries the response was YES. [2025-03-04 15:20:11,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 183 events. 42/183 cut-off events. For 1520/1520 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 944 event pairs, 2 based on Foata normal form. 2/185 useless extension candidates. Maximal degree in co-relation 1126. Up to 59 conditions per place. [2025-03-04 15:20:11,144 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 77 selfloop transitions, 55 changer transitions 0/142 dead transitions. [2025-03-04 15:20:11,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 142 transitions, 1826 flow [2025-03-04 15:20:11,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:20:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:20:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 80 transitions. [2025-03-04 15:20:11,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25396825396825395 [2025-03-04 15:20:11,145 INFO L175 Difference]: Start difference. First operand has 151 places, 122 transitions, 1378 flow. Second operand 15 states and 80 transitions. [2025-03-04 15:20:11,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 142 transitions, 1826 flow [2025-03-04 15:20:11,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 142 transitions, 1721 flow, removed 20 selfloop flow, removed 12 redundant places. [2025-03-04 15:20:11,154 INFO L231 Difference]: Finished difference. Result has 152 places, 130 transitions, 1467 flow [2025-03-04 15:20:11,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1467, PETRI_PLACES=152, PETRI_TRANSITIONS=130} [2025-03-04 15:20:11,154 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 128 predicate places. [2025-03-04 15:20:11,154 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 130 transitions, 1467 flow [2025-03-04 15:20:11,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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:20:11,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:11,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:11,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:20:11,155 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:11,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:11,155 INFO L85 PathProgramCache]: Analyzing trace with hash 218562755, now seen corresponding path program 1 times [2025-03-04 15:20:11,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:11,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934873821] [2025-03-04 15:20:11,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:11,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:11,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:20:11,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:20:11,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:11,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:11,317 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:20:11,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:11,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934873821] [2025-03-04 15:20:11,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934873821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:11,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:11,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:11,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662616278] [2025-03-04 15:20:11,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:11,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:11,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:11,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:11,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:11,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 15:20:11,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 130 transitions, 1467 flow. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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:20:11,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:11,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 15:20:11,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:11,556 INFO L124 PetriNetUnfolderBase]: 40/179 cut-off events. [2025-03-04 15:20:11,557 INFO L125 PetriNetUnfolderBase]: For 1456/1456 co-relation queries the response was YES. [2025-03-04 15:20:11,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 179 events. 40/179 cut-off events. For 1456/1456 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 920 event pairs, 1 based on Foata normal form. 2/181 useless extension candidates. Maximal degree in co-relation 1105. Up to 115 conditions per place. [2025-03-04 15:20:11,558 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 84 selfloop transitions, 21 changer transitions 16/139 dead transitions. [2025-03-04 15:20:11,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 139 transitions, 1773 flow [2025-03-04 15:20:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:20:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:20:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 92 transitions. [2025-03-04 15:20:11,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2920634920634921 [2025-03-04 15:20:11,559 INFO L175 Difference]: Start difference. First operand has 152 places, 130 transitions, 1467 flow. Second operand 15 states and 92 transitions. [2025-03-04 15:20:11,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 139 transitions, 1773 flow [2025-03-04 15:20:11,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 139 transitions, 1674 flow, removed 20 selfloop flow, removed 9 redundant places. [2025-03-04 15:20:11,568 INFO L231 Difference]: Finished difference. Result has 159 places, 118 transitions, 1289 flow [2025-03-04 15:20:11,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1289, PETRI_PLACES=159, PETRI_TRANSITIONS=118} [2025-03-04 15:20:11,569 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 135 predicate places. [2025-03-04 15:20:11,569 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 118 transitions, 1289 flow [2025-03-04 15:20:11,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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:20:11,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:11,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:11,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:20:11,570 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:11,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:11,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1581434075, now seen corresponding path program 2 times [2025-03-04 15:20:11,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:11,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867460851] [2025-03-04 15:20:11,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:11,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:11,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:20:11,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:20:11,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:11,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:11,714 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:20:11,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:11,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867460851] [2025-03-04 15:20:11,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867460851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:11,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:11,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:11,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65870420] [2025-03-04 15:20:11,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:11,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:11,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:11,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:11,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:11,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 15:20:11,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 118 transitions, 1289 flow. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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:20:11,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:11,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 15:20:11,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:11,902 INFO L124 PetriNetUnfolderBase]: 35/156 cut-off events. [2025-03-04 15:20:11,902 INFO L125 PetriNetUnfolderBase]: For 1313/1315 co-relation queries the response was YES. [2025-03-04 15:20:11,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 156 events. 35/156 cut-off events. For 1313/1315 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 744 event pairs, 1 based on Foata normal form. 2/158 useless extension candidates. Maximal degree in co-relation 946. Up to 102 conditions per place. [2025-03-04 15:20:11,903 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 75 selfloop transitions, 19 changer transitions 16/125 dead transitions. [2025-03-04 15:20:11,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 125 transitions, 1558 flow [2025-03-04 15:20:11,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:20:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:20:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2025-03-04 15:20:11,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2025-03-04 15:20:11,904 INFO L175 Difference]: Start difference. First operand has 159 places, 118 transitions, 1289 flow. Second operand 12 states and 77 transitions. [2025-03-04 15:20:11,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 125 transitions, 1558 flow [2025-03-04 15:20:11,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 125 transitions, 1447 flow, removed 6 selfloop flow, removed 15 redundant places. [2025-03-04 15:20:11,910 INFO L231 Difference]: Finished difference. Result has 147 places, 106 transitions, 1087 flow [2025-03-04 15:20:11,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1087, PETRI_PLACES=147, PETRI_TRANSITIONS=106} [2025-03-04 15:20:11,911 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 123 predicate places. [2025-03-04 15:20:11,911 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 106 transitions, 1087 flow [2025-03-04 15:20:11,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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:20:11,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:11,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:11,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:20:11,911 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:11,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:11,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2067256469, now seen corresponding path program 3 times [2025-03-04 15:20:11,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:11,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395927159] [2025-03-04 15:20:11,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:20:11,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:11,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:20:11,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:20:11,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:20:11,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:12,047 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:20:12,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:12,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395927159] [2025-03-04 15:20:12,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395927159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:12,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:12,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:12,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805236125] [2025-03-04 15:20:12,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:12,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:12,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:12,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:12,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:12,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 15:20:12,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 106 transitions, 1087 flow. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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:20:12,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:12,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 15:20:12,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:12,284 INFO L124 PetriNetUnfolderBase]: 31/140 cut-off events. [2025-03-04 15:20:12,284 INFO L125 PetriNetUnfolderBase]: For 978/980 co-relation queries the response was YES. [2025-03-04 15:20:12,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 140 events. 31/140 cut-off events. For 978/980 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 634 event pairs, 0 based on Foata normal form. 2/142 useless extension candidates. Maximal degree in co-relation 801. Up to 89 conditions per place. [2025-03-04 15:20:12,286 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 67 selfloop transitions, 18 changer transitions 17/114 dead transitions. [2025-03-04 15:20:12,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 114 transitions, 1338 flow [2025-03-04 15:20:12,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 15:20:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 15:20:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 92 transitions. [2025-03-04 15:20:12,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27380952380952384 [2025-03-04 15:20:12,287 INFO L175 Difference]: Start difference. First operand has 147 places, 106 transitions, 1087 flow. Second operand 16 states and 92 transitions. [2025-03-04 15:20:12,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 114 transitions, 1338 flow [2025-03-04 15:20:12,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 114 transitions, 1202 flow, removed 5 selfloop flow, removed 15 redundant places. [2025-03-04 15:20:12,292 INFO L231 Difference]: Finished difference. Result has 139 places, 94 transitions, 886 flow [2025-03-04 15:20:12,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=886, PETRI_PLACES=139, PETRI_TRANSITIONS=94} [2025-03-04 15:20:12,293 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 115 predicate places. [2025-03-04 15:20:12,294 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 94 transitions, 886 flow [2025-03-04 15:20:12,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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:20:12,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:12,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:12,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:20:12,294 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:12,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:12,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2147433617, now seen corresponding path program 4 times [2025-03-04 15:20:12,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:12,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658005241] [2025-03-04 15:20:12,295 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:20:12,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:12,299 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:20:12,302 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:20:12,302 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:20:12,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:12,432 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:20:12,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:12,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658005241] [2025-03-04 15:20:12,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658005241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:12,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:12,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:12,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484276732] [2025-03-04 15:20:12,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:12,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:12,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:12,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:12,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:12,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 15:20:12,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 94 transitions, 886 flow. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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:20:12,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:12,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 15:20:12,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:12,644 INFO L124 PetriNetUnfolderBase]: 25/127 cut-off events. [2025-03-04 15:20:12,644 INFO L125 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2025-03-04 15:20:12,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 127 events. 25/127 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 565 event pairs, 0 based on Foata normal form. 2/129 useless extension candidates. Maximal degree in co-relation 673. Up to 77 conditions per place. [2025-03-04 15:20:12,645 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 58 selfloop transitions, 19 changer transitions 12/101 dead transitions. [2025-03-04 15:20:12,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 101 transitions, 1105 flow [2025-03-04 15:20:12,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 15:20:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 15:20:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 91 transitions. [2025-03-04 15:20:12,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2708333333333333 [2025-03-04 15:20:12,646 INFO L175 Difference]: Start difference. First operand has 139 places, 94 transitions, 886 flow. Second operand 16 states and 91 transitions. [2025-03-04 15:20:12,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 101 transitions, 1105 flow [2025-03-04 15:20:12,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 101 transitions, 1025 flow, removed 4 selfloop flow, removed 18 redundant places. [2025-03-04 15:20:12,650 INFO L231 Difference]: Finished difference. Result has 127 places, 87 transitions, 799 flow [2025-03-04 15:20:12,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=799, PETRI_PLACES=127, PETRI_TRANSITIONS=87} [2025-03-04 15:20:12,650 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 103 predicate places. [2025-03-04 15:20:12,650 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 87 transitions, 799 flow [2025-03-04 15:20:12,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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:20:12,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:12,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:12,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:20:12,651 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:12,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:12,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1098593091, now seen corresponding path program 1 times [2025-03-04 15:20:12,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:12,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810550838] [2025-03-04 15:20:12,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:12,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:12,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:20:12,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:20:12,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:12,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:12,810 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:20:12,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:12,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810550838] [2025-03-04 15:20:12,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810550838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:12,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:12,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:12,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832435046] [2025-03-04 15:20:12,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:12,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:12,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:12,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:12,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:12,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 15:20:12,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 87 transitions, 799 flow. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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:20:12,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:12,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 15:20:12,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:13,047 INFO L124 PetriNetUnfolderBase]: 18/103 cut-off events. [2025-03-04 15:20:13,047 INFO L125 PetriNetUnfolderBase]: For 521/521 co-relation queries the response was YES. [2025-03-04 15:20:13,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 103 events. 18/103 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 421 event pairs, 0 based on Foata normal form. 8/111 useless extension candidates. Maximal degree in co-relation 557. Up to 25 conditions per place. [2025-03-04 15:20:13,051 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 25 selfloop transitions, 7 changer transitions 53/89 dead transitions. [2025-03-04 15:20:13,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 89 transitions, 967 flow [2025-03-04 15:20:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:20:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:20:13,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 90 transitions. [2025-03-04 15:20:13,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2025-03-04 15:20:13,052 INFO L175 Difference]: Start difference. First operand has 127 places, 87 transitions, 799 flow. Second operand 15 states and 90 transitions. [2025-03-04 15:20:13,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 89 transitions, 967 flow [2025-03-04 15:20:13,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 89 transitions, 911 flow, removed 3 selfloop flow, removed 16 redundant places. [2025-03-04 15:20:13,055 INFO L231 Difference]: Finished difference. Result has 119 places, 34 transitions, 256 flow [2025-03-04 15:20:13,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=256, PETRI_PLACES=119, PETRI_TRANSITIONS=34} [2025-03-04 15:20:13,055 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 95 predicate places. [2025-03-04 15:20:13,056 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 34 transitions, 256 flow [2025-03-04 15:20:13,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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:20:13,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:13,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:13,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:20:13,057 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:13,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:13,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1937376021, now seen corresponding path program 2 times [2025-03-04 15:20:13,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:13,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587060625] [2025-03-04 15:20:13,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:13,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:13,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:20:13,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:20:13,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:13,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:13,191 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:20:13,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:13,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587060625] [2025-03-04 15:20:13,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587060625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:13,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:13,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:13,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571866537] [2025-03-04 15:20:13,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:13,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:13,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:13,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:13,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:13,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 15:20:13,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 34 transitions, 256 flow. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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:20:13,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:13,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 15:20:13,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:13,324 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2025-03-04 15:20:13,324 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-03-04 15:20:13,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 34 events. 4/34 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 2/36 useless extension candidates. Maximal degree in co-relation 160. Up to 8 conditions per place. [2025-03-04 15:20:13,325 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 8 selfloop transitions, 4 changer transitions 19/33 dead transitions. [2025-03-04 15:20:13,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 33 transitions, 304 flow [2025-03-04 15:20:13,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:20:13,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:20:13,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2025-03-04 15:20:13,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2490842490842491 [2025-03-04 15:20:13,326 INFO L175 Difference]: Start difference. First operand has 119 places, 34 transitions, 256 flow. Second operand 13 states and 68 transitions. [2025-03-04 15:20:13,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 33 transitions, 304 flow [2025-03-04 15:20:13,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 33 transitions, 219 flow, removed 1 selfloop flow, removed 24 redundant places. [2025-03-04 15:20:13,327 INFO L231 Difference]: Finished difference. Result has 68 places, 14 transitions, 71 flow [2025-03-04 15:20:13,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=71, PETRI_PLACES=68, PETRI_TRANSITIONS=14} [2025-03-04 15:20:13,327 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 44 predicate places. [2025-03-04 15:20:13,327 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 14 transitions, 71 flow [2025-03-04 15:20:13,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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:20:13,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:13,327 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:13,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:20:13,327 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 15:20:13,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:13,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1415908478, now seen corresponding path program 1 times [2025-03-04 15:20:13,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:13,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948419856] [2025-03-04 15:20:13,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:13,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:13,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:20:13,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:20:13,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:13,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:13,465 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:20:13,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:13,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948419856] [2025-03-04 15:20:13,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948419856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:13,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:13,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:13,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210510233] [2025-03-04 15:20:13,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:13,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:13,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:13,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:13,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:13,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 15:20:13,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 14 transitions, 71 flow. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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:20:13,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:13,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 15:20:13,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:13,526 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-04 15:20:13,527 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 15:20:13,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 13 events. 0/13 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 1/14 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-04 15:20:13,527 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 0 selfloop transitions, 0 changer transitions 13/13 dead transitions. [2025-03-04 15:20:13,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 13 transitions, 89 flow [2025-03-04 15:20:13,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:20:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:20:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2025-03-04 15:20:13,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.20634920634920634 [2025-03-04 15:20:13,528 INFO L175 Difference]: Start difference. First operand has 68 places, 14 transitions, 71 flow. Second operand 9 states and 39 transitions. [2025-03-04 15:20:13,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 13 transitions, 89 flow [2025-03-04 15:20:13,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 13 transitions, 55 flow, removed 1 selfloop flow, removed 15 redundant places. [2025-03-04 15:20:13,528 INFO L231 Difference]: Finished difference. Result has 35 places, 0 transitions, 0 flow [2025-03-04 15:20:13,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=33, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=35, PETRI_TRANSITIONS=0} [2025-03-04 15:20:13,528 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2025-03-04 15:20:13,528 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 0 transitions, 0 flow [2025-03-04 15:20:13,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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:20:13,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2025-03-04 15:20:13,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2025-03-04 15:20:13,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-04 15:20:13,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2025-03-04 15:20:13,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2025-03-04 15:20:13,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2025-03-04 15:20:13,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2025-03-04 15:20:13,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:20:13,531 INFO L422 BasicCegarLoop]: Path program histogram: [5, 4, 4, 3, 2, 1, 1, 1, 1] [2025-03-04 15:20:13,534 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:20:13,534 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:20:13,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:20:13 BasicIcfg [2025-03-04 15:20:13,539 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:20:13,539 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:20:13,539 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:20:13,539 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:20:13,540 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:20:05" (3/4) ... [2025-03-04 15:20:13,541 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:20:13,543 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-04 15:20:13,545 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-03-04 15:20:13,546 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-04 15:20:13,546 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 15:20:13,592 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:20:13,592 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:20:13,592 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:20:13,593 INFO L158 Benchmark]: Toolchain (without parser) took 9182.17ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 103.3MB in the beginning and 136.1MB in the end (delta: -32.8MB). Peak memory consumption was 221.3MB. Max. memory is 16.1GB. [2025-03-04 15:20:13,593 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:20:13,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.77ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 80.4MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 15:20:13,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.58ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 79.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:20:13,593 INFO L158 Benchmark]: Boogie Preprocessor took 20.42ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 76.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:20:13,594 INFO L158 Benchmark]: IcfgBuilder took 323.91ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 56.4MB in the end (delta: 20.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 15:20:13,594 INFO L158 Benchmark]: TraceAbstraction took 8382.75ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 56.4MB in the beginning and 140.5MB in the end (delta: -84.1MB). Peak memory consumption was 171.0MB. Max. memory is 16.1GB. [2025-03-04 15:20:13,594 INFO L158 Benchmark]: Witness Printer took 53.39ms. Allocated memory is still 394.3MB. Free memory was 140.5MB in the beginning and 136.1MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:20:13,595 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.23ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.77ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 80.4MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.58ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 79.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.42ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 76.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 323.91ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 56.4MB in the end (delta: 20.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8382.75ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 56.4MB in the beginning and 140.5MB in the end (delta: -84.1MB). Peak memory consumption was 171.0MB. Max. memory is 16.1GB. * Witness Printer took 53.39ms. Allocated memory is still 394.3MB. Free memory was 140.5MB in the beginning and 136.1MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3001]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 3001]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 3001]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 3001]: 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 3 procedures, 33 locations, 7 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.3s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 926 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 842 mSDsluCounter, 1031 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 944 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3679 IncrementalHoareTripleChecker+Invalid, 3775 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 87 mSDtfsCounter, 3679 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1467occurred in iteration=15, InterpolantAutomatonStates: 254, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 2623 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:20:13,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE