./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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/parallel-ticket-2.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 9c046e6043edd4a9981865f273deb13bc96b2518d014dd6435bf0abb656de540 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:40:27,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:40:27,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:40:27,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:40:27,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:40:27,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:40:27,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:40:27,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:40:27,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:40:27,908 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:40:27,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:40:27,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:40:27,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:40:27,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:40:27,908 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:40:27,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:40:27,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:40:27,908 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:40:27,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:40:27,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:40:27,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:40:27,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:40:27,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:40:27,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:40:27,910 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:40:27,910 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:40:27,910 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:40:27,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:40:27,910 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:40:27,910 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:40:27,911 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:40:27,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:40:27,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:40:27,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:40:27,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:40:27,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:40:27,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:40:27,911 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:40:27,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:40:27,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:40:27,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:40:27,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:40:27,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:40:27,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:40:27,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:40:27,912 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 -> 9c046e6043edd4a9981865f273deb13bc96b2518d014dd6435bf0abb656de540 [2025-03-09 06:40:28,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:40:28,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:40:28,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:40:28,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:40:28,107 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:40:28,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-2.wvr.c [2025-03-09 06:40:29,252 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/107754693/b29e29c212c646b985995325ab2bc0b4/FLAGbdd4ac15d [2025-03-09 06:40:29,490 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:40:29,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-2.wvr.c [2025-03-09 06:40:29,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/107754693/b29e29c212c646b985995325ab2bc0b4/FLAGbdd4ac15d [2025-03-09 06:40:29,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/107754693/b29e29c212c646b985995325ab2bc0b4 [2025-03-09 06:40:29,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:40:29,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:40:29,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:40:29,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:40:29,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:40:29,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:40:29" (1/1) ... [2025-03-09 06:40:29,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ffb799d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:29, skipping insertion in model container [2025-03-09 06:40:29,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:40:29" (1/1) ... [2025-03-09 06:40:29,541 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:40:29,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:40:29,662 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:40:29,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:40:29,682 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:40:29,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:29 WrapperNode [2025-03-09 06:40:29,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:40:29,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:40:29,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:40:29,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:40:29,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:29" (1/1) ... [2025-03-09 06:40:29,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:29" (1/1) ... [2025-03-09 06:40:29,706 INFO L138 Inliner]: procedures = 18, calls = 13, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 118 [2025-03-09 06:40:29,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:40:29,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:40:29,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:40:29,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:40:29,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:29" (1/1) ... [2025-03-09 06:40:29,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:29" (1/1) ... [2025-03-09 06:40:29,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:29" (1/1) ... [2025-03-09 06:40:29,721 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-09 06:40:29,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:29" (1/1) ... [2025-03-09 06:40:29,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:29" (1/1) ... [2025-03-09 06:40:29,724 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:29" (1/1) ... [2025-03-09 06:40:29,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:29" (1/1) ... [2025-03-09 06:40:29,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:29" (1/1) ... [2025-03-09 06:40:29,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:29" (1/1) ... [2025-03-09 06:40:29,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:40:29,727 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:40:29,727 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:40:29,727 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:40:29,728 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:29" (1/1) ... [2025-03-09 06:40:29,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:40:29,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:40:29,750 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-09 06:40:29,752 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-09 06:40:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:40:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 06:40:29,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 06:40:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 06:40:29,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 06:40:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:40:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:40:29,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:40:29,770 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:40:29,830 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:40:29,832 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:40:29,996 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:40:29,997 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:40:30,113 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:40:30,114 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:40:30,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:40:30 BoogieIcfgContainer [2025-03-09 06:40:30,115 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:40:30,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:40:30,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:40:30,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:40:30,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:40:29" (1/3) ... [2025-03-09 06:40:30,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c88e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:40:30, skipping insertion in model container [2025-03-09 06:40:30,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:29" (2/3) ... [2025-03-09 06:40:30,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c88e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:40:30, skipping insertion in model container [2025-03-09 06:40:30,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:40:30" (3/3) ... [2025-03-09 06:40:30,124 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-2.wvr.c [2025-03-09 06:40:30,133 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:40:30,135 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-2.wvr.c that has 3 procedures, 41 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-09 06:40:30,135 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:40:30,174 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 06:40:30,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 96 flow [2025-03-09 06:40:30,224 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2025-03-09 06:40:30,229 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 06:40:30,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 39 events. 1/39 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-03-09 06:40:30,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 41 transitions, 96 flow [2025-03-09 06:40:30,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 37 transitions, 83 flow [2025-03-09 06:40:30,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:40:30,247 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;@593f960c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:40:30,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-09 06:40:30,254 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:40:30,255 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-09 06:40:30,256 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:40:30,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:30,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:40:30,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 06:40:30,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:30,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1259097696, now seen corresponding path program 1 times [2025-03-09 06:40:30,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:30,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49691748] [2025-03-09 06:40:30,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:30,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:30,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:40:30,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:40:30,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:30,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:30,486 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-09 06:40:30,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:30,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49691748] [2025-03-09 06:40:30,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49691748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:40:30,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:40:30,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:40:30,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010996967] [2025-03-09 06:40:30,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:40:30,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:40:30,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:30,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:40:30,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:40:30,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2025-03-09 06:40:30,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:30,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:30,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2025-03-09 06:40:30,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:30,674 INFO L124 PetriNetUnfolderBase]: 287/519 cut-off events. [2025-03-09 06:40:30,675 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-09 06:40:30,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 519 events. 287/519 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2308 event pairs, 244 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 974. Up to 490 conditions per place. [2025-03-09 06:40:30,684 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 28 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2025-03-09 06:40:30,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 141 flow [2025-03-09 06:40:30,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:40:30,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:40:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-03-09 06:40:30,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2025-03-09 06:40:30,695 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 83 flow. Second operand 3 states and 51 transitions. [2025-03-09 06:40:30,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 141 flow [2025-03-09 06:40:30,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 136 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:40:30,701 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 80 flow [2025-03-09 06:40:30,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2025-03-09 06:40:30,706 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2025-03-09 06:40:30,706 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 80 flow [2025-03-09 06:40:30,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:30,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:30,707 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:40:30,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:40:30,707 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 06:40:30,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:30,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1259097695, now seen corresponding path program 1 times [2025-03-09 06:40:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:30,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347650630] [2025-03-09 06:40:30,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:30,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:30,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:40:30,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:40:30,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:30,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:30,793 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-09 06:40:30,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:30,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347650630] [2025-03-09 06:40:30,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347650630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:40:30,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:40:30,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:40:30,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114051976] [2025-03-09 06:40:30,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:40:30,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:40:30,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:30,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:40:30,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:40:30,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2025-03-09 06:40:30,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:30,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:30,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2025-03-09 06:40:30,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:30,908 INFO L124 PetriNetUnfolderBase]: 281/501 cut-off events. [2025-03-09 06:40:30,908 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:40:30,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 501 events. 281/501 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2179 event pairs, 124 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 985. Up to 476 conditions per place. [2025-03-09 06:40:30,915 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 31 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2025-03-09 06:40:30,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 164 flow [2025-03-09 06:40:30,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:40:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:40:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-09 06:40:30,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45528455284552843 [2025-03-09 06:40:30,917 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 80 flow. Second operand 3 states and 56 transitions. [2025-03-09 06:40:30,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 164 flow [2025-03-09 06:40:30,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:40:30,919 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 101 flow [2025-03-09 06:40:30,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-03-09 06:40:30,921 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-03-09 06:40:30,921 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 101 flow [2025-03-09 06:40:30,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:30,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:30,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:40:30,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:40:30,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 06:40:30,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:30,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1038397892, now seen corresponding path program 1 times [2025-03-09 06:40:30,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:30,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115309368] [2025-03-09 06:40:30,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:30,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:30,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:40:30,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:40:30,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:30,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:31,017 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-09 06:40:31,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:31,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115309368] [2025-03-09 06:40:31,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115309368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:40:31,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:40:31,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:40:31,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285845338] [2025-03-09 06:40:31,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:40:31,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:40:31,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:31,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:40:31,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:40:31,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2025-03-09 06:40:31,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:31,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:31,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2025-03-09 06:40:31,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:31,112 INFO L124 PetriNetUnfolderBase]: 199/399 cut-off events. [2025-03-09 06:40:31,113 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-09 06:40:31,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 399 events. 199/399 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1598 event pairs, 0 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 707. Up to 275 conditions per place. [2025-03-09 06:40:31,117 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 42 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2025-03-09 06:40:31,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 230 flow [2025-03-09 06:40:31,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:40:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:40:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-03-09 06:40:31,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4573170731707317 [2025-03-09 06:40:31,120 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 101 flow. Second operand 4 states and 75 transitions. [2025-03-09 06:40:31,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 230 flow [2025-03-09 06:40:31,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:40:31,121 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 102 flow [2025-03-09 06:40:31,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2025-03-09 06:40:31,121 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-03-09 06:40:31,121 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 102 flow [2025-03-09 06:40:31,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:31,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:31,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:40:31,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:40:31,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 06:40:31,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash -886220572, now seen corresponding path program 1 times [2025-03-09 06:40:31,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:31,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322988662] [2025-03-09 06:40:31,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:31,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:31,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:40:31,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:40:31,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:31,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:31,182 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-09 06:40:31,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:31,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322988662] [2025-03-09 06:40:31,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322988662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:40:31,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:40:31,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:40:31,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677849359] [2025-03-09 06:40:31,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:40:31,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:40:31,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:31,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:40:31,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:40:31,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2025-03-09 06:40:31,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-09 06:40:31,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:31,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2025-03-09 06:40:31,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:31,242 INFO L124 PetriNetUnfolderBase]: 173/328 cut-off events. [2025-03-09 06:40:31,243 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2025-03-09 06:40:31,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 328 events. 173/328 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1247 event pairs, 137 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 521. Up to 302 conditions per place. [2025-03-09 06:40:31,244 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 26 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-03-09 06:40:31,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 156 flow [2025-03-09 06:40:31,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:40:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:40:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-03-09 06:40:31,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2025-03-09 06:40:31,245 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 102 flow. Second operand 3 states and 47 transitions. [2025-03-09 06:40:31,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 156 flow [2025-03-09 06:40:31,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 137 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-09 06:40:31,246 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 85 flow [2025-03-09 06:40:31,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-03-09 06:40:31,247 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2025-03-09 06:40:31,247 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 85 flow [2025-03-09 06:40:31,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-09 06:40:31,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:31,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:40:31,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:40:31,248 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 06:40:31,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:31,248 INFO L85 PathProgramCache]: Analyzing trace with hash -886220571, now seen corresponding path program 1 times [2025-03-09 06:40:31,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:31,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657979300] [2025-03-09 06:40:31,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:31,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:31,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:40:31,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:40:31,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:31,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:31,302 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-09 06:40:31,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:31,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657979300] [2025-03-09 06:40:31,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657979300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:40:31,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:40:31,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:40:31,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032909658] [2025-03-09 06:40:31,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:40:31,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:40:31,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:31,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:40:31,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:40:31,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2025-03-09 06:40:31,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-09 06:40:31,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:31,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2025-03-09 06:40:31,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:31,373 INFO L124 PetriNetUnfolderBase]: 135/268 cut-off events. [2025-03-09 06:40:31,375 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-09 06:40:31,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 268 events. 135/268 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 934 event pairs, 46 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 520. Up to 159 conditions per place. [2025-03-09 06:40:31,377 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 34 selfloop transitions, 5 changer transitions 2/45 dead transitions. [2025-03-09 06:40:31,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 195 flow [2025-03-09 06:40:31,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:40:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:40:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-03-09 06:40:31,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4796747967479675 [2025-03-09 06:40:31,379 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 85 flow. Second operand 3 states and 59 transitions. [2025-03-09 06:40:31,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 195 flow [2025-03-09 06:40:31,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:40:31,381 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 98 flow [2025-03-09 06:40:31,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2025-03-09 06:40:31,382 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2025-03-09 06:40:31,382 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 98 flow [2025-03-09 06:40:31,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-09 06:40:31,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:31,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:40:31,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:40:31,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 06:40:31,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:31,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1613820568, now seen corresponding path program 1 times [2025-03-09 06:40:31,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:31,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096663427] [2025-03-09 06:40:31,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:31,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:31,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:40:31,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:40:31,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:31,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:31,449 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-09 06:40:31,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:31,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096663427] [2025-03-09 06:40:31,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096663427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:40:31,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:40:31,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:40:31,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024556745] [2025-03-09 06:40:31,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:40:31,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:40:31,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:31,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:40:31,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:40:31,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-03-09 06:40:31,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-09 06:40:31,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:31,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-03-09 06:40:31,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:31,524 INFO L124 PetriNetUnfolderBase]: 114/238 cut-off events. [2025-03-09 06:40:31,524 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-09 06:40:31,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 238 events. 114/238 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 840 event pairs, 78 based on Foata normal form. 13/250 useless extension candidates. Maximal degree in co-relation 393. Up to 189 conditions per place. [2025-03-09 06:40:31,526 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 33 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2025-03-09 06:40:31,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 196 flow [2025-03-09 06:40:31,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:40:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:40:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-03-09 06:40:31,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2025-03-09 06:40:31,527 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 98 flow. Second operand 3 states and 52 transitions. [2025-03-09 06:40:31,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 196 flow [2025-03-09 06:40:31,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:40:31,529 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 110 flow [2025-03-09 06:40:31,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2025-03-09 06:40:31,530 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-03-09 06:40:31,531 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 110 flow [2025-03-09 06:40:31,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-09 06:40:31,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:31,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:40:31,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:40:31,531 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 06:40:31,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:31,532 INFO L85 PathProgramCache]: Analyzing trace with hash -752845716, now seen corresponding path program 1 times [2025-03-09 06:40:31,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:31,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091348705] [2025-03-09 06:40:31,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:31,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:31,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 06:40:31,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 06:40:31,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:31,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:31,633 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-09 06:40:31,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:31,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091348705] [2025-03-09 06:40:31,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091348705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:40:31,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:40:31,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:40:31,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883169608] [2025-03-09 06:40:31,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:40:31,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:40:31,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:31,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:40:31,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:40:31,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2025-03-09 06:40:31,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:31,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:31,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2025-03-09 06:40:31,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:31,749 INFO L124 PetriNetUnfolderBase]: 141/309 cut-off events. [2025-03-09 06:40:31,750 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-09 06:40:31,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 309 events. 141/309 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1278 event pairs, 44 based on Foata normal form. 8/316 useless extension candidates. Maximal degree in co-relation 552. Up to 147 conditions per place. [2025-03-09 06:40:31,751 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 38 selfloop transitions, 11 changer transitions 0/53 dead transitions. [2025-03-09 06:40:31,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 271 flow [2025-03-09 06:40:31,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:40:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:40:31,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-03-09 06:40:31,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3804878048780488 [2025-03-09 06:40:31,752 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 110 flow. Second operand 5 states and 78 transitions. [2025-03-09 06:40:31,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 271 flow [2025-03-09 06:40:31,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:40:31,754 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 148 flow [2025-03-09 06:40:31,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2025-03-09 06:40:31,754 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2025-03-09 06:40:31,754 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 148 flow [2025-03-09 06:40:31,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:31,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:31,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:40:31,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:40:31,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 06:40:31,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1611144592, now seen corresponding path program 2 times [2025-03-09 06:40:31,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:31,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945069276] [2025-03-09 06:40:31,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:40:31,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:31,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-03-09 06:40:31,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 06:40:31,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:40:31,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:31,828 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-09 06:40:31,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:31,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945069276] [2025-03-09 06:40:31,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945069276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:40:31,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:40:31,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:40:31,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489072133] [2025-03-09 06:40:31,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:40:31,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:40:31,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:31,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:40:31,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:40:31,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2025-03-09 06:40:31,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:31,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:31,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2025-03-09 06:40:31,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:31,898 INFO L124 PetriNetUnfolderBase]: 122/271 cut-off events. [2025-03-09 06:40:31,898 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2025-03-09 06:40:31,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 271 events. 122/271 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1086 event pairs, 62 based on Foata normal form. 19/289 useless extension candidates. Maximal degree in co-relation 394. Up to 148 conditions per place. [2025-03-09 06:40:31,899 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 0 selfloop transitions, 0 changer transitions 42/42 dead transitions. [2025-03-09 06:40:31,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 238 flow [2025-03-09 06:40:31,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:40:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:40:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-03-09 06:40:31,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3719512195121951 [2025-03-09 06:40:31,900 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 148 flow. Second operand 4 states and 61 transitions. [2025-03-09 06:40:31,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 238 flow [2025-03-09 06:40:31,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 229 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:40:31,902 INFO L231 Difference]: Finished difference. Result has 44 places, 0 transitions, 0 flow [2025-03-09 06:40:31,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=44, PETRI_TRANSITIONS=0} [2025-03-09 06:40:31,902 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-03-09 06:40:31,902 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 0 transitions, 0 flow [2025-03-09 06:40:31,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-09 06:40:31,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-09 06:40:31,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:40:31,908 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:40:31,915 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 06:40:31,915 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 06:40:31,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 06:40:31 BasicIcfg [2025-03-09 06:40:31,921 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 06:40:31,921 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:40:31,921 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:40:31,921 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:40:31,922 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:40:30" (3/4) ... [2025-03-09 06:40:31,923 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 06:40:31,925 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-09 06:40:31,925 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-09 06:40:31,930 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-09 06:40:31,930 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-09 06:40:31,930 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-09 06:40:31,930 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 06:40:31,990 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 06:40:31,990 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 06:40:31,990 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:40:31,991 INFO L158 Benchmark]: Toolchain (without parser) took 2469.85ms. Allocated memory is still 201.3MB. Free memory was 157.9MB in the beginning and 118.9MB in the end (delta: 39.0MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2025-03-09 06:40:31,991 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:40:31,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.32ms. Allocated memory is still 201.3MB. Free memory was 157.5MB in the beginning and 146.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:40:31,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.03ms. Allocated memory is still 201.3MB. Free memory was 146.6MB in the beginning and 145.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:40:31,993 INFO L158 Benchmark]: Boogie Preprocessor took 19.87ms. Allocated memory is still 201.3MB. Free memory was 145.3MB in the beginning and 143.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:40:31,993 INFO L158 Benchmark]: IcfgBuilder took 387.85ms. Allocated memory is still 201.3MB. Free memory was 143.7MB in the beginning and 116.4MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 06:40:31,993 INFO L158 Benchmark]: TraceAbstraction took 1804.20ms. Allocated memory is still 201.3MB. Free memory was 115.7MB in the beginning and 124.6MB in the end (delta: -8.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:40:31,993 INFO L158 Benchmark]: Witness Printer took 69.26ms. Allocated memory is still 201.3MB. Free memory was 124.6MB in the beginning and 118.9MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:40:31,994 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.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.32ms. Allocated memory is still 201.3MB. Free memory was 157.5MB in the beginning and 146.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.03ms. Allocated memory is still 201.3MB. Free memory was 146.6MB in the beginning and 145.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.87ms. Allocated memory is still 201.3MB. Free memory was 145.3MB in the beginning and 143.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 387.85ms. Allocated memory is still 201.3MB. Free memory was 143.7MB in the beginning and 116.4MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1804.20ms. Allocated memory is still 201.3MB. Free memory was 115.7MB in the beginning and 124.6MB in the end (delta: -8.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 69.26ms. Allocated memory is still 201.3MB. Free memory was 124.6MB in the beginning and 118.9MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 67 locations, 68 edges, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 457 IncrementalHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1 mSDtfsCounter, 457 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=7, InterpolantAutomatonStates: 28, 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, 0.6s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 06:40:32,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE