./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-match-subst.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/chl-match-subst.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 2c931aeff3bd4feb775048ea000220a43a3b08d8a3667f51cb57a0babc9201aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:38:18,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:38:19,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:38:19,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:38:19,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:38:19,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:38:19,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:38:19,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:38:19,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:38:19,080 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:38:19,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:38:19,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:38:19,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:38:19,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:38:19,081 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:38:19,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:38:19,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:38:19,081 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:38:19,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:38:19,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:38:19,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:38:19,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:38:19,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:38:19,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:38:19,081 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:38:19,081 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:38:19,081 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:38:19,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:38:19,081 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:38:19,081 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:38:19,081 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:38:19,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:38:19,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:38:19,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:38:19,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:38:19,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:38:19,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:38:19,082 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:38:19,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:38:19,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:38:19,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:38:19,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:38:19,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:38:19,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:38:19,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:38:19,082 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 -> 2c931aeff3bd4feb775048ea000220a43a3b08d8a3667f51cb57a0babc9201aa [2025-03-09 06:38:19,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:38:19,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:38:19,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:38:19,310 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:38:19,310 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:38:19,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-match-subst.wvr.c [2025-03-09 06:38:20,531 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6da2696af/2e2b367e3f954471ba0cbd77c9b443c4/FLAG73f213aeb [2025-03-09 06:38:20,862 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:38:20,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-subst.wvr.c [2025-03-09 06:38:20,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6da2696af/2e2b367e3f954471ba0cbd77c9b443c4/FLAG73f213aeb [2025-03-09 06:38:21,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6da2696af/2e2b367e3f954471ba0cbd77c9b443c4 [2025-03-09 06:38:21,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:38:21,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:38:21,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:38:21,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:38:21,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:38:21,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:38:21" (1/1) ... [2025-03-09 06:38:21,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31dabf97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:21, skipping insertion in model container [2025-03-09 06:38:21,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:38:21" (1/1) ... [2025-03-09 06:38:21,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:38:21,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:38:21,270 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:38:21,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:38:21,305 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:38:21,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:21 WrapperNode [2025-03-09 06:38:21,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:38:21,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:38:21,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:38:21,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:38:21,313 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:38:21" (1/1) ... [2025-03-09 06:38:21,319 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:38:21" (1/1) ... [2025-03-09 06:38:21,348 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 13, calls inlined = 23, statements flattened = 285 [2025-03-09 06:38:21,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:38:21,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:38:21,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:38:21,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:38:21,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:21" (1/1) ... [2025-03-09 06:38:21,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:21" (1/1) ... [2025-03-09 06:38:21,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:21" (1/1) ... [2025-03-09 06:38:21,382 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:38:21,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:21" (1/1) ... [2025-03-09 06:38:21,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:21" (1/1) ... [2025-03-09 06:38:21,388 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:21" (1/1) ... [2025-03-09 06:38:21,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:21" (1/1) ... [2025-03-09 06:38:21,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:21" (1/1) ... [2025-03-09 06:38:21,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:21" (1/1) ... [2025-03-09 06:38:21,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:38:21,402 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:38:21,402 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:38:21,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:38:21,403 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:21" (1/1) ... [2025-03-09 06:38:21,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:38:21,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:38:21,435 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:38:21,447 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:38:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:38:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 06:38:21,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 06:38:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 06:38:21,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 06:38:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 06:38:21,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 06:38:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:38:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:38:21,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:38:21,470 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:38:21,565 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:38:21,567 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:38:21,999 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:38:21,999 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:38:22,192 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:38:22,192 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:38:22,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:38:22 BoogieIcfgContainer [2025-03-09 06:38:22,192 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:38:22,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:38:22,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:38:22,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:38:22,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:38:21" (1/3) ... [2025-03-09 06:38:22,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1565ecbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:38:22, skipping insertion in model container [2025-03-09 06:38:22,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:38:21" (2/3) ... [2025-03-09 06:38:22,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1565ecbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:38:22, skipping insertion in model container [2025-03-09 06:38:22,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:38:22" (3/3) ... [2025-03-09 06:38:22,225 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-match-subst.wvr.c [2025-03-09 06:38:22,238 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:38:22,239 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-match-subst.wvr.c that has 4 procedures, 114 locations, 1 initial locations, 0 loop locations, and 36 error locations. [2025-03-09 06:38:22,239 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:38:22,308 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 06:38:22,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 125 transitions, 271 flow [2025-03-09 06:38:22,379 INFO L124 PetriNetUnfolderBase]: 12/122 cut-off events. [2025-03-09 06:38:22,381 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 06:38:22,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 12/122 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 481 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2025-03-09 06:38:22,389 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 125 transitions, 271 flow [2025-03-09 06:38:22,393 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 120 transitions, 255 flow [2025-03-09 06:38:22,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:38:22,415 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;@33708751, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:38:22,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2025-03-09 06:38:22,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:38:22,421 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2025-03-09 06:38:22,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:38:22,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:22,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:38:22,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-09 06:38:22,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:22,428 INFO L85 PathProgramCache]: Analyzing trace with hash 820681514, now seen corresponding path program 1 times [2025-03-09 06:38:22,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:22,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921430140] [2025-03-09 06:38:22,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:22,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:22,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:38:22,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:38:22,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:22,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:22,642 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:38:22,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:22,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921430140] [2025-03-09 06:38:22,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921430140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:22,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:22,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:38:22,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991664705] [2025-03-09 06:38:22,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:22,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:38:22,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:22,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:38:22,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:38:22,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 125 [2025-03-09 06:38:22,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 120 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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:38:22,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:22,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 125 [2025-03-09 06:38:22,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:26,025 INFO L124 PetriNetUnfolderBase]: 23188/40499 cut-off events. [2025-03-09 06:38:26,026 INFO L125 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2025-03-09 06:38:26,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71921 conditions, 40499 events. 23188/40499 cut-off events. For 614/614 co-relation queries the response was YES. Maximal size of possible extension queue 1561. Compared 366073 event pairs, 5618 based on Foata normal form. 1256/36348 useless extension candidates. Maximal degree in co-relation 70776. Up to 15193 conditions per place. [2025-03-09 06:38:26,374 INFO L140 encePairwiseOnDemand]: 110/125 looper letters, 104 selfloop transitions, 10 changer transitions 0/180 dead transitions. [2025-03-09 06:38:26,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 180 transitions, 615 flow [2025-03-09 06:38:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:38:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:38:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2025-03-09 06:38:26,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.792 [2025-03-09 06:38:26,390 INFO L175 Difference]: Start difference. First operand has 118 places, 120 transitions, 255 flow. Second operand 4 states and 396 transitions. [2025-03-09 06:38:26,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 180 transitions, 615 flow [2025-03-09 06:38:26,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 180 transitions, 600 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 06:38:26,408 INFO L231 Difference]: Finished difference. Result has 117 places, 124 transitions, 312 flow [2025-03-09 06:38:26,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=117, PETRI_TRANSITIONS=124} [2025-03-09 06:38:26,413 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2025-03-09 06:38:26,413 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 124 transitions, 312 flow [2025-03-09 06:38:26,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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:38:26,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:26,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:38:26,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:38:26,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-09 06:38:26,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash -328676026, now seen corresponding path program 1 times [2025-03-09 06:38:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:26,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370700157] [2025-03-09 06:38:26,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:26,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:26,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:38:26,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:38:26,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:26,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:26,491 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:38:26,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:26,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370700157] [2025-03-09 06:38:26,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370700157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:26,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:26,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:38:26,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409642850] [2025-03-09 06:38:26,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:26,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:38:26,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:26,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:38:26,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:38:26,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 125 [2025-03-09 06:38:26,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 124 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 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:38:26,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:26,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 125 [2025-03-09 06:38:26,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:28,780 INFO L124 PetriNetUnfolderBase]: 16307/32378 cut-off events. [2025-03-09 06:38:28,781 INFO L125 PetriNetUnfolderBase]: For 6702/7146 co-relation queries the response was YES. [2025-03-09 06:38:28,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59803 conditions, 32378 events. 16307/32378 cut-off events. For 6702/7146 co-relation queries the response was YES. Maximal size of possible extension queue 1335. Compared 322377 event pairs, 7153 based on Foata normal form. 444/28160 useless extension candidates. Maximal degree in co-relation 41611. Up to 11217 conditions per place. [2025-03-09 06:38:29,033 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 71 selfloop transitions, 7 changer transitions 0/152 dead transitions. [2025-03-09 06:38:29,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 152 transitions, 529 flow [2025-03-09 06:38:29,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:38:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:38:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 375 transitions. [2025-03-09 06:38:29,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-09 06:38:29,036 INFO L175 Difference]: Start difference. First operand has 117 places, 124 transitions, 312 flow. Second operand 4 states and 375 transitions. [2025-03-09 06:38:29,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 152 transitions, 529 flow [2025-03-09 06:38:29,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 152 transitions, 529 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:38:29,048 INFO L231 Difference]: Finished difference. Result has 120 places, 124 transitions, 336 flow [2025-03-09 06:38:29,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=120, PETRI_TRANSITIONS=124} [2025-03-09 06:38:29,049 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 2 predicate places. [2025-03-09 06:38:29,049 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 124 transitions, 336 flow [2025-03-09 06:38:29,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 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:38:29,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:29,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:29,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:38:29,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-09 06:38:29,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:29,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1599052146, now seen corresponding path program 1 times [2025-03-09 06:38:29,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:29,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236535477] [2025-03-09 06:38:29,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:29,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:29,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:38:29,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:38:29,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:29,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:29,100 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:38:29,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:29,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236535477] [2025-03-09 06:38:29,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236535477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:29,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:29,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:38:29,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069502341] [2025-03-09 06:38:29,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:29,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:38:29,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:29,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:38:29,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:38:29,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 125 [2025-03-09 06:38:29,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 124 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:38:29,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:29,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 125 [2025-03-09 06:38:29,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:31,120 INFO L124 PetriNetUnfolderBase]: 17524/33929 cut-off events. [2025-03-09 06:38:31,120 INFO L125 PetriNetUnfolderBase]: For 15516/15960 co-relation queries the response was YES. [2025-03-09 06:38:31,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66439 conditions, 33929 events. 17524/33929 cut-off events. For 15516/15960 co-relation queries the response was YES. Maximal size of possible extension queue 1391. Compared 332478 event pairs, 8020 based on Foata normal form. 682/29661 useless extension candidates. Maximal degree in co-relation 47037. Up to 12530 conditions per place. [2025-03-09 06:38:31,330 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 73 selfloop transitions, 7 changer transitions 0/150 dead transitions. [2025-03-09 06:38:31,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 150 transitions, 549 flow [2025-03-09 06:38:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:38:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:38:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 366 transitions. [2025-03-09 06:38:31,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.732 [2025-03-09 06:38:31,333 INFO L175 Difference]: Start difference. First operand has 120 places, 124 transitions, 336 flow. Second operand 4 states and 366 transitions. [2025-03-09 06:38:31,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 150 transitions, 549 flow [2025-03-09 06:38:31,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 150 transitions, 541 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:38:31,367 INFO L231 Difference]: Finished difference. Result has 120 places, 123 transitions, 338 flow [2025-03-09 06:38:31,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=338, PETRI_PLACES=120, PETRI_TRANSITIONS=123} [2025-03-09 06:38:31,369 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 2 predicate places. [2025-03-09 06:38:31,369 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 123 transitions, 338 flow [2025-03-09 06:38:31,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:38:31,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:31,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:31,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:38:31,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-09 06:38:31,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:31,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1611411506, now seen corresponding path program 1 times [2025-03-09 06:38:31,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:31,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29406178] [2025-03-09 06:38:31,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:31,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:31,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:38:31,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:38:31,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:31,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:31,450 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:38:31,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:31,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29406178] [2025-03-09 06:38:31,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29406178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:31,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:31,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:38:31,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970776237] [2025-03-09 06:38:31,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:31,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:38:31,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:31,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:38:31,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:38:31,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 125 [2025-03-09 06:38:31,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 123 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 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:38:31,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:31,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 125 [2025-03-09 06:38:31,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:34,969 INFO L124 PetriNetUnfolderBase]: 34186/59083 cut-off events. [2025-03-09 06:38:34,969 INFO L125 PetriNetUnfolderBase]: For 33490/35381 co-relation queries the response was YES. [2025-03-09 06:38:35,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123595 conditions, 59083 events. 34186/59083 cut-off events. For 33490/35381 co-relation queries the response was YES. Maximal size of possible extension queue 2211. Compared 562589 event pairs, 8618 based on Foata normal form. 3078/53393 useless extension candidates. Maximal degree in co-relation 63337. Up to 21800 conditions per place. [2025-03-09 06:38:35,304 INFO L140 encePairwiseOnDemand]: 110/125 looper letters, 117 selfloop transitions, 10 changer transitions 0/191 dead transitions. [2025-03-09 06:38:35,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 191 transitions, 842 flow [2025-03-09 06:38:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:38:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:38:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 394 transitions. [2025-03-09 06:38:35,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.788 [2025-03-09 06:38:35,305 INFO L175 Difference]: Start difference. First operand has 120 places, 123 transitions, 338 flow. Second operand 4 states and 394 transitions. [2025-03-09 06:38:35,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 191 transitions, 842 flow [2025-03-09 06:38:35,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 191 transitions, 816 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:38:35,481 INFO L231 Difference]: Finished difference. Result has 121 places, 127 transitions, 390 flow [2025-03-09 06:38:35,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=390, PETRI_PLACES=121, PETRI_TRANSITIONS=127} [2025-03-09 06:38:35,482 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 3 predicate places. [2025-03-09 06:38:35,482 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 127 transitions, 390 flow [2025-03-09 06:38:35,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 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:38:35,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:35,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:35,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:38:35,483 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-09 06:38:35,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:35,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1585851719, now seen corresponding path program 1 times [2025-03-09 06:38:35,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:35,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312820950] [2025-03-09 06:38:35,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:35,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:35,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:38:35,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:38:35,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:35,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:35,547 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:38:35,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:35,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312820950] [2025-03-09 06:38:35,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312820950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:35,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:35,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:38:35,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042414638] [2025-03-09 06:38:35,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:35,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:38:35,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:35,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:38:35,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:38:35,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 125 [2025-03-09 06:38:35,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 127 transitions, 390 flow. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 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:38:35,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:35,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 125 [2025-03-09 06:38:35,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:38,757 INFO L124 PetriNetUnfolderBase]: 25423/49600 cut-off events. [2025-03-09 06:38:38,757 INFO L125 PetriNetUnfolderBase]: For 30169/31990 co-relation queries the response was YES. [2025-03-09 06:38:38,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106684 conditions, 49600 events. 25423/49600 cut-off events. For 30169/31990 co-relation queries the response was YES. Maximal size of possible extension queue 1916. Compared 518826 event pairs, 8319 based on Foata normal form. 1354/44496 useless extension candidates. Maximal degree in co-relation 39404. Up to 18004 conditions per place. [2025-03-09 06:38:39,066 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 80 selfloop transitions, 7 changer transitions 0/159 dead transitions. [2025-03-09 06:38:39,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 159 transitions, 681 flow [2025-03-09 06:38:39,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:38:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:38:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 374 transitions. [2025-03-09 06:38:39,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.748 [2025-03-09 06:38:39,067 INFO L175 Difference]: Start difference. First operand has 121 places, 127 transitions, 390 flow. Second operand 4 states and 374 transitions. [2025-03-09 06:38:39,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 159 transitions, 681 flow [2025-03-09 06:38:39,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 159 transitions, 681 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:38:39,329 INFO L231 Difference]: Finished difference. Result has 124 places, 127 transitions, 414 flow [2025-03-09 06:38:39,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=414, PETRI_PLACES=124, PETRI_TRANSITIONS=127} [2025-03-09 06:38:39,329 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 6 predicate places. [2025-03-09 06:38:39,329 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 127 transitions, 414 flow [2025-03-09 06:38:39,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 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:38:39,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:39,330 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:39,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:38:39,330 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-09 06:38:39,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:39,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1968990856, now seen corresponding path program 1 times [2025-03-09 06:38:39,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:39,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567294847] [2025-03-09 06:38:39,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:39,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:39,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:38:39,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:38:39,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:39,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:39,404 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:38:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:39,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567294847] [2025-03-09 06:38:39,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567294847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:39,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:39,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:38:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846528619] [2025-03-09 06:38:39,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:39,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:38:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:39,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:38:39,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:38:39,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 125 [2025-03-09 06:38:39,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 127 transitions, 414 flow. Second operand has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 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:38:39,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:39,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 125 [2025-03-09 06:38:39,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:43,723 INFO L124 PetriNetUnfolderBase]: 42565/68369 cut-off events. [2025-03-09 06:38:43,723 INFO L125 PetriNetUnfolderBase]: For 50395/53700 co-relation queries the response was YES. [2025-03-09 06:38:43,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164330 conditions, 68369 events. 42565/68369 cut-off events. For 50395/53700 co-relation queries the response was YES. Maximal size of possible extension queue 2381. Compared 604916 event pairs, 10085 based on Foata normal form. 1652/65564 useless extension candidates. Maximal degree in co-relation 65903. Up to 29582 conditions per place. [2025-03-09 06:38:44,326 INFO L140 encePairwiseOnDemand]: 114/125 looper letters, 115 selfloop transitions, 12 changer transitions 0/192 dead transitions. [2025-03-09 06:38:44,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 192 transitions, 910 flow [2025-03-09 06:38:44,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:38:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:38:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2025-03-09 06:38:44,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7456 [2025-03-09 06:38:44,327 INFO L175 Difference]: Start difference. First operand has 124 places, 127 transitions, 414 flow. Second operand 5 states and 466 transitions. [2025-03-09 06:38:44,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 192 transitions, 910 flow [2025-03-09 06:38:44,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 192 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:38:44,969 INFO L231 Difference]: Finished difference. Result has 127 places, 127 transitions, 452 flow [2025-03-09 06:38:44,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=452, PETRI_PLACES=127, PETRI_TRANSITIONS=127} [2025-03-09 06:38:44,969 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 9 predicate places. [2025-03-09 06:38:44,970 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 127 transitions, 452 flow [2025-03-09 06:38:44,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 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:38:44,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:44,970 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:44,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:38:44,970 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-09 06:38:44,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:44,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1968991849, now seen corresponding path program 1 times [2025-03-09 06:38:44,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:44,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343888367] [2025-03-09 06:38:44,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:44,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:44,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:38:44,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:38:44,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:44,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:45,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:38:45,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:45,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343888367] [2025-03-09 06:38:45,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343888367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:45,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:45,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:38:45,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046378994] [2025-03-09 06:38:45,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:45,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:38:45,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:45,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:38:45,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:38:45,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 125 [2025-03-09 06:38:45,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 127 transitions, 452 flow. Second operand has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 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:38:45,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:45,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 125 [2025-03-09 06:38:45,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:48,958 INFO L124 PetriNetUnfolderBase]: 31749/57366 cut-off events. [2025-03-09 06:38:48,958 INFO L125 PetriNetUnfolderBase]: For 60944/63382 co-relation queries the response was YES. [2025-03-09 06:38:49,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140407 conditions, 57366 events. 31749/57366 cut-off events. For 60944/63382 co-relation queries the response was YES. Maximal size of possible extension queue 2127. Compared 568254 event pairs, 9773 based on Foata normal form. 2098/54653 useless extension candidates. Maximal degree in co-relation 53994. Up to 17573 conditions per place. [2025-03-09 06:38:49,394 INFO L140 encePairwiseOnDemand]: 116/125 looper letters, 117 selfloop transitions, 9 changer transitions 0/191 dead transitions. [2025-03-09 06:38:49,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 191 transitions, 926 flow [2025-03-09 06:38:49,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:38:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:38:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 388 transitions. [2025-03-09 06:38:49,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.776 [2025-03-09 06:38:49,397 INFO L175 Difference]: Start difference. First operand has 127 places, 127 transitions, 452 flow. Second operand 4 states and 388 transitions. [2025-03-09 06:38:49,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 191 transitions, 926 flow [2025-03-09 06:38:50,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 191 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:38:50,062 INFO L231 Difference]: Finished difference. Result has 128 places, 125 transitions, 448 flow [2025-03-09 06:38:50,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=448, PETRI_PLACES=128, PETRI_TRANSITIONS=125} [2025-03-09 06:38:50,063 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 10 predicate places. [2025-03-09 06:38:50,063 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 125 transitions, 448 flow [2025-03-09 06:38:50,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 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:38:50,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:50,063 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:50,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:38:50,063 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-09 06:38:50,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:50,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1775944777, now seen corresponding path program 1 times [2025-03-09 06:38:50,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:50,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256764175] [2025-03-09 06:38:50,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:50,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:50,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:38:50,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:38:50,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:50,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:50,113 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:38:50,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:50,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256764175] [2025-03-09 06:38:50,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256764175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:50,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:50,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:38:50,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999220334] [2025-03-09 06:38:50,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:50,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:38:50,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:50,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:38:50,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:38:50,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 125 [2025-03-09 06:38:50,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 125 transitions, 448 flow. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 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:38:50,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:50,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 125 [2025-03-09 06:38:50,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:53,867 INFO L124 PetriNetUnfolderBase]: 29165/54686 cut-off events. [2025-03-09 06:38:53,867 INFO L125 PetriNetUnfolderBase]: For 77556/81535 co-relation queries the response was YES. [2025-03-09 06:38:54,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134371 conditions, 54686 events. 29165/54686 cut-off events. For 77556/81535 co-relation queries the response was YES. Maximal size of possible extension queue 2059. Compared 561068 event pairs, 12210 based on Foata normal form. 3360/49502 useless extension candidates. Maximal degree in co-relation 51033. Up to 21779 conditions per place. [2025-03-09 06:38:54,208 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 88 selfloop transitions, 5 changer transitions 0/158 dead transitions. [2025-03-09 06:38:54,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 158 transitions, 834 flow [2025-03-09 06:38:54,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:38:54,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:38:54,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2025-03-09 06:38:54,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.734 [2025-03-09 06:38:54,209 INFO L175 Difference]: Start difference. First operand has 128 places, 125 transitions, 448 flow. Second operand 4 states and 367 transitions. [2025-03-09 06:38:54,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 158 transitions, 834 flow [2025-03-09 06:38:54,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 158 transitions, 822 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:38:54,398 INFO L231 Difference]: Finished difference. Result has 128 places, 123 transitions, 447 flow [2025-03-09 06:38:54,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=447, PETRI_PLACES=128, PETRI_TRANSITIONS=123} [2025-03-09 06:38:54,398 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 10 predicate places. [2025-03-09 06:38:54,399 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 123 transitions, 447 flow [2025-03-09 06:38:54,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 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:38:54,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:54,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:54,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:38:54,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-09 06:38:54,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:54,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1916733138, now seen corresponding path program 1 times [2025-03-09 06:38:54,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:54,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834786065] [2025-03-09 06:38:54,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:54,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:54,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:38:54,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:38:54,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:54,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:54,426 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:38:54,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:54,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834786065] [2025-03-09 06:38:54,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834786065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:54,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:54,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:38:54,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207993403] [2025-03-09 06:38:54,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:54,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:38:54,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:54,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:38:54,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:38:54,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 125 [2025-03-09 06:38:54,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 123 transitions, 447 flow. Second operand has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:38:54,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:54,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 125 [2025-03-09 06:38:54,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:38:57,777 INFO L124 PetriNetUnfolderBase]: 26060/50185 cut-off events. [2025-03-09 06:38:57,777 INFO L125 PetriNetUnfolderBase]: For 68819/70900 co-relation queries the response was YES. [2025-03-09 06:38:57,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121355 conditions, 50185 events. 26060/50185 cut-off events. For 68819/70900 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 516482 event pairs, 9549 based on Foata normal form. 1796/46214 useless extension candidates. Maximal degree in co-relation 43622. Up to 17334 conditions per place. [2025-03-09 06:38:58,136 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 82 selfloop transitions, 7 changer transitions 0/153 dead transitions. [2025-03-09 06:38:58,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 153 transitions, 769 flow [2025-03-09 06:38:58,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:38:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:38:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2025-03-09 06:38:58,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.73 [2025-03-09 06:38:58,137 INFO L175 Difference]: Start difference. First operand has 128 places, 123 transitions, 447 flow. Second operand 4 states and 365 transitions. [2025-03-09 06:38:58,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 153 transitions, 769 flow [2025-03-09 06:38:58,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 153 transitions, 755 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:38:58,425 INFO L231 Difference]: Finished difference. Result has 127 places, 122 transitions, 447 flow [2025-03-09 06:38:58,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=447, PETRI_PLACES=127, PETRI_TRANSITIONS=122} [2025-03-09 06:38:58,426 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 9 predicate places. [2025-03-09 06:38:58,426 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 447 flow [2025-03-09 06:38:58,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:38:58,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:38:58,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:38:58,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:38:58,427 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-09 06:38:58,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:38:58,427 INFO L85 PathProgramCache]: Analyzing trace with hash 909175217, now seen corresponding path program 1 times [2025-03-09 06:38:58,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:38:58,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828126329] [2025-03-09 06:38:58,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:38:58,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:38:58,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:38:58,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:38:58,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:38:58,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:38:58,502 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:38:58,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:38:58,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828126329] [2025-03-09 06:38:58,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828126329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:38:58,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:38:58,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:38:58,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008598201] [2025-03-09 06:38:58,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:38:58,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:38:58,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:38:58,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:38:58,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:38:58,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 125 [2025-03-09 06:38:58,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 122 transitions, 447 flow. Second operand has 6 states, 6 states have (on average 66.16666666666667) internal successors, (397), 6 states have internal predecessors, (397), 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:38:58,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:38:58,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 125 [2025-03-09 06:38:58,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand