./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 3e310cbbcaa6ee1bb3c2e05a2a5fb7cb2ddde366fa4283fb7922170dd08986ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:47:54,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:47:54,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:47:54,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:47:54,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:47:54,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:47:54,558 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:47:54,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:47:54,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:47:54,558 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:47:54,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:47:54,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:47:54,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:47:54,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:47:54,559 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:47:54,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:47:54,559 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:47:54,559 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:47:54,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:47:54,561 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:47:54,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:47:54,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:47:54,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:47:54,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:47:54,561 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:47:54,561 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:47:54,561 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:47:54,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:47:54,561 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:47:54,562 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:47:54,562 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:47:54,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:47:54,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:47:54,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:47:54,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:47:54,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:47:54,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:47:54,563 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:47:54,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:47:54,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:47:54,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:47:54,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:47:54,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:47:54,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:47:54,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:47:54,563 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-jdk21/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 -> 3e310cbbcaa6ee1bb3c2e05a2a5fb7cb2ddde366fa4283fb7922170dd08986ab [2025-02-06 18:47:54,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:47:54,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:47:54,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:47:54,800 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:47:54,800 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:47:54,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2025-02-06 18:47:55,884 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c731c77e3/86bb9acbbb204b94afc6cc4afa12db1b/FLAG61f2aac2b [2025-02-06 18:47:56,087 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:47:56,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2025-02-06 18:47:56,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c731c77e3/86bb9acbbb204b94afc6cc4afa12db1b/FLAG61f2aac2b [2025-02-06 18:47:56,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c731c77e3/86bb9acbbb204b94afc6cc4afa12db1b [2025-02-06 18:47:56,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:47:56,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:47:56,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:47:56,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:47:56,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:47:56,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:47:56" (1/1) ... [2025-02-06 18:47:56,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@721af818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:56, skipping insertion in model container [2025-02-06 18:47:56,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:47:56" (1/1) ... [2025-02-06 18:47:56,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:47:56,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:47:56,603 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:47:56,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:47:56,641 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:47:56,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:56 WrapperNode [2025-02-06 18:47:56,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:47:56,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:47:56,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:47:56,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:47:56,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:56" (1/1) ... [2025-02-06 18:47:56,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:56" (1/1) ... [2025-02-06 18:47:56,687 INFO L138 Inliner]: procedures = 22, calls = 31, calls flagged for inlining = 18, calls inlined = 40, statements flattened = 515 [2025-02-06 18:47:56,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:47:56,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:47:56,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:47:56,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:47:56,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:56" (1/1) ... [2025-02-06 18:47:56,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:56" (1/1) ... [2025-02-06 18:47:56,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:56" (1/1) ... [2025-02-06 18:47:56,731 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-02-06 18:47:56,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:56" (1/1) ... [2025-02-06 18:47:56,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:56" (1/1) ... [2025-02-06 18:47:56,745 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:56" (1/1) ... [2025-02-06 18:47:56,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:56" (1/1) ... [2025-02-06 18:47:56,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:56" (1/1) ... [2025-02-06 18:47:56,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:56" (1/1) ... [2025-02-06 18:47:56,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:47:56,758 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:47:56,758 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:47:56,758 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:47:56,759 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:56" (1/1) ... [2025-02-06 18:47:56,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:47:56,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:47:56,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:47:56,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:47:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:47:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 18:47:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 18:47:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 18:47:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 18:47:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 18:47:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 18:47:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:47:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 18:47:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 18:47:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:47:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:47:56,828 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:47:56,902 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:47:56,904 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:47:57,524 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:47:57,524 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:47:58,740 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:47:58,740 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:47:58,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:47:58 BoogieIcfgContainer [2025-02-06 18:47:58,741 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:47:58,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:47:58,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:47:58,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:47:58,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:47:56" (1/3) ... [2025-02-06 18:47:58,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6501f414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:47:58, skipping insertion in model container [2025-02-06 18:47:58,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:47:56" (2/3) ... [2025-02-06 18:47:58,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6501f414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:47:58, skipping insertion in model container [2025-02-06 18:47:58,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:47:58" (3/3) ... [2025-02-06 18:47:58,749 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-collitem-trans.wvr.c [2025-02-06 18:47:58,760 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:47:58,761 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-collitem-trans.wvr.c that has 4 procedures, 96 locations, 1 initial locations, 0 loop locations, and 72 error locations. [2025-02-06 18:47:58,761 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:47:59,461 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 18:47:59,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 95 transitions, 211 flow [2025-02-06 18:47:59,559 INFO L124 PetriNetUnfolderBase]: 0/92 cut-off events. [2025-02-06 18:47:59,561 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 18:47:59,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 92 events. 0/92 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 488 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-02-06 18:47:59,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 95 transitions, 211 flow [2025-02-06 18:47:59,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 90 transitions, 195 flow [2025-02-06 18:47:59,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:47:59,577 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;@37284450, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:47:59,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2025-02-06 18:47:59,579 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:47:59,579 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 18:47:59,579 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:47:59,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:47:59,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:47:59,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-06 18:47:59,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:47:59,584 INFO L85 PathProgramCache]: Analyzing trace with hash 56757978, now seen corresponding path program 1 times [2025-02-06 18:47:59,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:47:59,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902877056] [2025-02-06 18:47:59,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:47:59,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:47:59,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:47:59,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:47:59,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:47:59,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:47:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:47:59,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:47:59,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902877056] [2025-02-06 18:47:59,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902877056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:47:59,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:47:59,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:47:59,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228127543] [2025-02-06 18:47:59,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:47:59,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 18:47:59,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:47:59,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 18:47:59,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:47:59,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-02-06 18:47:59,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 195 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-02-06 18:47:59,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:47:59,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-02-06 18:47:59,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:14,427 INFO L124 PetriNetUnfolderBase]: 34236/49456 cut-off events. [2025-02-06 18:48:14,427 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2025-02-06 18:48:14,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99698 conditions, 49456 events. 34236/49456 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 11172. Compared 430907 event pairs, 34236 based on Foata normal form. 0/12567 useless extension candidates. Maximal degree in co-relation 97143. Up to 49096 conditions per place. [2025-02-06 18:48:14,643 INFO L140 encePairwiseOnDemand]: 71/95 looper letters, 63 selfloop transitions, 0 changer transitions 0/66 dead transitions. [2025-02-06 18:48:14,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 66 transitions, 273 flow [2025-02-06 18:48:14,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 18:48:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 18:48:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 99 transitions. [2025-02-06 18:48:14,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5210526315789473 [2025-02-06 18:48:14,656 INFO L175 Difference]: Start difference. First operand has 100 places, 90 transitions, 195 flow. Second operand 2 states and 99 transitions. [2025-02-06 18:48:14,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 66 transitions, 273 flow [2025-02-06 18:48:14,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 264 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 18:48:14,698 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 138 flow [2025-02-06 18:48:14,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=138, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2025-02-06 18:48:14,703 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -28 predicate places. [2025-02-06 18:48:14,704 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 138 flow [2025-02-06 18:48:14,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-02-06 18:48:14,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:14,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:48:14,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:48:14,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-06 18:48:14,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:14,706 INFO L85 PathProgramCache]: Analyzing trace with hash 56757979, now seen corresponding path program 1 times [2025-02-06 18:48:14,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:14,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176673646] [2025-02-06 18:48:14,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:14,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:14,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:48:14,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:48:14,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:14,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:14,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:48:14,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:14,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176673646] [2025-02-06 18:48:14,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176673646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:14,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:48:14,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:48:14,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136281433] [2025-02-06 18:48:14,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:14,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:48:14,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:14,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:48:14,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:48:14,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-02-06 18:48:14,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:48:14,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:14,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-02-06 18:48:14,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:25,869 INFO L124 PetriNetUnfolderBase]: 30688/44370 cut-off events. [2025-02-06 18:48:25,870 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-06 18:48:25,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89086 conditions, 44370 events. 30688/44370 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9960. Compared 382153 event pairs, 30688 based on Foata normal form. 0/11459 useless extension candidates. Maximal degree in co-relation 89083. Up to 44046 conditions per place. [2025-02-06 18:48:26,019 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 60 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2025-02-06 18:48:26,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 256 flow [2025-02-06 18:48:26,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:48:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:48:26,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-02-06 18:48:26,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28421052631578947 [2025-02-06 18:48:26,022 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 138 flow. Second operand 3 states and 81 transitions. [2025-02-06 18:48:26,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 256 flow [2025-02-06 18:48:26,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 256 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:48:26,023 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 136 flow [2025-02-06 18:48:26,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2025-02-06 18:48:26,024 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -28 predicate places. [2025-02-06 18:48:26,024 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 136 flow [2025-02-06 18:48:26,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:48:26,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:26,025 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:48:26,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:48:26,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-06 18:48:26,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:26,026 INFO L85 PathProgramCache]: Analyzing trace with hash 56757980, now seen corresponding path program 1 times [2025-02-06 18:48:26,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:26,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710531704] [2025-02-06 18:48:26,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:26,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:26,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:48:26,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:48:26,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:26,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:48:26,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:26,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710531704] [2025-02-06 18:48:26,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710531704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:26,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:48:26,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:48:26,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254187540] [2025-02-06 18:48:26,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:26,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:48:26,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:26,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:48:26,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:48:26,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-02-06 18:48:26,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:48:26,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:26,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-02-06 18:48:26,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:36,418 INFO L124 PetriNetUnfolderBase]: 27334/39560 cut-off events. [2025-02-06 18:48:36,418 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-06 18:48:36,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79432 conditions, 39560 events. 27334/39560 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 8818. Compared 336855 event pairs, 27334 based on Foata normal form. 0/10401 useless extension candidates. Maximal degree in co-relation 79428. Up to 39271 conditions per place. [2025-02-06 18:48:36,571 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 58 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2025-02-06 18:48:36,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 62 transitions, 250 flow [2025-02-06 18:48:36,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:48:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:48:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-02-06 18:48:36,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2771929824561403 [2025-02-06 18:48:36,573 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 136 flow. Second operand 3 states and 79 transitions. [2025-02-06 18:48:36,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 62 transitions, 250 flow [2025-02-06 18:48:36,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 249 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:48:36,574 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 133 flow [2025-02-06 18:48:36,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2025-02-06 18:48:36,574 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -29 predicate places. [2025-02-06 18:48:36,574 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 133 flow [2025-02-06 18:48:36,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:48:36,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:36,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:48:36,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:48:36,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-06 18:48:36,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:36,575 INFO L85 PathProgramCache]: Analyzing trace with hash 56757982, now seen corresponding path program 1 times [2025-02-06 18:48:36,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:36,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415184300] [2025-02-06 18:48:36,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:36,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:36,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:48:36,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:48:36,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:36,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:48:36,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:36,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415184300] [2025-02-06 18:48:36,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415184300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:36,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:48:36,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:48:36,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081702890] [2025-02-06 18:48:36,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:36,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:48:36,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:36,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:48:36,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:48:36,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-02-06 18:48:36,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:48:36,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:36,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-02-06 18:48:36,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:46,241 INFO L124 PetriNetUnfolderBase]: 24395/35360 cut-off events. [2025-02-06 18:48:46,241 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-06 18:48:46,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71015 conditions, 35360 events. 24395/35360 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 7805. Compared 297712 event pairs, 24395 based on Foata normal form. 0/9470 useless extension candidates. Maximal degree in co-relation 71011. Up to 35088 conditions per place. [2025-02-06 18:48:46,392 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 56 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2025-02-06 18:48:46,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 60 transitions, 243 flow [2025-02-06 18:48:46,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:48:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:48:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-02-06 18:48:46,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27017543859649124 [2025-02-06 18:48:46,393 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 133 flow. Second operand 3 states and 77 transitions. [2025-02-06 18:48:46,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 60 transitions, 243 flow [2025-02-06 18:48:46,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 60 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:48:46,394 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 130 flow [2025-02-06 18:48:46,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2025-02-06 18:48:46,395 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -30 predicate places. [2025-02-06 18:48:46,395 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 130 flow [2025-02-06 18:48:46,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:48:46,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:46,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:48:46,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:48:46,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-06 18:48:46,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:46,396 INFO L85 PathProgramCache]: Analyzing trace with hash 56757983, now seen corresponding path program 1 times [2025-02-06 18:48:46,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:46,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879015855] [2025-02-06 18:48:46,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:46,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:46,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:48:46,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:48:46,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:46,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:48:46,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:46,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879015855] [2025-02-06 18:48:46,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879015855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:46,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:48:46,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:48:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218539279] [2025-02-06 18:48:46,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:46,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:48:46,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:46,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:48:46,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:48:46,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-02-06 18:48:46,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:48:46,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:46,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-02-06 18:48:46,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:54,686 INFO L124 PetriNetUnfolderBase]: 21622/31394 cut-off events. [2025-02-06 18:48:54,687 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-02-06 18:48:54,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63066 conditions, 31394 events. 21622/31394 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 6854. Compared 261521 event pairs, 21622 based on Foata normal form. 0/8581 useless extension candidates. Maximal degree in co-relation 63062. Up to 31139 conditions per place. [2025-02-06 18:48:54,815 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 54 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2025-02-06 18:48:54,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 58 transitions, 236 flow [2025-02-06 18:48:54,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:48:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:48:54,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-02-06 18:48:54,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2631578947368421 [2025-02-06 18:48:54,821 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 130 flow. Second operand 3 states and 75 transitions. [2025-02-06 18:48:54,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 58 transitions, 236 flow [2025-02-06 18:48:54,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 58 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:48:54,822 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 127 flow [2025-02-06 18:48:54,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2025-02-06 18:48:54,824 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -31 predicate places. [2025-02-06 18:48:54,825 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 127 flow [2025-02-06 18:48:54,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:48:54,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:54,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:48:54,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:48:54,826 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-06 18:48:54,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:54,829 INFO L85 PathProgramCache]: Analyzing trace with hash 56757985, now seen corresponding path program 1 times [2025-02-06 18:48:54,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:54,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534906609] [2025-02-06 18:48:54,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:54,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:54,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:48:54,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:48:54,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:54,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:48:54,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:54,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534906609] [2025-02-06 18:48:54,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534906609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:54,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:48:54,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:48:54,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676334965] [2025-02-06 18:48:54,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:54,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:48:54,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:54,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:48:54,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:48:54,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-02-06 18:48:54,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:48:54,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:54,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-02-06 18:48:54,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:02,642 INFO L124 PetriNetUnfolderBase]: 18962/27568 cut-off events. [2025-02-06 18:49:02,642 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-06 18:49:02,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55383 conditions, 27568 events. 18962/27568 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 5966. Compared 227666 event pairs, 18962 based on Foata normal form. 0/7703 useless extension candidates. Maximal degree in co-relation 55379. Up to 27344 conditions per place. [2025-02-06 18:49:02,750 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 52 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2025-02-06 18:49:02,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 56 transitions, 229 flow [2025-02-06 18:49:02,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-02-06 18:49:02,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.256140350877193 [2025-02-06 18:49:02,753 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 127 flow. Second operand 3 states and 73 transitions. [2025-02-06 18:49:02,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 56 transitions, 229 flow [2025-02-06 18:49:02,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 56 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:02,754 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 124 flow [2025-02-06 18:49:02,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2025-02-06 18:49:02,754 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -32 predicate places. [2025-02-06 18:49:02,754 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 124 flow [2025-02-06 18:49:02,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:49:02,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:02,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:02,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:49:02,755 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-06 18:49:02,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:02,755 INFO L85 PathProgramCache]: Analyzing trace with hash 56757986, now seen corresponding path program 1 times [2025-02-06 18:49:02,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:02,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59354984] [2025-02-06 18:49:02,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:02,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:02,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:02,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:02,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:02,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:02,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:02,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59354984] [2025-02-06 18:49:02,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59354984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:02,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:02,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:02,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113940667] [2025-02-06 18:49:02,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:02,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:02,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:02,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:02,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:02,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-02-06 18:49:02,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:49:02,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:02,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-02-06 18:49:02,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:09,280 INFO L124 PetriNetUnfolderBase]: 16476/23990 cut-off events. [2025-02-06 18:49:09,281 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-02-06 18:49:09,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48198 conditions, 23990 events. 16476/23990 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 5140. Compared 195455 event pairs, 16476 based on Foata normal form. 0/6871 useless extension candidates. Maximal degree in co-relation 48194. Up to 23795 conditions per place. [2025-02-06 18:49:09,369 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 50 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2025-02-06 18:49:09,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 54 transitions, 222 flow [2025-02-06 18:49:09,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-02-06 18:49:09,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24912280701754386 [2025-02-06 18:49:09,370 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 124 flow. Second operand 3 states and 71 transitions. [2025-02-06 18:49:09,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 54 transitions, 222 flow [2025-02-06 18:49:09,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 54 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:09,372 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 121 flow [2025-02-06 18:49:09,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2025-02-06 18:49:09,372 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -33 predicate places. [2025-02-06 18:49:09,372 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 121 flow [2025-02-06 18:49:09,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:49:09,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:09,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:09,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:49:09,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-06 18:49:09,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:09,373 INFO L85 PathProgramCache]: Analyzing trace with hash 56757988, now seen corresponding path program 1 times [2025-02-06 18:49:09,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:09,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931481208] [2025-02-06 18:49:09,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:09,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:09,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:09,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:09,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:09,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:09,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:09,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:09,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931481208] [2025-02-06 18:49:09,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931481208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:09,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:09,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:09,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371087238] [2025-02-06 18:49:09,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:09,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:09,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:09,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:09,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:09,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-02-06 18:49:09,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:49:09,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:09,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-02-06 18:49:09,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:15,450 INFO L124 PetriNetUnfolderBase]: 14329/20910 cut-off events. [2025-02-06 18:49:15,450 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 18:49:15,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42023 conditions, 20910 events. 14329/20910 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4419. Compared 167953 event pairs, 14329 based on Foata normal form. 0/6146 useless extension candidates. Maximal degree in co-relation 42019. Up to 20730 conditions per place. [2025-02-06 18:49:15,592 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 48 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2025-02-06 18:49:15,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 52 transitions, 215 flow [2025-02-06 18:49:15,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-02-06 18:49:15,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24210526315789474 [2025-02-06 18:49:15,594 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 121 flow. Second operand 3 states and 69 transitions. [2025-02-06 18:49:15,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 52 transitions, 215 flow [2025-02-06 18:49:15,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 52 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:15,596 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 118 flow [2025-02-06 18:49:15,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2025-02-06 18:49:15,599 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -34 predicate places. [2025-02-06 18:49:15,599 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 118 flow [2025-02-06 18:49:15,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:49:15,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:15,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:15,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:49:15,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-06 18:49:15,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:15,601 INFO L85 PathProgramCache]: Analyzing trace with hash 56757989, now seen corresponding path program 1 times [2025-02-06 18:49:15,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:15,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579577354] [2025-02-06 18:49:15,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:15,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:15,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:15,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:15,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:15,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:15,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:15,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579577354] [2025-02-06 18:49:15,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579577354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:15,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:15,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:15,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88323551] [2025-02-06 18:49:15,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:15,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:15,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:15,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:15,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:15,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-02-06 18:49:15,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:49:15,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:15,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-02-06 18:49:15,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:21,084 INFO L124 PetriNetUnfolderBase]: 12328/18036 cut-off events. [2025-02-06 18:49:21,085 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-02-06 18:49:21,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36260 conditions, 18036 events. 12328/18036 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 3752. Compared 142693 event pairs, 12328 based on Foata normal form. 0/5459 useless extension candidates. Maximal degree in co-relation 36256. Up to 17871 conditions per place. [2025-02-06 18:49:21,179 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 46 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-02-06 18:49:21,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 50 transitions, 208 flow [2025-02-06 18:49:21,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-02-06 18:49:21,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23508771929824562 [2025-02-06 18:49:21,180 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 118 flow. Second operand 3 states and 67 transitions. [2025-02-06 18:49:21,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 50 transitions, 208 flow [2025-02-06 18:49:21,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 50 transitions, 207 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:21,181 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 115 flow [2025-02-06 18:49:21,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2025-02-06 18:49:21,181 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -35 predicate places. [2025-02-06 18:49:21,181 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 115 flow [2025-02-06 18:49:21,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:49:21,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:21,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:21,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:49:21,182 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-06 18:49:21,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:21,182 INFO L85 PathProgramCache]: Analyzing trace with hash 56757991, now seen corresponding path program 1 times [2025-02-06 18:49:21,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:21,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276421123] [2025-02-06 18:49:21,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:21,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:21,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:21,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:21,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:21,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:21,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:21,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276421123] [2025-02-06 18:49:21,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276421123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:21,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:21,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:21,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196204290] [2025-02-06 18:49:21,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:21,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:21,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:21,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:21,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:21,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-02-06 18:49:21,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:49:21,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:21,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-02-06 18:49:21,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:25,922 INFO L124 PetriNetUnfolderBase]: 10436/15302 cut-off events. [2025-02-06 18:49:25,923 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-02-06 18:49:25,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30767 conditions, 15302 events. 10436/15302 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 3140. Compared 119419 event pairs, 10436 based on Foata normal form. 0/4787 useless extension candidates. Maximal degree in co-relation 30763. Up to 15162 conditions per place. [2025-02-06 18:49:25,982 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 44 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2025-02-06 18:49:25,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 48 transitions, 201 flow [2025-02-06 18:49:25,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-02-06 18:49:25,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22807017543859648 [2025-02-06 18:49:25,984 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 115 flow. Second operand 3 states and 65 transitions. [2025-02-06 18:49:25,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 48 transitions, 201 flow [2025-02-06 18:49:25,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:25,985 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 112 flow [2025-02-06 18:49:25,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2025-02-06 18:49:25,985 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -36 predicate places. [2025-02-06 18:49:25,985 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 112 flow [2025-02-06 18:49:25,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:49:25,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:25,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:25,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:49:25,986 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-06 18:49:25,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:25,986 INFO L85 PathProgramCache]: Analyzing trace with hash 56757992, now seen corresponding path program 1 times [2025-02-06 18:49:25,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:25,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264364350] [2025-02-06 18:49:25,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:25,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:26,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:26,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:26,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:26,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:26,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:26,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264364350] [2025-02-06 18:49:26,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264364350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:26,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:26,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:26,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498390269] [2025-02-06 18:49:26,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:26,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:26,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:26,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:26,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:26,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-02-06 18:49:26,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:49:26,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:26,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-02-06 18:49:26,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:29,842 INFO L124 PetriNetUnfolderBase]: 8698/12788 cut-off events. [2025-02-06 18:49:29,842 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-06 18:49:29,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25716 conditions, 12788 events. 8698/12788 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 2582. Compared 97905 event pairs, 8698 based on Foata normal form. 0/4157 useless extension candidates. Maximal degree in co-relation 25712. Up to 12671 conditions per place. [2025-02-06 18:49:29,879 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 42 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2025-02-06 18:49:29,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 46 transitions, 194 flow [2025-02-06 18:49:29,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:29,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-02-06 18:49:29,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22105263157894736 [2025-02-06 18:49:29,880 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 112 flow. Second operand 3 states and 63 transitions. [2025-02-06 18:49:29,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 46 transitions, 194 flow [2025-02-06 18:49:29,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:29,880 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 109 flow [2025-02-06 18:49:29,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2025-02-06 18:49:29,881 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -37 predicate places. [2025-02-06 18:49:29,881 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 109 flow [2025-02-06 18:49:29,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:49:29,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:29,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:29,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:49:29,881 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-06 18:49:29,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:29,881 INFO L85 PathProgramCache]: Analyzing trace with hash 56757994, now seen corresponding path program 1 times [2025-02-06 18:49:29,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:29,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629513807] [2025-02-06 18:49:29,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:29,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:29,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:29,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:29,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:29,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:29,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:29,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629513807] [2025-02-06 18:49:29,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629513807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:29,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:29,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:29,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853625308] [2025-02-06 18:49:29,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:29,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:29,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:29,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:29,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:29,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-02-06 18:49:29,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:49:29,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:29,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-02-06 18:49:29,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:33,257 INFO L124 PetriNetUnfolderBase]: 7223/10660 cut-off events. [2025-02-06 18:49:33,257 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-06 18:49:33,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21447 conditions, 10660 events. 7223/10660 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 2105. Compared 80070 event pairs, 7223 based on Foata normal form. 0/3614 useless extension candidates. Maximal degree in co-relation 21443. Up to 10556 conditions per place. [2025-02-06 18:49:33,286 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 40 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2025-02-06 18:49:33,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 44 transitions, 187 flow [2025-02-06 18:49:33,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-02-06 18:49:33,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21403508771929824 [2025-02-06 18:49:33,287 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 109 flow. Second operand 3 states and 61 transitions. [2025-02-06 18:49:33,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 44 transitions, 187 flow [2025-02-06 18:49:33,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 44 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:33,288 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 106 flow [2025-02-06 18:49:33,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2025-02-06 18:49:33,289 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -38 predicate places. [2025-02-06 18:49:33,290 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 106 flow [2025-02-06 18:49:33,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:49:33,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:33,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:33,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 18:49:33,290 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-06 18:49:33,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:33,290 INFO L85 PathProgramCache]: Analyzing trace with hash 56757995, now seen corresponding path program 1 times [2025-02-06 18:49:33,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:33,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028359228] [2025-02-06 18:49:33,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:33,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:33,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:33,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:33,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:33,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:33,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:33,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028359228] [2025-02-06 18:49:33,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028359228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:33,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:33,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:33,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073256853] [2025-02-06 18:49:33,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:33,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:33,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:33,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:33,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:33,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-02-06 18:49:33,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:49:33,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:33,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-02-06 18:49:33,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:36,102 INFO L124 PetriNetUnfolderBase]: 5874/8710 cut-off events. [2025-02-06 18:49:36,103 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-06 18:49:36,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17534 conditions, 8710 events. 5874/8710 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 1674. Compared 64414 event pairs, 5874 based on Foata normal form. 0/3105 useless extension candidates. Maximal degree in co-relation 17530. Up to 8619 conditions per place. [2025-02-06 18:49:36,130 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 38 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2025-02-06 18:49:36,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 42 transitions, 180 flow [2025-02-06 18:49:36,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:49:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:49:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-02-06 18:49:36,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.20701754385964913 [2025-02-06 18:49:36,130 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 106 flow. Second operand 3 states and 59 transitions. [2025-02-06 18:49:36,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 42 transitions, 180 flow [2025-02-06 18:49:36,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 42 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:36,131 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 103 flow [2025-02-06 18:49:36,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2025-02-06 18:49:36,132 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -39 predicate places. [2025-02-06 18:49:36,132 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 103 flow [2025-02-06 18:49:36,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:49:36,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:36,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 18:49:36,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:49:36,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-02-06 18:49:36,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash 56757997, now seen corresponding path program 1 times [2025-02-06 18:49:36,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:36,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94382513] [2025-02-06 18:49:36,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:36,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:36,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:49:36,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:49:36,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:36,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:36,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:36,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94382513] [2025-02-06 18:49:36,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94382513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:36,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:36,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:49:36,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56447109] [2025-02-06 18:49:36,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:36,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:49:36,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:36,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:49:36,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:49:36,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-02-06 18:49:36,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-06 18:49:36,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:36,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-02-06 18:49:36,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand