./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c --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/weaver/chl-file-item-trans.wvr.c -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 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:24:47,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:24:47,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:24:47,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:24:47,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:24:47,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:24:47,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:24:47,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:24:47,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:24:47,648 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:24:47,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:24:47,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:24:47,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:24:47,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:24:47,649 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:24:47,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:24:47,650 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:24:47,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:24:47,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:24:47,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:24:47,651 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:24:47,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:24:47,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:24:47,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:24:47,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:24:47,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:24:47,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:24:47,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:24:47,652 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 -> 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a [2025-03-04 15:24:47,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:24:47,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:24:47,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:24:47,885 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:24:47,886 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:24:47,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2025-03-04 15:24:49,034 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939391734/7b60e35efb2b4640877e6ee4b6893766/FLAG7c0cbdc1f [2025-03-04 15:24:49,274 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:24:49,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2025-03-04 15:24:49,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939391734/7b60e35efb2b4640877e6ee4b6893766/FLAG7c0cbdc1f [2025-03-04 15:24:49,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939391734/7b60e35efb2b4640877e6ee4b6893766 [2025-03-04 15:24:49,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:24:49,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:24:49,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:24:49,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:24:49,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:24:49,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b84acf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49, skipping insertion in model container [2025-03-04 15:24:49,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:24:49,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:24:49,747 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:24:49,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:24:49,774 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:24:49,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49 WrapperNode [2025-03-04 15:24:49,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:24:49,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:24:49,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:24:49,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:24:49,780 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:24:49" (1/1) ... [2025-03-04 15:24:49,787 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:24:49" (1/1) ... [2025-03-04 15:24:49,802 INFO L138 Inliner]: procedures = 22, calls = 16, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 236 [2025-03-04 15:24:49,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:24:49,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:24:49,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:24:49,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:24:49,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,825 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 15:24:49,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,830 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:24:49,835 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:24:49,835 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:24:49,835 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:24:49,836 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:24:49,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:49,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:24:49,865 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:24:49,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:24:49,878 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:24:49,879 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:24:49,879 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:24:49,879 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:24:49,879 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:24:49,879 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:24:49,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:24:49,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:24:49,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:24:49,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:24:49,950 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:24:49,952 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:24:50,310 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:24:50,311 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:24:50,488 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:24:50,488 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:24:50,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:24:50 BoogieIcfgContainer [2025-03-04 15:24:50,489 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:24:50,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:24:50,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:24:50,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:24:50,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:24:49" (1/3) ... [2025-03-04 15:24:50,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39344f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:24:50, skipping insertion in model container [2025-03-04 15:24:50,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (2/3) ... [2025-03-04 15:24:50,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39344f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:24:50, skipping insertion in model container [2025-03-04 15:24:50,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:24:50" (3/3) ... [2025-03-04 15:24:50,496 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2025-03-04 15:24:50,508 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:24:50,509 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-trans.wvr.c that has 4 procedures, 90 locations, 1 initial locations, 0 loop locations, and 18 error locations. [2025-03-04 15:24:50,509 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:24:50,590 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:24:50,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 107 transitions, 235 flow [2025-03-04 15:24:50,682 INFO L124 PetriNetUnfolderBase]: 18/104 cut-off events. [2025-03-04 15:24:50,685 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:24:50,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 18/104 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 388 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2025-03-04 15:24:50,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 107 transitions, 235 flow [2025-03-04 15:24:50,699 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 102 transitions, 219 flow [2025-03-04 15:24:50,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:24:50,716 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;@55b5e501, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:24:50,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-03-04 15:24:50,725 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:24:50,726 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2025-03-04 15:24:50,726 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:24:50,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:50,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:50,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:50,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:50,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1008643709, now seen corresponding path program 1 times [2025-03-04 15:24:50,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:50,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381651306] [2025-03-04 15:24:50,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:50,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:50,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:24:50,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:24:50,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:50,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:50,994 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:24:50,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:50,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381651306] [2025-03-04 15:24:50,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381651306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:50,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:50,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:50,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082895935] [2025-03-04 15:24:50,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:51,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:51,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:51,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:51,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:51,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 107 [2025-03-04 15:24:51,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 102 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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:24:51,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:51,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 107 [2025-03-04 15:24:51,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:52,777 INFO L124 PetriNetUnfolderBase]: 14059/22486 cut-off events. [2025-03-04 15:24:52,779 INFO L125 PetriNetUnfolderBase]: For 350/350 co-relation queries the response was YES. [2025-03-04 15:24:52,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41488 conditions, 22486 events. 14059/22486 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 1407. Compared 187009 event pairs, 5420 based on Foata normal form. 532/18809 useless extension candidates. Maximal degree in co-relation 40483. Up to 10138 conditions per place. [2025-03-04 15:24:52,931 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 100 selfloop transitions, 5 changer transitions 0/159 dead transitions. [2025-03-04 15:24:52,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 159 transitions, 555 flow [2025-03-04 15:24:52,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 336 transitions. [2025-03-04 15:24:52,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7850467289719626 [2025-03-04 15:24:52,941 INFO L175 Difference]: Start difference. First operand has 94 places, 102 transitions, 219 flow. Second operand 4 states and 336 transitions. [2025-03-04 15:24:52,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 159 transitions, 555 flow [2025-03-04 15:24:52,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 159 transitions, 540 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:24:52,961 INFO L231 Difference]: Finished difference. Result has 94 places, 104 transitions, 244 flow [2025-03-04 15:24:52,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=94, PETRI_TRANSITIONS=104} [2025-03-04 15:24:52,967 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 0 predicate places. [2025-03-04 15:24:52,967 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 104 transitions, 244 flow [2025-03-04 15:24:52,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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:24:52,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:52,967 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:52,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:24:52,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:52,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:52,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1203183284, now seen corresponding path program 1 times [2025-03-04 15:24:52,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:52,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605669583] [2025-03-04 15:24:52,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:52,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:52,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:24:52,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:24:52,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:52,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:53,064 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:24:53,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:53,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605669583] [2025-03-04 15:24:53,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605669583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:53,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:53,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:24:53,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94992608] [2025-03-04 15:24:53,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:53,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:53,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:53,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:53,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:53,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 107 [2025-03-04 15:24:53,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 104 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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:24:53,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:53,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 107 [2025-03-04 15:24:53,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:54,173 INFO L124 PetriNetUnfolderBase]: 10585/19081 cut-off events. [2025-03-04 15:24:54,173 INFO L125 PetriNetUnfolderBase]: For 3433/3455 co-relation queries the response was YES. [2025-03-04 15:24:54,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36848 conditions, 19081 events. 10585/19081 cut-off events. For 3433/3455 co-relation queries the response was YES. Maximal size of possible extension queue 1213. Compared 175659 event pairs, 3367 based on Foata normal form. 22/16403 useless extension candidates. Maximal degree in co-relation 21643. Up to 7399 conditions per place. [2025-03-04 15:24:54,324 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 68 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2025-03-04 15:24:54,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 130 transitions, 443 flow [2025-03-04 15:24:54,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 311 transitions. [2025-03-04 15:24:54,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7266355140186916 [2025-03-04 15:24:54,328 INFO L175 Difference]: Start difference. First operand has 94 places, 104 transitions, 244 flow. Second operand 4 states and 311 transitions. [2025-03-04 15:24:54,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 130 transitions, 443 flow [2025-03-04 15:24:54,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 130 transitions, 443 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:24:54,399 INFO L231 Difference]: Finished difference. Result has 96 places, 103 transitions, 250 flow [2025-03-04 15:24:54,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=96, PETRI_TRANSITIONS=103} [2025-03-04 15:24:54,400 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 2 predicate places. [2025-03-04 15:24:54,400 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 250 flow [2025-03-04 15:24:54,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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:24:54,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:54,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:54,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:24:54,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:54,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:54,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1932996839, now seen corresponding path program 1 times [2025-03-04 15:24:54,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:54,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793843459] [2025-03-04 15:24:54,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:54,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:54,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:24:54,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:24:54,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:54,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:54,481 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:24:54,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:54,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793843459] [2025-03-04 15:24:54,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793843459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:54,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:54,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:54,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154967037] [2025-03-04 15:24:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:54,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:54,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:54,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:54,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:54,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 107 [2025-03-04 15:24:54,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 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:24:54,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:54,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 107 [2025-03-04 15:24:54,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:55,858 INFO L124 PetriNetUnfolderBase]: 16662/27924 cut-off events. [2025-03-04 15:24:55,858 INFO L125 PetriNetUnfolderBase]: For 8540/9365 co-relation queries the response was YES. [2025-03-04 15:24:55,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55652 conditions, 27924 events. 16662/27924 cut-off events. For 8540/9365 co-relation queries the response was YES. Maximal size of possible extension queue 1652. Compared 250604 event pairs, 6498 based on Foata normal form. 1059/24202 useless extension candidates. Maximal degree in co-relation 34387. Up to 11984 conditions per place. [2025-03-04 15:24:55,991 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 104 selfloop transitions, 5 changer transitions 0/162 dead transitions. [2025-03-04 15:24:55,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 162 transitions, 640 flow [2025-03-04 15:24:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:55,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 334 transitions. [2025-03-04 15:24:55,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.780373831775701 [2025-03-04 15:24:55,993 INFO L175 Difference]: Start difference. First operand has 96 places, 103 transitions, 250 flow. Second operand 4 states and 334 transitions. [2025-03-04 15:24:55,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 162 transitions, 640 flow [2025-03-04 15:24:56,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 162 transitions, 620 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:56,048 INFO L231 Difference]: Finished difference. Result has 98 places, 105 transitions, 276 flow [2025-03-04 15:24:56,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=276, PETRI_PLACES=98, PETRI_TRANSITIONS=105} [2025-03-04 15:24:56,049 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 4 predicate places. [2025-03-04 15:24:56,049 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 105 transitions, 276 flow [2025-03-04 15:24:56,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 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:24:56,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:56,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:56,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:24:56,050 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:56,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1355993735, now seen corresponding path program 1 times [2025-03-04 15:24:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:56,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993936124] [2025-03-04 15:24:56,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:56,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:56,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:24:56,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:24:56,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:56,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:56,126 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:24:56,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:56,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993936124] [2025-03-04 15:24:56,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993936124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:56,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:56,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:24:56,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898517563] [2025-03-04 15:24:56,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:56,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:56,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:56,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:56,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:56,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 107 [2025-03-04 15:24:56,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 105 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 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:24:56,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:56,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 107 [2025-03-04 15:24:56,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:57,439 INFO L124 PetriNetUnfolderBase]: 12451/23079 cut-off events. [2025-03-04 15:24:57,439 INFO L125 PetriNetUnfolderBase]: For 8831/9450 co-relation queries the response was YES. [2025-03-04 15:24:57,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47137 conditions, 23079 events. 12451/23079 cut-off events. For 8831/9450 co-relation queries the response was YES. Maximal size of possible extension queue 1381. Compared 223221 event pairs, 4037 based on Foata normal form. 637/20698 useless extension candidates. Maximal degree in co-relation 29721. Up to 8977 conditions per place. [2025-03-04 15:24:57,605 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 73 selfloop transitions, 4 changer transitions 0/133 dead transitions. [2025-03-04 15:24:57,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 133 transitions, 505 flow [2025-03-04 15:24:57,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 307 transitions. [2025-03-04 15:24:57,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7172897196261683 [2025-03-04 15:24:57,608 INFO L175 Difference]: Start difference. First operand has 98 places, 105 transitions, 276 flow. Second operand 4 states and 307 transitions. [2025-03-04 15:24:57,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 133 transitions, 505 flow [2025-03-04 15:24:57,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 133 transitions, 505 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:24:57,692 INFO L231 Difference]: Finished difference. Result has 100 places, 104 transitions, 280 flow [2025-03-04 15:24:57,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=100, PETRI_TRANSITIONS=104} [2025-03-04 15:24:57,692 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 6 predicate places. [2025-03-04 15:24:57,693 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 104 transitions, 280 flow [2025-03-04 15:24:57,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 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:24:57,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:57,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:57,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:24:57,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:57,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:57,693 INFO L85 PathProgramCache]: Analyzing trace with hash 206640789, now seen corresponding path program 1 times [2025-03-04 15:24:57,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:57,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860324577] [2025-03-04 15:24:57,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:57,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:57,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:24:57,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:24:57,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:57,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:57,777 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:24:57,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:57,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860324577] [2025-03-04 15:24:57,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860324577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:57,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:57,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:24:57,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019856383] [2025-03-04 15:24:57,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:57,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:57,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:57,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:57,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:57,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 107 [2025-03-04 15:24:57,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 104 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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:24:57,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:57,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 107 [2025-03-04 15:24:57,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:58,866 INFO L124 PetriNetUnfolderBase]: 12470/23374 cut-off events. [2025-03-04 15:24:58,866 INFO L125 PetriNetUnfolderBase]: For 10404/10730 co-relation queries the response was YES. [2025-03-04 15:24:58,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48381 conditions, 23374 events. 12470/23374 cut-off events. For 10404/10730 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 228857 event pairs, 3941 based on Foata normal form. 326/20655 useless extension candidates. Maximal degree in co-relation 30653. Up to 8891 conditions per place. [2025-03-04 15:24:59,017 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 71 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2025-03-04 15:24:59,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 131 transitions, 511 flow [2025-03-04 15:24:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2025-03-04 15:24:59,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7242990654205608 [2025-03-04 15:24:59,019 INFO L175 Difference]: Start difference. First operand has 100 places, 104 transitions, 280 flow. Second operand 4 states and 310 transitions. [2025-03-04 15:24:59,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 131 transitions, 511 flow [2025-03-04 15:24:59,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 131 transitions, 497 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:59,154 INFO L231 Difference]: Finished difference. Result has 99 places, 103 transitions, 278 flow [2025-03-04 15:24:59,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=99, PETRI_TRANSITIONS=103} [2025-03-04 15:24:59,155 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 5 predicate places. [2025-03-04 15:24:59,155 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 103 transitions, 278 flow [2025-03-04 15:24:59,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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:24:59,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:59,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:59,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:24:59,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:59,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:59,156 INFO L85 PathProgramCache]: Analyzing trace with hash -913867538, now seen corresponding path program 1 times [2025-03-04 15:24:59,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:59,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784134535] [2025-03-04 15:24:59,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:59,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:59,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:24:59,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:24:59,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:59,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:59,237 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:24:59,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784134535] [2025-03-04 15:24:59,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784134535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:59,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:59,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:59,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935736581] [2025-03-04 15:24:59,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:59,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:24:59,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:59,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:24:59,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:24:59,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 107 [2025-03-04 15:24:59,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 103 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 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:24:59,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:59,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 107 [2025-03-04 15:24:59,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:00,440 INFO L124 PetriNetUnfolderBase]: 16728/27017 cut-off events. [2025-03-04 15:25:00,440 INFO L125 PetriNetUnfolderBase]: For 10953/11787 co-relation queries the response was YES. [2025-03-04 15:25:00,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59137 conditions, 27017 events. 16728/27017 cut-off events. For 10953/11787 co-relation queries the response was YES. Maximal size of possible extension queue 1632. Compared 233352 event pairs, 3953 based on Foata normal form. 420/24833 useless extension candidates. Maximal degree in co-relation 36750. Up to 10961 conditions per place. [2025-03-04 15:25:00,622 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 102 selfloop transitions, 6 changer transitions 0/160 dead transitions. [2025-03-04 15:25:00,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 160 transitions, 662 flow [2025-03-04 15:25:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:25:00,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:25:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 392 transitions. [2025-03-04 15:25:00,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7327102803738318 [2025-03-04 15:25:00,624 INFO L175 Difference]: Start difference. First operand has 99 places, 103 transitions, 278 flow. Second operand 5 states and 392 transitions. [2025-03-04 15:25:00,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 160 transitions, 662 flow [2025-03-04 15:25:00,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 160 transitions, 642 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:25:00,710 INFO L231 Difference]: Finished difference. Result has 99 places, 102 transitions, 280 flow [2025-03-04 15:25:00,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=99, PETRI_TRANSITIONS=102} [2025-03-04 15:25:00,710 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 5 predicate places. [2025-03-04 15:25:00,710 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 102 transitions, 280 flow [2025-03-04 15:25:00,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 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:25:00,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:00,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:00,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:25:00,711 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:25:00,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:00,711 INFO L85 PathProgramCache]: Analyzing trace with hash -913866545, now seen corresponding path program 1 times [2025-03-04 15:25:00,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:00,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281092904] [2025-03-04 15:25:00,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:00,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:00,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:25:00,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:25:00,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:00,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:00,761 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:25:00,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:00,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281092904] [2025-03-04 15:25:00,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281092904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:00,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:00,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:00,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071871298] [2025-03-04 15:25:00,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:00,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:00,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:00,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:00,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:00,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 107 [2025-03-04 15:25:00,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 102 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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:25:00,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:00,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 107 [2025-03-04 15:25:00,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:01,807 INFO L124 PetriNetUnfolderBase]: 13773/24510 cut-off events. [2025-03-04 15:25:01,807 INFO L125 PetriNetUnfolderBase]: For 11818/12497 co-relation queries the response was YES. [2025-03-04 15:25:01,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51918 conditions, 24510 events. 13773/24510 cut-off events. For 11818/12497 co-relation queries the response was YES. Maximal size of possible extension queue 1464. Compared 229890 event pairs, 6723 based on Foata normal form. 658/22134 useless extension candidates. Maximal degree in co-relation 32396. Up to 12048 conditions per place. [2025-03-04 15:25:01,949 INFO L140 encePairwiseOnDemand]: 102/107 looper letters, 104 selfloop transitions, 4 changer transitions 0/160 dead transitions. [2025-03-04 15:25:01,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 160 transitions, 650 flow [2025-03-04 15:25:01,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 331 transitions. [2025-03-04 15:25:01,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7733644859813084 [2025-03-04 15:25:01,950 INFO L175 Difference]: Start difference. First operand has 99 places, 102 transitions, 280 flow. Second operand 4 states and 331 transitions. [2025-03-04 15:25:01,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 160 transitions, 650 flow [2025-03-04 15:25:02,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 160 transitions, 638 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:02,029 INFO L231 Difference]: Finished difference. Result has 98 places, 101 transitions, 270 flow [2025-03-04 15:25:02,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=270, PETRI_PLACES=98, PETRI_TRANSITIONS=101} [2025-03-04 15:25:02,029 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 4 predicate places. [2025-03-04 15:25:02,029 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 101 transitions, 270 flow [2025-03-04 15:25:02,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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:25:02,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:02,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:02,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:25:02,030 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:25:02,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:02,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1496172972, now seen corresponding path program 1 times [2025-03-04 15:25:02,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:02,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248869172] [2025-03-04 15:25:02,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:02,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:02,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:25:02,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:25:02,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:02,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:02,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:02,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248869172] [2025-03-04 15:25:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248869172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:02,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:02,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:02,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069736231] [2025-03-04 15:25:02,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:02,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:02,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:02,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:02,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:02,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 107 [2025-03-04 15:25:02,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 101 transitions, 270 flow. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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:25:02,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:02,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 107 [2025-03-04 15:25:02,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:03,816 INFO L124 PetriNetUnfolderBase]: 19437/33119 cut-off events. [2025-03-04 15:25:03,816 INFO L125 PetriNetUnfolderBase]: For 14483/15913 co-relation queries the response was YES. [2025-03-04 15:25:03,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69570 conditions, 33119 events. 19437/33119 cut-off events. For 14483/15913 co-relation queries the response was YES. Maximal size of possible extension queue 1826. Compared 309020 event pairs, 8124 based on Foata normal form. 1667/30027 useless extension candidates. Maximal degree in co-relation 44116. Up to 14653 conditions per place. [2025-03-04 15:25:04,043 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 108 selfloop transitions, 5 changer transitions 0/162 dead transitions. [2025-03-04 15:25:04,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 162 transitions, 704 flow [2025-03-04 15:25:04,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2025-03-04 15:25:04,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7757009345794392 [2025-03-04 15:25:04,046 INFO L175 Difference]: Start difference. First operand has 98 places, 101 transitions, 270 flow. Second operand 4 states and 332 transitions. [2025-03-04 15:25:04,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 162 transitions, 704 flow [2025-03-04 15:25:04,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 162 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:04,105 INFO L231 Difference]: Finished difference. Result has 101 places, 103 transitions, 298 flow [2025-03-04 15:25:04,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=101, PETRI_TRANSITIONS=103} [2025-03-04 15:25:04,106 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 7 predicate places. [2025-03-04 15:25:04,106 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 103 transitions, 298 flow [2025-03-04 15:25:04,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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:25:04,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:04,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:04,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:25:04,106 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:25:04,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:04,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2110867069, now seen corresponding path program 1 times [2025-03-04 15:25:04,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:04,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167046584] [2025-03-04 15:25:04,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:04,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:04,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:25:04,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:25:04,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:04,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:04,150 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:25:04,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:04,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167046584] [2025-03-04 15:25:04,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167046584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:04,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:04,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:04,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580387208] [2025-03-04 15:25:04,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:04,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:04,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:04,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:04,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:04,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 107 [2025-03-04 15:25:04,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 103 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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:25:04,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:04,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 107 [2025-03-04 15:25:04,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:05,358 INFO L124 PetriNetUnfolderBase]: 14707/27957 cut-off events. [2025-03-04 15:25:05,358 INFO L125 PetriNetUnfolderBase]: For 15438/16239 co-relation queries the response was YES. [2025-03-04 15:25:05,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59553 conditions, 27957 events. 14707/27957 cut-off events. For 15438/16239 co-relation queries the response was YES. Maximal size of possible extension queue 1608. Compared 283439 event pairs, 4768 based on Foata normal form. 974/25843 useless extension candidates. Maximal degree in co-relation 39491. Up to 10659 conditions per place. [2025-03-04 15:25:05,547 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 76 selfloop transitions, 4 changer transitions 0/132 dead transitions. [2025-03-04 15:25:05,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 132 transitions, 553 flow [2025-03-04 15:25:05,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:05,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 306 transitions. [2025-03-04 15:25:05,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7149532710280374 [2025-03-04 15:25:05,549 INFO L175 Difference]: Start difference. First operand has 101 places, 103 transitions, 298 flow. Second operand 4 states and 306 transitions. [2025-03-04 15:25:05,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 132 transitions, 553 flow [2025-03-04 15:25:05,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 132 transitions, 553 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:25:05,679 INFO L231 Difference]: Finished difference. Result has 103 places, 102 transitions, 302 flow [2025-03-04 15:25:05,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=103, PETRI_TRANSITIONS=102} [2025-03-04 15:25:05,679 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 9 predicate places. [2025-03-04 15:25:05,680 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 102 transitions, 302 flow [2025-03-04 15:25:05,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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:25:05,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:05,680 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:05,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:25:05,680 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:25:05,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:05,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1734878026, now seen corresponding path program 1 times [2025-03-04 15:25:05,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:05,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690061764] [2025-03-04 15:25:05,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:05,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:05,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:25:05,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:25:05,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:05,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:05,749 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:25:05,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:05,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690061764] [2025-03-04 15:25:05,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690061764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:05,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:05,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:25:05,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871348138] [2025-03-04 15:25:05,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:05,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:25:05,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:05,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:25:05,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:25:05,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 107 [2025-03-04 15:25:05,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 102 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 56.166666666666664) internal successors, (337), 6 states have internal predecessors, (337), 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:25:05,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:05,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 107 [2025-03-04 15:25:05,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:07,331 INFO L124 PetriNetUnfolderBase]: 19318/31755 cut-off events. [2025-03-04 15:25:07,332 INFO L125 PetriNetUnfolderBase]: For 20890/22085 co-relation queries the response was YES. [2025-03-04 15:25:07,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73468 conditions, 31755 events. 19318/31755 cut-off events. For 20890/22085 co-relation queries the response was YES. Maximal size of possible extension queue 1840. Compared 285649 event pairs, 4854 based on Foata normal form. 1599/30847 useless extension candidates. Maximal degree in co-relation 48503. Up to 8930 conditions per place. [2025-03-04 15:25:07,510 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 136 selfloop transitions, 9 changer transitions 0/195 dead transitions. [2025-03-04 15:25:07,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 195 transitions, 913 flow [2025-03-04 15:25:07,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:25:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:25:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 458 transitions. [2025-03-04 15:25:07,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7133956386292835 [2025-03-04 15:25:07,512 INFO L175 Difference]: Start difference. First operand has 103 places, 102 transitions, 302 flow. Second operand 6 states and 458 transitions. [2025-03-04 15:25:07,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 195 transitions, 913 flow [2025-03-04 15:25:07,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 195 transitions, 887 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:25:07,613 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 319 flow [2025-03-04 15:25:07,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2025-03-04 15:25:07,614 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 11 predicate places. [2025-03-04 15:25:07,614 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 319 flow [2025-03-04 15:25:07,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.166666666666664) internal successors, (337), 6 states have internal predecessors, (337), 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:25:07,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:07,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:07,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:25:07,615 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:25:07,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:07,615 INFO L85 PathProgramCache]: Analyzing trace with hash 863278809, now seen corresponding path program 1 times [2025-03-04 15:25:07,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:07,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449189728] [2025-03-04 15:25:07,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:07,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:07,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:25:07,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:25:07,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:07,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:07,661 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:25:07,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:07,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449189728] [2025-03-04 15:25:07,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449189728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:07,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:07,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:07,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872876447] [2025-03-04 15:25:07,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:07,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:07,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:07,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:07,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:07,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 107 [2025-03-04 15:25:07,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 319 flow. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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:25:07,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:07,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 107 [2025-03-04 15:25:07,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:08,872 INFO L124 PetriNetUnfolderBase]: 14931/28166 cut-off events. [2025-03-04 15:25:08,872 INFO L125 PetriNetUnfolderBase]: For 25276/26766 co-relation queries the response was YES. [2025-03-04 15:25:08,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63557 conditions, 28166 events. 14931/28166 cut-off events. For 25276/26766 co-relation queries the response was YES. Maximal size of possible extension queue 1554. Compared 283551 event pairs, 5190 based on Foata normal form. 1293/26429 useless extension candidates. Maximal degree in co-relation 40736. Up to 9662 conditions per place. [2025-03-04 15:25:09,078 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 76 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2025-03-04 15:25:09,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 131 transitions, 592 flow [2025-03-04 15:25:09,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 309 transitions. [2025-03-04 15:25:09,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7219626168224299 [2025-03-04 15:25:09,080 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 319 flow. Second operand 4 states and 309 transitions. [2025-03-04 15:25:09,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 131 transitions, 592 flow [2025-03-04 15:25:09,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 131 transitions, 570 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:09,273 INFO L231 Difference]: Finished difference. Result has 103 places, 101 transitions, 312 flow [2025-03-04 15:25:09,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=103, PETRI_TRANSITIONS=101} [2025-03-04 15:25:09,274 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 9 predicate places. [2025-03-04 15:25:09,274 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 101 transitions, 312 flow [2025-03-04 15:25:09,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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:25:09,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:09,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:09,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:25:09,274 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:25:09,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:09,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1012369367, now seen corresponding path program 1 times [2025-03-04 15:25:09,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:09,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777862910] [2025-03-04 15:25:09,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:09,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:09,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:25:09,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:25:09,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:09,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:09,328 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:25:09,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:09,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777862910] [2025-03-04 15:25:09,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777862910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:09,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:09,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:09,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194402837] [2025-03-04 15:25:09,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:09,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:09,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:09,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:09,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:09,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 107 [2025-03-04 15:25:09,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 101 transitions, 312 flow. Second operand has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 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:25:09,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:09,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 107 [2025-03-04 15:25:09,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:10,751 INFO L124 PetriNetUnfolderBase]: 19838/32292 cut-off events. [2025-03-04 15:25:10,751 INFO L125 PetriNetUnfolderBase]: For 25105/27521 co-relation queries the response was YES. [2025-03-04 15:25:10,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77254 conditions, 32292 events. 19838/32292 cut-off events. For 25105/27521 co-relation queries the response was YES. Maximal size of possible extension queue 1880. Compared 286370 event pairs, 4725 based on Foata normal form. 1724/31780 useless extension candidates. Maximal degree in co-relation 50603. Up to 13067 conditions per place. [2025-03-04 15:25:11,008 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 109 selfloop transitions, 6 changer transitions 0/162 dead transitions. [2025-03-04 15:25:11,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 162 transitions, 770 flow [2025-03-04 15:25:11,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:25:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:25:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2025-03-04 15:25:11,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7289719626168224 [2025-03-04 15:25:11,009 INFO L175 Difference]: Start difference. First operand has 103 places, 101 transitions, 312 flow. Second operand 5 states and 390 transitions. [2025-03-04 15:25:11,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 162 transitions, 770 flow [2025-03-04 15:25:11,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 162 transitions, 750 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:25:11,176 INFO L231 Difference]: Finished difference. Result has 103 places, 100 transitions, 314 flow [2025-03-04 15:25:11,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=314, PETRI_PLACES=103, PETRI_TRANSITIONS=100} [2025-03-04 15:25:11,176 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 9 predicate places. [2025-03-04 15:25:11,176 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 100 transitions, 314 flow [2025-03-04 15:25:11,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 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:25:11,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:11,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:11,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:25:11,177 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:25:11,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:11,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1012370360, now seen corresponding path program 1 times [2025-03-04 15:25:11,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:11,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145965462] [2025-03-04 15:25:11,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:11,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:11,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:25:11,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:25:11,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:11,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:11,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:11,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145965462] [2025-03-04 15:25:11,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145965462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:11,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:11,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:11,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684997048] [2025-03-04 15:25:11,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:11,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:11,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:11,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:11,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:11,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 107 [2025-03-04 15:25:11,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 314 flow. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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:25:11,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:11,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 107 [2025-03-04 15:25:11,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:12,523 INFO L124 PetriNetUnfolderBase]: 16371/29509 cut-off events. [2025-03-04 15:25:12,523 INFO L125 PetriNetUnfolderBase]: For 24402/26174 co-relation queries the response was YES. [2025-03-04 15:25:12,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68154 conditions, 29509 events. 16371/29509 cut-off events. For 24402/26174 co-relation queries the response was YES. Maximal size of possible extension queue 1688. Compared 286274 event pairs, 8142 based on Foata normal form. 1720/28450 useless extension candidates. Maximal degree in co-relation 44971. Up to 14288 conditions per place. [2025-03-04 15:25:12,734 INFO L140 encePairwiseOnDemand]: 102/107 looper letters, 111 selfloop transitions, 4 changer transitions 0/162 dead transitions. [2025-03-04 15:25:12,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 162 transitions, 758 flow [2025-03-04 15:25:12,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 329 transitions. [2025-03-04 15:25:12,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7686915887850467 [2025-03-04 15:25:12,735 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 314 flow. Second operand 4 states and 329 transitions. [2025-03-04 15:25:12,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 162 transitions, 758 flow [2025-03-04 15:25:12,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 162 transitions, 746 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:12,876 INFO L231 Difference]: Finished difference. Result has 102 places, 99 transitions, 304 flow [2025-03-04 15:25:12,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=102, PETRI_TRANSITIONS=99} [2025-03-04 15:25:12,877 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 8 predicate places. [2025-03-04 15:25:12,877 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 99 transitions, 304 flow [2025-03-04 15:25:12,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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:25:12,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:12,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:12,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:25:12,877 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:25:12,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:12,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1134666475, now seen corresponding path program 1 times [2025-03-04 15:25:12,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:12,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593261628] [2025-03-04 15:25:12,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:12,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:12,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:25:12,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:25:12,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:12,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:12,908 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:25:12,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:12,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593261628] [2025-03-04 15:25:12,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593261628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:12,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:12,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:12,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046322953] [2025-03-04 15:25:12,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:12,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:12,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:12,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:12,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:12,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 107 [2025-03-04 15:25:12,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 99 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 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:25:12,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:12,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 107 [2025-03-04 15:25:12,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:14,355 INFO L124 PetriNetUnfolderBase]: 19326/32080 cut-off events. [2025-03-04 15:25:14,355 INFO L125 PetriNetUnfolderBase]: For 24577/25908 co-relation queries the response was YES. [2025-03-04 15:25:14,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74885 conditions, 32080 events. 19326/32080 cut-off events. For 24577/25908 co-relation queries the response was YES. Maximal size of possible extension queue 1756. Compared 291072 event pairs, 8135 based on Foata normal form. 1493/30743 useless extension candidates. Maximal degree in co-relation 49232. Up to 14651 conditions per place. [2025-03-04 15:25:14,552 INFO L140 encePairwiseOnDemand]: 102/107 looper letters, 109 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2025-03-04 15:25:14,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 161 transitions, 743 flow [2025-03-04 15:25:14,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:14,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 329 transitions. [2025-03-04 15:25:14,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7686915887850467 [2025-03-04 15:25:14,555 INFO L175 Difference]: Start difference. First operand has 102 places, 99 transitions, 304 flow. Second operand 4 states and 329 transitions. [2025-03-04 15:25:14,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 161 transitions, 743 flow [2025-03-04 15:25:14,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 161 transitions, 724 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:25:14,612 INFO L231 Difference]: Finished difference. Result has 102 places, 99 transitions, 308 flow [2025-03-04 15:25:14,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=102, PETRI_TRANSITIONS=99} [2025-03-04 15:25:14,613 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 8 predicate places. [2025-03-04 15:25:14,613 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 99 transitions, 308 flow [2025-03-04 15:25:14,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 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:25:14,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:14,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:14,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:25:14,614 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:25:14,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:14,614 INFO L85 PathProgramCache]: Analyzing trace with hash 991809240, now seen corresponding path program 1 times [2025-03-04 15:25:14,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:14,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433898200] [2025-03-04 15:25:14,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:14,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:25:14,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:25:14,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:14,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:14,648 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:25:14,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:14,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433898200] [2025-03-04 15:25:14,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433898200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:14,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:14,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:14,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829159275] [2025-03-04 15:25:14,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:14,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:14,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:14,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:14,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:14,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 107 [2025-03-04 15:25:14,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 99 transitions, 308 flow. Second operand has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 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:25:14,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:14,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 107 [2025-03-04 15:25:14,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:16,163 INFO L124 PetriNetUnfolderBase]: 15954/29423 cut-off events. [2025-03-04 15:25:16,163 INFO L125 PetriNetUnfolderBase]: For 26837/28158 co-relation queries the response was YES. [2025-03-04 15:25:16,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67073 conditions, 29423 events. 15954/29423 cut-off events. For 26837/28158 co-relation queries the response was YES. Maximal size of possible extension queue 1587. Compared 290646 event pairs, 5593 based on Foata normal form. 1699/28062 useless extension candidates. Maximal degree in co-relation 54606. Up to 10731 conditions per place. [2025-03-04 15:25:16,358 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 79 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2025-03-04 15:25:16,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 129 transitions, 589 flow [2025-03-04 15:25:16,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 305 transitions. [2025-03-04 15:25:16,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7126168224299065 [2025-03-04 15:25:16,359 INFO L175 Difference]: Start difference. First operand has 102 places, 99 transitions, 308 flow. Second operand 4 states and 305 transitions. [2025-03-04 15:25:16,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 129 transitions, 589 flow [2025-03-04 15:25:16,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 129 transitions, 581 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:16,494 INFO L231 Difference]: Finished difference. Result has 103 places, 98 transitions, 308 flow [2025-03-04 15:25:16,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=103, PETRI_TRANSITIONS=98} [2025-03-04 15:25:16,494 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 9 predicate places. [2025-03-04 15:25:16,494 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 98 transitions, 308 flow [2025-03-04 15:25:16,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 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:25:16,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:16,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:16,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:25:16,495 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:25:16,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:16,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1318679968, now seen corresponding path program 1 times [2025-03-04 15:25:16,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:16,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575980925] [2025-03-04 15:25:16,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:16,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:16,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:25:16,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:25:16,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:16,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:16,564 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:25:16,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:16,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575980925] [2025-03-04 15:25:16,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575980925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:16,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:16,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:25:16,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512535775] [2025-03-04 15:25:16,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:16,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:25:16,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:16,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:25:16,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:25:16,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 107 [2025-03-04 15:25:16,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 98 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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:25:16,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:16,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 107 [2025-03-04 15:25:16,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:18,555 INFO L124 PetriNetUnfolderBase]: 20833/33608 cut-off events. [2025-03-04 15:25:18,555 INFO L125 PetriNetUnfolderBase]: For 32216/33987 co-relation queries the response was YES. [2025-03-04 15:25:18,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82286 conditions, 33608 events. 20833/33608 cut-off events. For 32216/33987 co-relation queries the response was YES. Maximal size of possible extension queue 1902. Compared 295907 event pairs, 5085 based on Foata normal form. 2581/33782 useless extension candidates. Maximal degree in co-relation 66920. Up to 9331 conditions per place. [2025-03-04 15:25:18,815 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 141 selfloop transitions, 9 changer transitions 0/194 dead transitions. [2025-03-04 15:25:18,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 194 transitions, 980 flow [2025-03-04 15:25:18,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:25:18,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:25:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 455 transitions. [2025-03-04 15:25:18,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7087227414330218 [2025-03-04 15:25:18,817 INFO L175 Difference]: Start difference. First operand has 103 places, 98 transitions, 308 flow. Second operand 6 states and 455 transitions. [2025-03-04 15:25:18,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 194 transitions, 980 flow [2025-03-04 15:25:18,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 194 transitions, 954 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:25:18,964 INFO L231 Difference]: Finished difference. Result has 105 places, 98 transitions, 325 flow [2025-03-04 15:25:18,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=325, PETRI_PLACES=105, PETRI_TRANSITIONS=98} [2025-03-04 15:25:18,965 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 11 predicate places. [2025-03-04 15:25:18,965 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 98 transitions, 325 flow [2025-03-04 15:25:18,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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:25:18,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:18,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:18,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:25:18,965 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:25:18,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:18,966 INFO L85 PathProgramCache]: Analyzing trace with hash 681316060, now seen corresponding path program 1 times [2025-03-04 15:25:18,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:18,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775517507] [2025-03-04 15:25:18,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:18,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:18,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:25:18,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:25:18,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:18,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:18,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:18,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775517507] [2025-03-04 15:25:18,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775517507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:18,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:18,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:18,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487677206] [2025-03-04 15:25:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:18,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:18,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:18,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:18,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:19,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 107 [2025-03-04 15:25:19,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 98 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 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:25:19,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:19,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 107 [2025-03-04 15:25:19,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:20,372 INFO L124 PetriNetUnfolderBase]: 17693/31228 cut-off events. [2025-03-04 15:25:20,372 INFO L125 PetriNetUnfolderBase]: For 37620/40026 co-relation queries the response was YES. [2025-03-04 15:25:20,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76013 conditions, 31228 events. 17693/31228 cut-off events. For 37620/40026 co-relation queries the response was YES. Maximal size of possible extension queue 1724. Compared 299545 event pairs, 9143 based on Foata normal form. 2581/30945 useless extension candidates. Maximal degree in co-relation 62130. Up to 15891 conditions per place. [2025-03-04 15:25:20,601 INFO L140 encePairwiseOnDemand]: 102/107 looper letters, 115 selfloop transitions, 4 changer transitions 0/162 dead transitions. [2025-03-04 15:25:20,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 162 transitions, 827 flow [2025-03-04 15:25:20,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:20,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 327 transitions. [2025-03-04 15:25:20,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.764018691588785 [2025-03-04 15:25:20,603 INFO L175 Difference]: Start difference. First operand has 105 places, 98 transitions, 325 flow. Second operand 4 states and 327 transitions. [2025-03-04 15:25:20,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 162 transitions, 827 flow [2025-03-04 15:25:20,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 162 transitions, 793 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:25:20,732 INFO L231 Difference]: Finished difference. Result has 103 places, 97 transitions, 311 flow [2025-03-04 15:25:20,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=311, PETRI_PLACES=103, PETRI_TRANSITIONS=97} [2025-03-04 15:25:20,732 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 9 predicate places. [2025-03-04 15:25:20,732 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 97 transitions, 311 flow [2025-03-04 15:25:20,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 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:25:20,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:20,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:20,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:25:20,733 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:25:20,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:20,733 INFO L85 PathProgramCache]: Analyzing trace with hash 681315067, now seen corresponding path program 1 times [2025-03-04 15:25:20,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:20,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037953804] [2025-03-04 15:25:20,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:20,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:20,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:25:20,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:25:20,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:20,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:20,785 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:25:20,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:20,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037953804] [2025-03-04 15:25:20,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037953804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:20,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:20,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:20,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188491765] [2025-03-04 15:25:20,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:20,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:20,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:20,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:20,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:20,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 107 [2025-03-04 15:25:20,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 97 transitions, 311 flow. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 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:25:20,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:20,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 107 [2025-03-04 15:25:20,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:22,365 INFO L124 PetriNetUnfolderBase]: 20834/33364 cut-off events. [2025-03-04 15:25:22,366 INFO L125 PetriNetUnfolderBase]: For 31852/34947 co-relation queries the response was YES. [2025-03-04 15:25:22,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83218 conditions, 33364 events. 20834/33364 cut-off events. For 31852/34947 co-relation queries the response was YES. Maximal size of possible extension queue 1848. Compared 290014 event pairs, 5615 based on Foata normal form. 2747/34005 useless extension candidates. Maximal degree in co-relation 67813. Up to 13203 conditions per place. [2025-03-04 15:25:22,852 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 113 selfloop transitions, 6 changer transitions 0/160 dead transitions. [2025-03-04 15:25:22,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 160 transitions, 797 flow [2025-03-04 15:25:22,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:25:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:25:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2025-03-04 15:25:22,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7252336448598131 [2025-03-04 15:25:22,853 INFO L175 Difference]: Start difference. First operand has 103 places, 97 transitions, 311 flow. Second operand 5 states and 388 transitions. [2025-03-04 15:25:22,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 160 transitions, 797 flow [2025-03-04 15:25:22,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 160 transitions, 791 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:22,962 INFO L231 Difference]: Finished difference. Result has 104 places, 96 transitions, 315 flow [2025-03-04 15:25:22,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=315, PETRI_PLACES=104, PETRI_TRANSITIONS=96} [2025-03-04 15:25:22,962 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 10 predicate places. [2025-03-04 15:25:22,962 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 96 transitions, 315 flow [2025-03-04 15:25:22,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 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:25:22,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:22,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:22,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:25:22,963 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:25:22,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:22,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1151904354, now seen corresponding path program 1 times [2025-03-04 15:25:22,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:22,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569082652] [2025-03-04 15:25:22,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:22,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:22,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:25:22,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:25:22,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:22,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:23,015 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:25:23,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:23,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569082652] [2025-03-04 15:25:23,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569082652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:23,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:23,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:25:23,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089260716] [2025-03-04 15:25:23,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:23,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:23,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:23,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:23,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:23,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 107 [2025-03-04 15:25:23,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 96 transitions, 315 flow. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 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:25:23,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:23,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 107 [2025-03-04 15:25:23,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:24,513 INFO L124 PetriNetUnfolderBase]: 20765/32942 cut-off events. [2025-03-04 15:25:24,513 INFO L125 PetriNetUnfolderBase]: For 33968/35680 co-relation queries the response was YES. [2025-03-04 15:25:24,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83685 conditions, 32942 events. 20765/32942 cut-off events. For 33968/35680 co-relation queries the response was YES. Maximal size of possible extension queue 1825. Compared 281739 event pairs, 8769 based on Foata normal form. 2117/32983 useless extension candidates. Maximal degree in co-relation 68043. Up to 15735 conditions per place. [2025-03-04 15:25:24,780 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 177 selfloop transitions, 8 changer transitions 0/225 dead transitions. [2025-03-04 15:25:24,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 225 transitions, 1183 flow [2025-03-04 15:25:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:25:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:25:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 486 transitions. [2025-03-04 15:25:24,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7570093457943925 [2025-03-04 15:25:24,781 INFO L175 Difference]: Start difference. First operand has 104 places, 96 transitions, 315 flow. Second operand 6 states and 486 transitions. [2025-03-04 15:25:24,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 225 transitions, 1183 flow [2025-03-04 15:25:25,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 225 transitions, 1145 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:25,192 INFO L231 Difference]: Finished difference. Result has 106 places, 97 transitions, 330 flow [2025-03-04 15:25:25,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=106, PETRI_TRANSITIONS=97} [2025-03-04 15:25:25,192 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 12 predicate places. [2025-03-04 15:25:25,192 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 97 transitions, 330 flow [2025-03-04 15:25:25,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 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:25:25,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:25,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:25,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:25:25,192 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:25:25,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash -354068709, now seen corresponding path program 1 times [2025-03-04 15:25:25,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:25,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360086546] [2025-03-04 15:25:25,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:25,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:25,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:25:25,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:25:25,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:25,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:25,252 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:25:25,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:25,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360086546] [2025-03-04 15:25:25,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360086546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:25,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:25,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:25:25,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053090103] [2025-03-04 15:25:25,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:25,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:25:25,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:25,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:25:25,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:25:25,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 107 [2025-03-04 15:25:25,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 97 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 56.833333333333336) internal successors, (341), 6 states have internal predecessors, (341), 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:25:25,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:25,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 107 [2025-03-04 15:25:25,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:26,807 INFO L124 PetriNetUnfolderBase]: 20834/32422 cut-off events. [2025-03-04 15:25:26,807 INFO L125 PetriNetUnfolderBase]: For 47995/50728 co-relation queries the response was YES. [2025-03-04 15:25:26,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84673 conditions, 32422 events. 20834/32422 cut-off events. For 47995/50728 co-relation queries the response was YES. Maximal size of possible extension queue 1764. Compared 270978 event pairs, 5615 based on Foata normal form. 3489/33791 useless extension candidates. Maximal degree in co-relation 69019. Up to 10190 conditions per place. [2025-03-04 15:25:27,016 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 146 selfloop transitions, 9 changer transitions 0/196 dead transitions. [2025-03-04 15:25:27,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 196 transitions, 1066 flow [2025-03-04 15:25:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:25:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:25:27,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 452 transitions. [2025-03-04 15:25:27,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7040498442367601 [2025-03-04 15:25:27,018 INFO L175 Difference]: Start difference. First operand has 106 places, 97 transitions, 330 flow. Second operand 6 states and 452 transitions. [2025-03-04 15:25:27,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 196 transitions, 1066 flow [2025-03-04 15:25:27,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 196 transitions, 1014 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:27,140 INFO L231 Difference]: Finished difference. Result has 107 places, 97 transitions, 339 flow [2025-03-04 15:25:27,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=339, PETRI_PLACES=107, PETRI_TRANSITIONS=97} [2025-03-04 15:25:27,140 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 13 predicate places. [2025-03-04 15:25:27,140 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 97 transitions, 339 flow [2025-03-04 15:25:27,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.833333333333336) internal successors, (341), 6 states have internal predecessors, (341), 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:25:27,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:27,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:27,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:25:27,141 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:25:27,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:27,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1467505758, now seen corresponding path program 1 times [2025-03-04 15:25:27,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:27,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045626521] [2025-03-04 15:25:27,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:27,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:27,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:25:27,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:25:27,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:27,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:27,183 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:25:27,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:27,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045626521] [2025-03-04 15:25:27,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045626521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:27,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:27,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:25:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053399893] [2025-03-04 15:25:27,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:27,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:27,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:27,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:27,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 107 [2025-03-04 15:25:27,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 97 transitions, 339 flow. Second operand has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 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:25:27,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:27,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 107 [2025-03-04 15:25:27,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:28,724 INFO L124 PetriNetUnfolderBase]: 20834/31454 cut-off events. [2025-03-04 15:25:28,724 INFO L125 PetriNetUnfolderBase]: For 42281/44909 co-relation queries the response was YES. [2025-03-04 15:25:28,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85020 conditions, 31454 events. 20834/31454 cut-off events. For 42281/44909 co-relation queries the response was YES. Maximal size of possible extension queue 1764. Compared 252938 event pairs, 9143 based on Foata normal form. 3006/33036 useless extension candidates. Maximal degree in co-relation 69256. Up to 16269 conditions per place. [2025-03-04 15:25:28,870 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 0 selfloop transitions, 0 changer transitions 230/230 dead transitions. [2025-03-04 15:25:28,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 230 transitions, 1243 flow [2025-03-04 15:25:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:25:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:25:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 482 transitions. [2025-03-04 15:25:28,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7507788161993769 [2025-03-04 15:25:28,872 INFO L175 Difference]: Start difference. First operand has 107 places, 97 transitions, 339 flow. Second operand 6 states and 482 transitions. [2025-03-04 15:25:28,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 230 transitions, 1243 flow [2025-03-04 15:25:29,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 230 transitions, 1225 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 15:25:29,181 INFO L231 Difference]: Finished difference. Result has 106 places, 0 transitions, 0 flow [2025-03-04 15:25:29,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=106, PETRI_TRANSITIONS=0} [2025-03-04 15:25:29,181 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 12 predicate places. [2025-03-04 15:25:29,181 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 0 transitions, 0 flow [2025-03-04 15:25:29,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 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:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 39 remaining) [2025-03-04 15:25:29,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 39 remaining) [2025-03-04 15:25:29,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 39 remaining) [2025-03-04 15:25:29,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 39 remaining) [2025-03-04 15:25:29,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 39 remaining) [2025-03-04 15:25:29,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 39 remaining) [2025-03-04 15:25:29,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 39 remaining) [2025-03-04 15:25:29,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 39 remaining) [2025-03-04 15:25:29,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 39 remaining) [2025-03-04 15:25:29,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 39 remaining) [2025-03-04 15:25:29,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 39 remaining) [2025-03-04 15:25:29,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 39 remaining) [2025-03-04 15:25:29,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 39 remaining) [2025-03-04 15:25:29,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 39 remaining) [2025-03-04 15:25:29,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 39 remaining) [2025-03-04 15:25:29,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 39 remaining) [2025-03-04 15:25:29,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:25:29,186 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:29,189 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:25:29,190 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:25:29,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:25:29 BasicIcfg [2025-03-04 15:25:29,194 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:25:29,194 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:25:29,195 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:25:29,195 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:25:29,195 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:24:50" (3/4) ... [2025-03-04 15:25:29,197 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:25:29,198 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:25:29,198 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:25:29,198 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 15:25:29,202 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2025-03-04 15:25:29,203 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-03-04 15:25:29,203 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-04 15:25:29,203 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 15:25:29,267 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:25:29,268 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:25:29,268 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:25:29,269 INFO L158 Benchmark]: Toolchain (without parser) took 39653.88ms. Allocated memory was 167.8MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 122.6MB in the beginning and 1.1GB in the end (delta: -983.0MB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2025-03-04 15:25:29,269 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:25:29,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.95ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 110.9MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:25:29,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.08ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:25:29,270 INFO L158 Benchmark]: Boogie Preprocessor took 30.37ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:25:29,271 INFO L158 Benchmark]: IcfgBuilder took 654.56ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 55.2MB in the end (delta: 52.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 15:25:29,271 INFO L158 Benchmark]: TraceAbstraction took 38702.90ms. Allocated memory was 167.8MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 55.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2025-03-04 15:25:29,271 INFO L158 Benchmark]: Witness Printer took 73.25ms. Allocated memory is still 3.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:25:29,273 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.19ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.95ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 110.9MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.08ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.37ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 654.56ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 55.2MB in the end (delta: 52.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 38702.90ms. Allocated memory was 167.8MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 55.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 73.25ms. Allocated memory is still 3.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: 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 7 procedures, 171 locations, 39 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: 38.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 37.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2296 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2016 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4522 IncrementalHoareTripleChecker+Invalid, 4629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 54 mSDtfsCounter, 4522 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=339occurred in iteration=20, InterpolantAutomatonStates: 97, 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.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 845 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:25:29,286 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