./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:26:39,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:26:39,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:26:39,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:26:39,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:26:39,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:26:39,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:26:39,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:26:39,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:26:39,428 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:26:39,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:26:39,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:26:39,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:26:39,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:26:39,430 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:26:39,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:26:39,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:26:39,431 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:26:39,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:26:39,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:26:39,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:26:39,431 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:26:39,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:26:39,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:26:39,432 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:26:39,432 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:26:39,432 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:26:39,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:26:39,432 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:26:39,432 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:26:39,432 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:26:39,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:26:39,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:26:39,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:26:39,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:26:39,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:26:39,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:26:39,433 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:26:39,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:26:39,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:26:39,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:26:39,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:26:39,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:26:39,433 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:26:39,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:26:39,434 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c [2025-03-04 15:26:39,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:26:39,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:26:39,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:26:39,659 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:26:39,659 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:26:39,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2025-03-04 15:26:40,865 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42a27e9ed/8c905e232ccd4e92bdb52df48d8fcfde/FLAG259493d6a [2025-03-04 15:26:41,080 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:26:41,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2025-03-04 15:26:41,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42a27e9ed/8c905e232ccd4e92bdb52df48d8fcfde/FLAG259493d6a [2025-03-04 15:26:41,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42a27e9ed/8c905e232ccd4e92bdb52df48d8fcfde [2025-03-04 15:26:41,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:26:41,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:26:41,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:26:41,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:26:41,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:26:41,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:26:41" (1/1) ... [2025-03-04 15:26:41,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d19ebaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:41, skipping insertion in model container [2025-03-04 15:26:41,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:26:41" (1/1) ... [2025-03-04 15:26:41,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:26:41,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:26:41,635 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:26:41,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:26:41,657 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:26:41,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:41 WrapperNode [2025-03-04 15:26:41,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:26:41,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:26:41,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:26:41,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:26:41,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:41" (1/1) ... [2025-03-04 15:26:41,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:41" (1/1) ... [2025-03-04 15:26:41,679 INFO L138 Inliner]: procedures = 19, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-03-04 15:26:41,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:26:41,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:26:41,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:26:41,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:26:41,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:41" (1/1) ... [2025-03-04 15:26:41,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:41" (1/1) ... [2025-03-04 15:26:41,690 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:41" (1/1) ... [2025-03-04 15:26:41,708 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 15:26:41,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:41" (1/1) ... [2025-03-04 15:26:41,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:41" (1/1) ... [2025-03-04 15:26:41,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:41" (1/1) ... [2025-03-04 15:26:41,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:41" (1/1) ... [2025-03-04 15:26:41,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:41" (1/1) ... [2025-03-04 15:26:41,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:41" (1/1) ... [2025-03-04 15:26:41,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:26:41,715 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:26:41,715 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:26:41,716 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:26:41,716 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:41" (1/1) ... [2025-03-04 15:26:41,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:26:41,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:41,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:26:41,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:26:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:26:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:26:41,765 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:26:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:26:41,765 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:26:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:26:41,765 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:26:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:26:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:26:41,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:26:41,766 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:26:41,832 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:26:41,833 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:26:41,982 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:26:41,983 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:26:42,077 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:26:42,077 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:26:42,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:26:42 BoogieIcfgContainer [2025-03-04 15:26:42,077 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:26:42,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:26:42,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:26:42,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:26:42,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:26:41" (1/3) ... [2025-03-04 15:26:42,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417d6a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:26:42, skipping insertion in model container [2025-03-04 15:26:42,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:41" (2/3) ... [2025-03-04 15:26:42,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417d6a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:26:42, skipping insertion in model container [2025-03-04 15:26:42,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:26:42" (3/3) ... [2025-03-04 15:26:42,084 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2025-03-04 15:26:42,095 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:26:42,096 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-4.wvr.c that has 4 procedures, 44 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-04 15:26:42,097 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:26:42,153 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:26:42,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 47 transitions, 115 flow [2025-03-04 15:26:42,209 INFO L124 PetriNetUnfolderBase]: 4/44 cut-off events. [2025-03-04 15:26:42,210 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:26:42,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 44 events. 4/44 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 112 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-03-04 15:26:42,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 47 transitions, 115 flow [2025-03-04 15:26:42,219 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 41 transitions, 94 flow [2025-03-04 15:26:42,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:26:42,245 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;@187c0597, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:26:42,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-04 15:26:42,250 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:26:42,251 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-04 15:26:42,251 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:26:42,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:42,251 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:42,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:26:42,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:42,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2035674387, now seen corresponding path program 1 times [2025-03-04 15:26:42,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:42,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926563925] [2025-03-04 15:26:42,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:42,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:42,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:26:42,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:26:42,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:42,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:42,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:42,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926563925] [2025-03-04 15:26:42,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926563925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:42,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:42,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:26:42,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483885534] [2025-03-04 15:26:42,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:42,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:42,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:42,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:42,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:26:42,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2025-03-04 15:26:42,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:42,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:42,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2025-03-04 15:26:42,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:42,886 INFO L124 PetriNetUnfolderBase]: 1988/3147 cut-off events. [2025-03-04 15:26:42,887 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-03-04 15:26:42,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6047 conditions, 3147 events. 1988/3147 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 19556 event pairs, 530 based on Foata normal form. 0/2012 useless extension candidates. Maximal degree in co-relation 5746. Up to 1533 conditions per place. [2025-03-04 15:26:42,923 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 37 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2025-03-04 15:26:42,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 231 flow [2025-03-04 15:26:42,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:26:42,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:26:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2025-03-04 15:26:42,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6950354609929078 [2025-03-04 15:26:42,939 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 94 flow. Second operand 3 states and 98 transitions. [2025-03-04 15:26:42,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 231 flow [2025-03-04 15:26:42,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 221 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:26:42,950 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 156 flow [2025-03-04 15:26:42,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-03-04 15:26:42,954 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2025-03-04 15:26:42,955 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 156 flow [2025-03-04 15:26:42,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:42,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:42,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:42,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:26:42,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:26:42,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:42,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2035674388, now seen corresponding path program 1 times [2025-03-04 15:26:42,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:42,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96553387] [2025-03-04 15:26:42,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:42,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:42,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:26:42,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:26:42,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:42,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:43,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:43,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:43,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96553387] [2025-03-04 15:26:43,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96553387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:43,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:43,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:26:43,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528562859] [2025-03-04 15:26:43,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:43,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:43,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:43,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:43,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:26:43,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2025-03-04 15:26:43,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:43,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:43,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2025-03-04 15:26:43,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:43,432 INFO L124 PetriNetUnfolderBase]: 3170/4873 cut-off events. [2025-03-04 15:26:43,432 INFO L125 PetriNetUnfolderBase]: For 3157/3157 co-relation queries the response was YES. [2025-03-04 15:26:43,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11635 conditions, 4873 events. 3170/4873 cut-off events. For 3157/3157 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 28485 event pairs, 534 based on Foata normal form. 316/4570 useless extension candidates. Maximal degree in co-relation 7796. Up to 2609 conditions per place. [2025-03-04 15:26:43,458 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 45 selfloop transitions, 9 changer transitions 0/67 dead transitions. [2025-03-04 15:26:43,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 329 flow [2025-03-04 15:26:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:26:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:26:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2025-03-04 15:26:43,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6950354609929078 [2025-03-04 15:26:43,459 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 156 flow. Second operand 3 states and 98 transitions. [2025-03-04 15:26:43,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 329 flow [2025-03-04 15:26:43,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 307 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:43,474 INFO L231 Difference]: Finished difference. Result has 49 places, 53 transitions, 222 flow [2025-03-04 15:26:43,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=49, PETRI_TRANSITIONS=53} [2025-03-04 15:26:43,475 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2025-03-04 15:26:43,475 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 53 transitions, 222 flow [2025-03-04 15:26:43,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:43,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:43,475 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:43,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:26:43,475 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:26:43,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:43,476 INFO L85 PathProgramCache]: Analyzing trace with hash -194856447, now seen corresponding path program 1 times [2025-03-04 15:26:43,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:43,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015393071] [2025-03-04 15:26:43,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:43,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:43,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:26:43,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:26:43,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:43,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:43,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:43,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015393071] [2025-03-04 15:26:43,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015393071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:43,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:43,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:43,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607491580] [2025-03-04 15:26:43,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:43,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:43,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:43,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:43,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:26:43,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2025-03-04 15:26:43,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 53 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:43,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:43,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2025-03-04 15:26:43,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:43,943 INFO L124 PetriNetUnfolderBase]: 3718/5496 cut-off events. [2025-03-04 15:26:43,943 INFO L125 PetriNetUnfolderBase]: For 5244/5834 co-relation queries the response was YES. [2025-03-04 15:26:43,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15226 conditions, 5496 events. 3718/5496 cut-off events. For 5244/5834 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 31559 event pairs, 1081 based on Foata normal form. 3/5059 useless extension candidates. Maximal degree in co-relation 12619. Up to 2534 conditions per place. [2025-03-04 15:26:44,003 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 64 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-03-04 15:26:44,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 77 transitions, 455 flow [2025-03-04 15:26:44,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:26:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:26:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-04 15:26:44,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6312056737588653 [2025-03-04 15:26:44,005 INFO L175 Difference]: Start difference. First operand has 49 places, 53 transitions, 222 flow. Second operand 3 states and 89 transitions. [2025-03-04 15:26:44,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 77 transitions, 455 flow [2025-03-04 15:26:44,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 77 transitions, 431 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:44,013 INFO L231 Difference]: Finished difference. Result has 51 places, 55 transitions, 226 flow [2025-03-04 15:26:44,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=51, PETRI_TRANSITIONS=55} [2025-03-04 15:26:44,014 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2025-03-04 15:26:44,014 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 55 transitions, 226 flow [2025-03-04 15:26:44,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:44,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:44,015 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:44,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:26:44,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:26:44,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:44,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1290544696, now seen corresponding path program 1 times [2025-03-04 15:26:44,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:44,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046885278] [2025-03-04 15:26:44,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:44,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:44,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:26:44,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:26:44,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:44,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:44,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:44,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:44,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046885278] [2025-03-04 15:26:44,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046885278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:44,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568949763] [2025-03-04 15:26:44,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:44,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:44,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:44,114 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:44,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:26:44,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:26:44,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:26:44,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:44,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:44,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:44,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:44,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:44,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:44,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568949763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:44,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:44,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 15:26:44,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051219657] [2025-03-04 15:26:44,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:44,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:26:44,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:44,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:26:44,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:26:44,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2025-03-04 15:26:44,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 55 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:44,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:44,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2025-03-04 15:26:44,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:44,976 INFO L124 PetriNetUnfolderBase]: 5998/10143 cut-off events. [2025-03-04 15:26:44,976 INFO L125 PetriNetUnfolderBase]: For 7113/7113 co-relation queries the response was YES. [2025-03-04 15:26:44,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26301 conditions, 10143 events. 5998/10143 cut-off events. For 7113/7113 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 69530 event pairs, 171 based on Foata normal form. 356/9726 useless extension candidates. Maximal degree in co-relation 23988. Up to 2827 conditions per place. [2025-03-04 15:26:45,034 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 93 selfloop transitions, 40 changer transitions 0/148 dead transitions. [2025-03-04 15:26:45,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 148 transitions, 825 flow [2025-03-04 15:26:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:26:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:26:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 241 transitions. [2025-03-04 15:26:45,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7325227963525835 [2025-03-04 15:26:45,037 INFO L175 Difference]: Start difference. First operand has 51 places, 55 transitions, 226 flow. Second operand 7 states and 241 transitions. [2025-03-04 15:26:45,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 148 transitions, 825 flow [2025-03-04 15:26:45,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 148 transitions, 819 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:45,042 INFO L231 Difference]: Finished difference. Result has 59 places, 91 transitions, 620 flow [2025-03-04 15:26:45,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=620, PETRI_PLACES=59, PETRI_TRANSITIONS=91} [2025-03-04 15:26:45,043 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2025-03-04 15:26:45,043 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 91 transitions, 620 flow [2025-03-04 15:26:45,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:45,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:45,043 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:45,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:45,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:45,244 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:26:45,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:45,245 INFO L85 PathProgramCache]: Analyzing trace with hash 478042939, now seen corresponding path program 1 times [2025-03-04 15:26:45,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:45,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276897026] [2025-03-04 15:26:45,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:45,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:45,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:26:45,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:26:45,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:45,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:45,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:45,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276897026] [2025-03-04 15:26:45,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276897026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:45,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:45,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:45,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919582796] [2025-03-04 15:26:45,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:45,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:45,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:45,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:45,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:26:45,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2025-03-04 15:26:45,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 91 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:45,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:45,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2025-03-04 15:26:45,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:46,139 INFO L124 PetriNetUnfolderBase]: 8005/12171 cut-off events. [2025-03-04 15:26:46,142 INFO L125 PetriNetUnfolderBase]: For 31681/31729 co-relation queries the response was YES. [2025-03-04 15:26:46,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40486 conditions, 12171 events. 8005/12171 cut-off events. For 31681/31729 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 79217 event pairs, 2330 based on Foata normal form. 0/11245 useless extension candidates. Maximal degree in co-relation 19119. Up to 5612 conditions per place. [2025-03-04 15:26:46,244 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 108 selfloop transitions, 3 changer transitions 0/123 dead transitions. [2025-03-04 15:26:46,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 123 transitions, 1067 flow [2025-03-04 15:26:46,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:26:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:26:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-04 15:26:46,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6170212765957447 [2025-03-04 15:26:46,247 INFO L175 Difference]: Start difference. First operand has 59 places, 91 transitions, 620 flow. Second operand 3 states and 87 transitions. [2025-03-04 15:26:46,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 123 transitions, 1067 flow [2025-03-04 15:26:46,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 123 transitions, 1055 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-04 15:26:46,291 INFO L231 Difference]: Finished difference. Result has 63 places, 88 transitions, 593 flow [2025-03-04 15:26:46,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=593, PETRI_PLACES=63, PETRI_TRANSITIONS=88} [2025-03-04 15:26:46,297 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places. [2025-03-04 15:26:46,297 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 88 transitions, 593 flow [2025-03-04 15:26:46,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:46,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:46,297 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:46,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:26:46,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:26:46,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:46,298 INFO L85 PathProgramCache]: Analyzing trace with hash -635247384, now seen corresponding path program 1 times [2025-03-04 15:26:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:46,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123970322] [2025-03-04 15:26:46,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:46,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:46,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:26:46,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:26:46,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:46,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:26:46,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:46,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123970322] [2025-03-04 15:26:46,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123970322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:46,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054844741] [2025-03-04 15:26:46,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:46,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:46,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:46,409 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:46,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:26:46,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:26:46,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:26:46,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:46,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:46,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:26:46,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:26:46,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:26:46,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054844741] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:46,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:46,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-03-04 15:26:46,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386203746] [2025-03-04 15:26:46,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:46,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:26:46,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:46,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:26:46,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:26:46,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2025-03-04 15:26:46,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 88 transitions, 593 flow. Second operand has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:46,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:46,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2025-03-04 15:26:46,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:47,590 INFO L124 PetriNetUnfolderBase]: 8382/15537 cut-off events. [2025-03-04 15:26:47,591 INFO L125 PetriNetUnfolderBase]: For 60992/60992 co-relation queries the response was YES. [2025-03-04 15:26:47,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50002 conditions, 15537 events. 8382/15537 cut-off events. For 60992/60992 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 126977 event pairs, 568 based on Foata normal form. 2215/16990 useless extension candidates. Maximal degree in co-relation 34350. Up to 4462 conditions per place. [2025-03-04 15:26:47,686 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 81 selfloop transitions, 50 changer transitions 0/148 dead transitions. [2025-03-04 15:26:47,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 148 transitions, 1192 flow [2025-03-04 15:26:47,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:26:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:26:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 222 transitions. [2025-03-04 15:26:47,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904255319148937 [2025-03-04 15:26:47,687 INFO L175 Difference]: Start difference. First operand has 63 places, 88 transitions, 593 flow. Second operand 8 states and 222 transitions. [2025-03-04 15:26:47,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 148 transitions, 1192 flow [2025-03-04 15:26:47,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 148 transitions, 1186 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:47,741 INFO L231 Difference]: Finished difference. Result has 70 places, 108 transitions, 1038 flow [2025-03-04 15:26:47,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1038, PETRI_PLACES=70, PETRI_TRANSITIONS=108} [2025-03-04 15:26:47,741 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2025-03-04 15:26:47,741 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 108 transitions, 1038 flow [2025-03-04 15:26:47,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:47,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:47,742 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:47,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:26:47,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 15:26:47,942 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:26:47,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:47,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1985911630, now seen corresponding path program 1 times [2025-03-04 15:26:47,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:47,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609408288] [2025-03-04 15:26:47,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:47,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:47,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:26:47,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:26:47,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:47,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:48,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:48,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609408288] [2025-03-04 15:26:48,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609408288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:48,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433092925] [2025-03-04 15:26:48,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:48,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:48,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:48,041 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:48,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:26:48,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:26:48,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:26:48,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:48,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:48,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:26:48,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:48,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:48,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433092925] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:48,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:48,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 15:26:48,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293972381] [2025-03-04 15:26:48,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:48,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:26:48,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:48,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:26:48,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:26:48,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2025-03-04 15:26:48,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 108 transitions, 1038 flow. Second operand has 11 states, 11 states have (on average 18.272727272727273) internal successors, (201), 11 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:48,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:48,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2025-03-04 15:26:48,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:51,348 INFO L124 PetriNetUnfolderBase]: 22885/44249 cut-off events. [2025-03-04 15:26:51,348 INFO L125 PetriNetUnfolderBase]: For 328927/328927 co-relation queries the response was YES. [2025-03-04 15:26:51,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155532 conditions, 44249 events. 22885/44249 cut-off events. For 328927/328927 co-relation queries the response was YES. Maximal size of possible extension queue 1350. Compared 418398 event pairs, 490 based on Foata normal form. 5477/46579 useless extension candidates. Maximal degree in co-relation 143395. Up to 7002 conditions per place. [2025-03-04 15:26:51,643 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 193 selfloop transitions, 162 changer transitions 0/372 dead transitions. [2025-03-04 15:26:51,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 372 transitions, 3926 flow [2025-03-04 15:26:51,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:26:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:26:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 374 transitions. [2025-03-04 15:26:51,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.723404255319149 [2025-03-04 15:26:51,644 INFO L175 Difference]: Start difference. First operand has 70 places, 108 transitions, 1038 flow. Second operand 11 states and 374 transitions. [2025-03-04 15:26:51,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 372 transitions, 3926 flow [2025-03-04 15:26:52,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 372 transitions, 3735 flow, removed 93 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:52,389 INFO L231 Difference]: Finished difference. Result has 85 places, 246 transitions, 3340 flow [2025-03-04 15:26:52,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=977, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3340, PETRI_PLACES=85, PETRI_TRANSITIONS=246} [2025-03-04 15:26:52,390 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2025-03-04 15:26:52,390 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 246 transitions, 3340 flow [2025-03-04 15:26:52,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.272727272727273) internal successors, (201), 11 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:52,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:52,390 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:52,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 15:26:52,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:52,591 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:26:52,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:52,591 INFO L85 PathProgramCache]: Analyzing trace with hash -768714160, now seen corresponding path program 1 times [2025-03-04 15:26:52,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:52,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323456776] [2025-03-04 15:26:52,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:52,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:52,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:26:52,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:26:52,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:52,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:52,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:52,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323456776] [2025-03-04 15:26:52,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323456776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:52,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863537404] [2025-03-04 15:26:52,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:52,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:52,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:52,649 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:52,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:26:52,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:26:52,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:26:52,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:52,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:52,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:26:52,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:52,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:52,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863537404] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:52,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:52,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 6 [2025-03-04 15:26:52,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710625146] [2025-03-04 15:26:52,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:52,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:26:52,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:52,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:26:52,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:26:52,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2025-03-04 15:26:52,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 246 transitions, 3340 flow. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:52,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:52,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2025-03-04 15:26:52,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:02,212 INFO L124 PetriNetUnfolderBase]: 60017/114327 cut-off events. [2025-03-04 15:27:02,212 INFO L125 PetriNetUnfolderBase]: For 1100549/1100549 co-relation queries the response was YES. [2025-03-04 15:27:02,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474687 conditions, 114327 events. 60017/114327 cut-off events. For 1100549/1100549 co-relation queries the response was YES. Maximal size of possible extension queue 3316. Compared 1210853 event pairs, 1637 based on Foata normal form. 4817/110513 useless extension candidates. Maximal degree in co-relation 444065. Up to 27828 conditions per place. [2025-03-04 15:27:03,345 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 420 selfloop transitions, 320 changer transitions 0/757 dead transitions. [2025-03-04 15:27:03,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 757 transitions, 11807 flow [2025-03-04 15:27:03,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:27:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:27:03,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 229 transitions. [2025-03-04 15:27:03,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6960486322188449 [2025-03-04 15:27:03,346 INFO L175 Difference]: Start difference. First operand has 85 places, 246 transitions, 3340 flow. Second operand 7 states and 229 transitions. [2025-03-04 15:27:03,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 757 transitions, 11807 flow [2025-03-04 15:27:09,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 757 transitions, 11276 flow, removed 263 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:09,885 INFO L231 Difference]: Finished difference. Result has 94 places, 541 transitions, 9411 flow [2025-03-04 15:27:09,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3191, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9411, PETRI_PLACES=94, PETRI_TRANSITIONS=541} [2025-03-04 15:27:09,888 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 47 predicate places. [2025-03-04 15:27:09,889 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 541 transitions, 9411 flow [2025-03-04 15:27:09,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:09,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:09,889 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:09,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:27:10,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:10,091 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:27:10,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:10,092 INFO L85 PathProgramCache]: Analyzing trace with hash 890887028, now seen corresponding path program 1 times [2025-03-04 15:27:10,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:10,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277293962] [2025-03-04 15:27:10,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:10,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:10,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:27:10,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:27:10,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:10,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:27:10,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:10,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277293962] [2025-03-04 15:27:10,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277293962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:10,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899331611] [2025-03-04 15:27:10,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:10,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:10,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:10,194 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:10,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:27:10,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:27:10,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:27:10,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:10,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:10,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:27:10,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:27:10,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:27:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:27:10,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899331611] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:27:10,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:27:10,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 10 [2025-03-04 15:27:10,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033085217] [2025-03-04 15:27:10,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:27:10,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:27:10,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:10,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:27:10,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:27:10,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2025-03-04 15:27:10,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 541 transitions, 9411 flow. Second operand has 11 states, 11 states have (on average 17.90909090909091) internal successors, (197), 11 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:10,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:10,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2025-03-04 15:27:10,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand