./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_08-tricky_address3.i --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/goblint-regression/06-symbeq_08-tricky_address3.i -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 a812aad62102b8bb20af57f89ce6dbf7fb9ee1fa63f6f8ecf164ccf61d0713cb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:19:59,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:19:59,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:19:59,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:19:59,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:19:59,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:19:59,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:19:59,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:19:59,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:19:59,582 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:19:59,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:19:59,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:19:59,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:19:59,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:19:59,583 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:19:59,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:19:59,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:19:59,584 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:19:59,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:19:59,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:19:59,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:19:59,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:19:59,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:19:59,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:19:59,584 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:19:59,584 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:19:59,584 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:19:59,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:19:59,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:19:59,585 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:19:59,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:19:59,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:19:59,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:19:59,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:19:59,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:19:59,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:19:59,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:19:59,585 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:19:59,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:19:59,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:19:59,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:19:59,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:19:59,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:19:59,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:19:59,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:19:59,586 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 -> a812aad62102b8bb20af57f89ce6dbf7fb9ee1fa63f6f8ecf164ccf61d0713cb [2025-03-04 15:19:59,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:19:59,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:19:59,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:19:59,833 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:19:59,833 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:19:59,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_08-tricky_address3.i [2025-03-04 15:20:00,978 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7063b9f/d23e2954542949e894b027b09ac37403/FLAGcf1d6b16f [2025-03-04 15:20:01,258 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:20:01,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_08-tricky_address3.i [2025-03-04 15:20:01,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7063b9f/d23e2954542949e894b027b09ac37403/FLAGcf1d6b16f [2025-03-04 15:20:01,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7063b9f/d23e2954542949e894b027b09ac37403 [2025-03-04 15:20:01,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:20:01,547 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:20:01,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:20:01,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:20:01,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:20:01,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:20:01" (1/1) ... [2025-03-04 15:20:01,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b94d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:01, skipping insertion in model container [2025-03-04 15:20:01,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:20:01" (1/1) ... [2025-03-04 15:20:01,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:20:01,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:20:01,846 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:20:01,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:20:01,929 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:20:01,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:01 WrapperNode [2025-03-04 15:20:01,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:20:01,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:20:01,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:20:01,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:20:01,936 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:20:01" (1/1) ... [2025-03-04 15:20:01,947 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:20:01" (1/1) ... [2025-03-04 15:20:01,961 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 135 [2025-03-04 15:20:01,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:20:01,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:20:01,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:20:01,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:20:01,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:01" (1/1) ... [2025-03-04 15:20:01,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:01" (1/1) ... [2025-03-04 15:20:01,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:01" (1/1) ... [2025-03-04 15:20:01,981 INFO L175 MemorySlicer]: Split 64 memory accesses to 1 slices as follows [64]. 100 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [60]. The 2 writes are split as follows [2]. [2025-03-04 15:20:01,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:01" (1/1) ... [2025-03-04 15:20:01,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:01" (1/1) ... [2025-03-04 15:20:01,987 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:01" (1/1) ... [2025-03-04 15:20:01,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:01" (1/1) ... [2025-03-04 15:20:01,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:01" (1/1) ... [2025-03-04 15:20:01,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:01" (1/1) ... [2025-03-04 15:20:01,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:20:01,991 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:20:01,991 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:20:01,991 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:20:01,991 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:01" (1/1) ... [2025-03-04 15:20:01,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:20:02,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:02,024 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:20:02,027 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:20:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:20:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:20:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:20:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:20:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:20:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:20:02,044 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:20:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:20:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:20:02,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:20:02,045 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:20:02,162 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:20:02,164 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:20:02,414 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:20:02,414 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:20:02,700 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:20:02,702 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:20:02,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:20:02 BoogieIcfgContainer [2025-03-04 15:20:02,702 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:20:02,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:20:02,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:20:02,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:20:02,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:20:01" (1/3) ... [2025-03-04 15:20:02,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9b8d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:20:02, skipping insertion in model container [2025-03-04 15:20:02,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:01" (2/3) ... [2025-03-04 15:20:02,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9b8d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:20:02, skipping insertion in model container [2025-03-04 15:20:02,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:20:02" (3/3) ... [2025-03-04 15:20:02,712 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_08-tricky_address3.i [2025-03-04 15:20:02,725 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:20:02,728 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_08-tricky_address3.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 8 error locations. [2025-03-04 15:20:02,729 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:20:02,771 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:20:02,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 31 transitions, 66 flow [2025-03-04 15:20:02,856 INFO L124 PetriNetUnfolderBase]: 1/30 cut-off events. [2025-03-04 15:20:02,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:20:02,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 7. Up to 2 conditions per place. [2025-03-04 15:20:02,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 31 transitions, 66 flow [2025-03-04 15:20:02,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 30 transitions, 63 flow [2025-03-04 15:20:02,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:20:02,883 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;@4537e119, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:20:02,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 15:20:02,887 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:20:02,887 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:20:02,888 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:20:02,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:02,889 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:20:02,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:02,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:02,893 INFO L85 PathProgramCache]: Analyzing trace with hash 324556, now seen corresponding path program 1 times [2025-03-04 15:20:02,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:02,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029996070] [2025-03-04 15:20:02,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:02,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:02,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:20:02,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:20:02,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:02,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:03,158 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:20:03,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:03,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029996070] [2025-03-04 15:20:03,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029996070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:03,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:03,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:20:03,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692933028] [2025-03-04 15:20:03,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:03,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:20:03,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:03,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:20:03,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:20:03,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-03-04 15:20:03,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:20:03,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:03,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-03-04 15:20:03,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:03,313 INFO L124 PetriNetUnfolderBase]: 43/144 cut-off events. [2025-03-04 15:20:03,313 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:20:03,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 144 events. 43/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 541 event pairs, 42 based on Foata normal form. 1/129 useless extension candidates. Maximal degree in co-relation 230. Up to 105 conditions per place. [2025-03-04 15:20:03,316 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 19 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-03-04 15:20:03,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 111 flow [2025-03-04 15:20:03,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:20:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:20:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-03-04 15:20:03,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5564516129032258 [2025-03-04 15:20:03,329 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 63 flow. Second operand 4 states and 69 transitions. [2025-03-04 15:20:03,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 111 flow [2025-03-04 15:20:03,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:03,336 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 86 flow [2025-03-04 15:20:03,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-03-04 15:20:03,341 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2025-03-04 15:20:03,341 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 86 flow [2025-03-04 15:20:03,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:20:03,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:03,341 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:20:03,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:20:03,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:03,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1079195476, now seen corresponding path program 1 times [2025-03-04 15:20:03,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:03,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967802386] [2025-03-04 15:20:03,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:03,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:20:03,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:20:03,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:03,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:03,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:03,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967802386] [2025-03-04 15:20:03,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967802386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:03,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501366051] [2025-03-04 15:20:03,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:03,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:03,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:03,462 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:20:03,464 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:20:03,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:20:03,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:20:03,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:03,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:03,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:20:03,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:03,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:20:03,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501366051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:03,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:20:03,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:20:03,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295655933] [2025-03-04 15:20:03,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:03,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:20:03,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:03,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:20:03,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:20:03,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-03-04 15:20:03,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 86 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:20:03,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:03,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-03-04 15:20:03,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:03,684 INFO L124 PetriNetUnfolderBase]: 43/143 cut-off events. [2025-03-04 15:20:03,684 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:20:03,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 143 events. 43/143 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 536 event pairs, 42 based on Foata normal form. 1/128 useless extension candidates. Maximal degree in co-relation 247. Up to 100 conditions per place. [2025-03-04 15:20:03,685 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 15 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2025-03-04 15:20:03,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 124 flow [2025-03-04 15:20:03,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:20:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:20:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-03-04 15:20:03,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2025-03-04 15:20:03,690 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 86 flow. Second operand 6 states and 88 transitions. [2025-03-04 15:20:03,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 124 flow [2025-03-04 15:20:03,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:03,691 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 92 flow [2025-03-04 15:20:03,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2025-03-04 15:20:03,692 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2025-03-04 15:20:03,692 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 92 flow [2025-03-04 15:20:03,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:20:03,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:03,692 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:20:03,701 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:20:03,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:03,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:03,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:03,894 INFO L85 PathProgramCache]: Analyzing trace with hash -904678329, now seen corresponding path program 1 times [2025-03-04 15:20:03,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:03,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879829990] [2025-03-04 15:20:03,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:03,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:03,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:20:03,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:20:03,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:03,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:03,971 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:20:03,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:03,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879829990] [2025-03-04 15:20:03,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879829990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:03,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:03,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:20:03,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053482973] [2025-03-04 15:20:03,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:03,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:20:03,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:03,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:20:03,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:20:03,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-03-04 15:20:03,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:03,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:03,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-03-04 15:20:03,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:04,037 INFO L124 PetriNetUnfolderBase]: 43/142 cut-off events. [2025-03-04 15:20:04,038 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 15:20:04,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 142 events. 43/142 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 530 event pairs, 42 based on Foata normal form. 1/128 useless extension candidates. Maximal degree in co-relation 243. Up to 103 conditions per place. [2025-03-04 15:20:04,039 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 16 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2025-03-04 15:20:04,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 128 flow [2025-03-04 15:20:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:20:04,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:20:04,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-03-04 15:20:04,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2025-03-04 15:20:04,041 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 92 flow. Second operand 3 states and 52 transitions. [2025-03-04 15:20:04,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 128 flow [2025-03-04 15:20:04,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 106 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:20:04,043 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 74 flow [2025-03-04 15:20:04,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-03-04 15:20:04,045 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2025-03-04 15:20:04,045 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 74 flow [2025-03-04 15:20:04,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:04,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:04,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:04,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:20:04,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:04,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:04,045 INFO L85 PathProgramCache]: Analyzing trace with hash -290035751, now seen corresponding path program 1 times [2025-03-04 15:20:04,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:04,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800942936] [2025-03-04 15:20:04,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:04,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:04,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:20:04,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:20:04,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:04,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:04,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:04,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800942936] [2025-03-04 15:20:04,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800942936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:04,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917396610] [2025-03-04 15:20:04,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:04,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:04,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:04,152 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:20:04,154 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:20:04,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:20:04,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:20:04,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:04,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:04,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:20:04,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:04,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:04,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:04,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917396610] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:04,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:04,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:20:04,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297088580] [2025-03-04 15:20:04,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:04,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:20:04,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:04,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:20:04,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:20:04,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-03-04 15:20:04,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 74 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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:20:04,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:04,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-03-04 15:20:04,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:04,407 INFO L124 PetriNetUnfolderBase]: 43/146 cut-off events. [2025-03-04 15:20:04,407 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 15:20:04,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 146 events. 43/146 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 527 event pairs, 42 based on Foata normal form. 2/134 useless extension candidates. Maximal degree in co-relation 236. Up to 101 conditions per place. [2025-03-04 15:20:04,408 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 16 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2025-03-04 15:20:04,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 135 flow [2025-03-04 15:20:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:20:04,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:20:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2025-03-04 15:20:04,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4700460829493088 [2025-03-04 15:20:04,409 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 74 flow. Second operand 7 states and 102 transitions. [2025-03-04 15:20:04,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 135 flow [2025-03-04 15:20:04,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 121 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:04,410 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 100 flow [2025-03-04 15:20:04,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=100, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2025-03-04 15:20:04,411 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2025-03-04 15:20:04,411 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 100 flow [2025-03-04 15:20:04,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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:20:04,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:04,411 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:04,417 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:20:04,611 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,SelfDestructingSolverStorable3 [2025-03-04 15:20:04,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:04,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:04,612 INFO L85 PathProgramCache]: Analyzing trace with hash 605820121, now seen corresponding path program 2 times [2025-03-04 15:20:04,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:04,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117382773] [2025-03-04 15:20:04,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:04,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:04,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:20:04,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 16 statements. [2025-03-04 15:20:04,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:04,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:20:04,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:04,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117382773] [2025-03-04 15:20:04,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117382773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:04,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:04,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:04,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879132164] [2025-03-04 15:20:04,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:04,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:20:04,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:04,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:20:04,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:20:04,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-03-04 15:20:04,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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:20:04,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:04,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-03-04 15:20:04,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:04,757 INFO L124 PetriNetUnfolderBase]: 49/145 cut-off events. [2025-03-04 15:20:04,759 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 15:20:04,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 145 events. 49/145 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 489 event pairs, 15 based on Foata normal form. 7/140 useless extension candidates. Maximal degree in co-relation 250. Up to 78 conditions per place. [2025-03-04 15:20:04,761 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 33 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-03-04 15:20:04,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 194 flow [2025-03-04 15:20:04,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:20:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:20:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-04 15:20:04,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2025-03-04 15:20:04,762 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 100 flow. Second operand 4 states and 76 transitions. [2025-03-04 15:20:04,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 194 flow [2025-03-04 15:20:04,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:04,763 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 100 flow [2025-03-04 15:20:04,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2025-03-04 15:20:04,765 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2025-03-04 15:20:04,765 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 100 flow [2025-03-04 15:20:04,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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:20:04,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:04,766 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:04,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:20:04,766 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:04,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:04,766 INFO L85 PathProgramCache]: Analyzing trace with hash 605674058, now seen corresponding path program 1 times [2025-03-04 15:20:04,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:04,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367755431] [2025-03-04 15:20:04,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:04,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:04,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:20:04,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:20:04,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:04,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:04,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:04,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367755431] [2025-03-04 15:20:04,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367755431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:04,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041373865] [2025-03-04 15:20:04,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:04,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:04,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:04,923 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:20:04,924 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:20:04,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:20:04,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:20:04,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:04,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:04,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:20:04,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:05,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:05,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041373865] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:05,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:05,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:20:05,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322363588] [2025-03-04 15:20:05,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:05,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:20:05,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:05,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:20:05,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:20:05,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-03-04 15:20:05,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 100 flow. Second operand has 18 states, 18 states have (on average 12.277777777777779) internal successors, (221), 18 states have internal predecessors, (221), 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:20:05,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:05,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-03-04 15:20:05,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:05,289 INFO L124 PetriNetUnfolderBase]: 43/156 cut-off events. [2025-03-04 15:20:05,289 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-04 15:20:05,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 156 events. 43/156 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 509 event pairs, 42 based on Foata normal form. 4/150 useless extension candidates. Maximal degree in co-relation 257. Up to 101 conditions per place. [2025-03-04 15:20:05,290 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 16 selfloop transitions, 15 changer transitions 0/40 dead transitions. [2025-03-04 15:20:05,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 40 transitions, 210 flow [2025-03-04 15:20:05,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:20:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:20:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 200 transitions. [2025-03-04 15:20:05,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2025-03-04 15:20:05,292 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 100 flow. Second operand 15 states and 200 transitions. [2025-03-04 15:20:05,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 40 transitions, 210 flow [2025-03-04 15:20:05,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 40 transitions, 204 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:20:05,294 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 191 flow [2025-03-04 15:20:05,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=191, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2025-03-04 15:20:05,294 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2025-03-04 15:20:05,295 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 191 flow [2025-03-04 15:20:05,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.277777777777779) internal successors, (221), 18 states have internal predecessors, (221), 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:20:05,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:05,295 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:05,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:20:05,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:05,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:05,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:05,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1628697674, now seen corresponding path program 2 times [2025-03-04 15:20:05,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:05,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972674264] [2025-03-04 15:20:05,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:05,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:05,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 15:20:05,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 28 statements. [2025-03-04 15:20:05,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:05,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:20:06,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:06,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972674264] [2025-03-04 15:20:06,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972674264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:06,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:06,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:06,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103616248] [2025-03-04 15:20:06,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:06,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:20:06,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:06,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:20:06,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:20:06,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-03-04 15:20:06,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:20:06,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:06,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-03-04 15:20:06,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:06,432 INFO L124 PetriNetUnfolderBase]: 49/160 cut-off events. [2025-03-04 15:20:06,433 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-04 15:20:06,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 160 events. 49/160 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 470 event pairs, 20 based on Foata normal form. 8/162 useless extension candidates. Maximal degree in co-relation 259. Up to 79 conditions per place. [2025-03-04 15:20:06,436 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 39 selfloop transitions, 5 changer transitions 6/57 dead transitions. [2025-03-04 15:20:06,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 325 flow [2025-03-04 15:20:06,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:20:06,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:20:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2025-03-04 15:20:06,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5752688172043011 [2025-03-04 15:20:06,437 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 191 flow. Second operand 6 states and 107 transitions. [2025-03-04 15:20:06,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 325 flow [2025-03-04 15:20:06,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 57 transitions, 315 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:20:06,439 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 208 flow [2025-03-04 15:20:06,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2025-03-04 15:20:06,442 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2025-03-04 15:20:06,442 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 208 flow [2025-03-04 15:20:06,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:20:06,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:06,442 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:06,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:20:06,442 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:06,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:06,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1045451414, now seen corresponding path program 1 times [2025-03-04 15:20:06,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:06,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222362268] [2025-03-04 15:20:06,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:06,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:06,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 15:20:06,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 15:20:06,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:06,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:20:06,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:06,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222362268] [2025-03-04 15:20:06,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222362268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:06,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:06,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:06,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031860544] [2025-03-04 15:20:06,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:06,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:20:06,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:06,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:20:06,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:20:06,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-03-04 15:20:06,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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:20:06,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:06,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-03-04 15:20:06,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:06,594 INFO L124 PetriNetUnfolderBase]: 33/127 cut-off events. [2025-03-04 15:20:06,594 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-03-04 15:20:06,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 127 events. 33/127 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 358 event pairs, 14 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 299. Up to 58 conditions per place. [2025-03-04 15:20:06,595 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 41 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2025-03-04 15:20:06,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 332 flow [2025-03-04 15:20:06,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:20:06,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:20:06,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-03-04 15:20:06,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6048387096774194 [2025-03-04 15:20:06,596 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 208 flow. Second operand 4 states and 75 transitions. [2025-03-04 15:20:06,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 52 transitions, 332 flow [2025-03-04 15:20:06,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 321 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 15:20:06,600 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 203 flow [2025-03-04 15:20:06,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2025-03-04 15:20:06,603 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2025-03-04 15:20:06,603 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 203 flow [2025-03-04 15:20:06,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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:20:06,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:06,603 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:06,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:20:06,603 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:06,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:06,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1950744890, now seen corresponding path program 1 times [2025-03-04 15:20:06,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:06,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362739845] [2025-03-04 15:20:06,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:06,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:06,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:20:06,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:20:06,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:06,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:06,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:06,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362739845] [2025-03-04 15:20:06,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362739845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:06,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224942552] [2025-03-04 15:20:06,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:06,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:06,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:06,839 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:20:06,840 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:20:06,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:20:06,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:20:06,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:06,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:06,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:20:06,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:06,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:07,096 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:07,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224942552] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:07,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:07,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-03-04 15:20:07,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649529661] [2025-03-04 15:20:07,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:07,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:20:07,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:07,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:20:07,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:20:07,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-03-04 15:20:07,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 203 flow. Second operand has 23 states, 23 states have (on average 12.304347826086957) internal successors, (283), 23 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:07,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:07,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-03-04 15:20:07,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:07,318 INFO L124 PetriNetUnfolderBase]: 33/144 cut-off events. [2025-03-04 15:20:07,319 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-03-04 15:20:07,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 144 events. 33/144 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 398 event pairs, 32 based on Foata normal form. 3/141 useless extension candidates. Maximal degree in co-relation 249. Up to 82 conditions per place. [2025-03-04 15:20:07,320 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 17 selfloop transitions, 21 changer transitions 0/46 dead transitions. [2025-03-04 15:20:07,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 46 transitions, 333 flow [2025-03-04 15:20:07,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:20:07,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:20:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 271 transitions. [2025-03-04 15:20:07,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4162826420890937 [2025-03-04 15:20:07,321 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 203 flow. Second operand 21 states and 271 transitions. [2025-03-04 15:20:07,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 46 transitions, 333 flow [2025-03-04 15:20:07,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 46 transitions, 327 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:20:07,323 INFO L231 Difference]: Finished difference. Result has 78 places, 46 transitions, 308 flow [2025-03-04 15:20:07,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=308, PETRI_PLACES=78, PETRI_TRANSITIONS=46} [2025-03-04 15:20:07,324 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 45 predicate places. [2025-03-04 15:20:07,324 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 46 transitions, 308 flow [2025-03-04 15:20:07,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.304347826086957) internal successors, (283), 23 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:07,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:07,324 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:07,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:20:07,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:07,525 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:07,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:07,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1380353102, now seen corresponding path program 2 times [2025-03-04 15:20:07,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:07,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190062256] [2025-03-04 15:20:07,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:07,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:07,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 15:20:07,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 39 statements. [2025-03-04 15:20:07,578 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:07,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:07,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:07,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190062256] [2025-03-04 15:20:07,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190062256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:07,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:07,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:07,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597485217] [2025-03-04 15:20:07,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:07,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:20:07,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:07,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:20:07,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:20:07,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-03-04 15:20:07,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 46 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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:20:07,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:07,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-03-04 15:20:07,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:08,077 INFO L124 PetriNetUnfolderBase]: 36/145 cut-off events. [2025-03-04 15:20:08,077 INFO L125 PetriNetUnfolderBase]: For 175/175 co-relation queries the response was YES. [2025-03-04 15:20:08,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 145 events. 36/145 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 387 event pairs, 8 based on Foata normal form. 14/159 useless extension candidates. Maximal degree in co-relation 258. Up to 57 conditions per place. [2025-03-04 15:20:08,078 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 46 selfloop transitions, 6 changer transitions 4/62 dead transitions. [2025-03-04 15:20:08,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 62 transitions, 464 flow [2025-03-04 15:20:08,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:20:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:20:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2025-03-04 15:20:08,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5752688172043011 [2025-03-04 15:20:08,079 INFO L175 Difference]: Start difference. First operand has 78 places, 46 transitions, 308 flow. Second operand 6 states and 107 transitions. [2025-03-04 15:20:08,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 62 transitions, 464 flow [2025-03-04 15:20:08,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 62 transitions, 421 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-03-04 15:20:08,081 INFO L231 Difference]: Finished difference. Result has 74 places, 49 transitions, 305 flow [2025-03-04 15:20:08,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=74, PETRI_TRANSITIONS=49} [2025-03-04 15:20:08,083 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 41 predicate places. [2025-03-04 15:20:08,083 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 49 transitions, 305 flow [2025-03-04 15:20:08,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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:20:08,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:08,084 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:08,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:20:08,084 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:08,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:08,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1627081028, now seen corresponding path program 1 times [2025-03-04 15:20:08,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:08,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313887334] [2025-03-04 15:20:08,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:08,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:08,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:20:08,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:20:08,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:08,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:12,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:12,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313887334] [2025-03-04 15:20:12,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313887334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:12,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:12,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 15:20:12,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418975723] [2025-03-04 15:20:12,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:12,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:20:12,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:12,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:20:12,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:20:12,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-03-04 15:20:12,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 49 transitions, 305 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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:20:12,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:12,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-03-04 15:20:12,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:13,839 INFO L124 PetriNetUnfolderBase]: 71/217 cut-off events. [2025-03-04 15:20:13,840 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2025-03-04 15:20:13,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 217 events. 71/217 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 725 event pairs, 12 based on Foata normal form. 3/220 useless extension candidates. Maximal degree in co-relation 577. Up to 45 conditions per place. [2025-03-04 15:20:13,841 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 67 selfloop transitions, 21 changer transitions 6/96 dead transitions. [2025-03-04 15:20:13,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 96 transitions, 654 flow [2025-03-04 15:20:13,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 15:20:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 15:20:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 188 transitions. [2025-03-04 15:20:13,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2025-03-04 15:20:13,843 INFO L175 Difference]: Start difference. First operand has 74 places, 49 transitions, 305 flow. Second operand 16 states and 188 transitions. [2025-03-04 15:20:13,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 96 transitions, 654 flow [2025-03-04 15:20:13,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 96 transitions, 639 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:13,846 INFO L231 Difference]: Finished difference. Result has 92 places, 64 transitions, 438 flow [2025-03-04 15:20:13,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=438, PETRI_PLACES=92, PETRI_TRANSITIONS=64} [2025-03-04 15:20:13,850 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 59 predicate places. [2025-03-04 15:20:13,850 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 64 transitions, 438 flow [2025-03-04 15:20:13,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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:20:13,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:13,850 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:13,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:20:13,851 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:13,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:13,852 INFO L85 PathProgramCache]: Analyzing trace with hash 91577526, now seen corresponding path program 2 times [2025-03-04 15:20:13,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:13,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880758303] [2025-03-04 15:20:13,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:13,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:13,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 15:20:13,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-03-04 15:20:13,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:13,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:16,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:16,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880758303] [2025-03-04 15:20:16,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880758303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:16,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:16,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:20:16,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818545905] [2025-03-04 15:20:16,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:16,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:20:16,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:16,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:20:16,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:20:16,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-03-04 15:20:16,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 64 transitions, 438 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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:20:16,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:16,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-03-04 15:20:16,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:17,653 INFO L124 PetriNetUnfolderBase]: 69/256 cut-off events. [2025-03-04 15:20:17,653 INFO L125 PetriNetUnfolderBase]: For 495/498 co-relation queries the response was YES. [2025-03-04 15:20:17,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 256 events. 69/256 cut-off events. For 495/498 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1106 event pairs, 14 based on Foata normal form. 6/261 useless extension candidates. Maximal degree in co-relation 714. Up to 58 conditions per place. [2025-03-04 15:20:17,654 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 60 selfloop transitions, 21 changer transitions 3/90 dead transitions. [2025-03-04 15:20:17,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 90 transitions, 725 flow [2025-03-04 15:20:17,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:20:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:20:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2025-03-04 15:20:17,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45483870967741935 [2025-03-04 15:20:17,655 INFO L175 Difference]: Start difference. First operand has 92 places, 64 transitions, 438 flow. Second operand 10 states and 141 transitions. [2025-03-04 15:20:17,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 90 transitions, 725 flow [2025-03-04 15:20:17,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 90 transitions, 695 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 15:20:17,659 INFO L231 Difference]: Finished difference. Result has 102 places, 71 transitions, 551 flow [2025-03-04 15:20:17,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=551, PETRI_PLACES=102, PETRI_TRANSITIONS=71} [2025-03-04 15:20:17,660 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 69 predicate places. [2025-03-04 15:20:17,660 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 71 transitions, 551 flow [2025-03-04 15:20:17,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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:20:17,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:17,660 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:17,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:20:17,661 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:17,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:17,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1487537480, now seen corresponding path program 1 times [2025-03-04 15:20:17,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:17,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511520105] [2025-03-04 15:20:17,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:17,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:17,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:20:17,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:20:17,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:17,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:20,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:20,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511520105] [2025-03-04 15:20:20,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511520105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:20,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:20,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 15:20:20,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198577058] [2025-03-04 15:20:20,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:20,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:20:20,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:20,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:20:20,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:20:20,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-03-04 15:20:20,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 71 transitions, 551 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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:20:20,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:20,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-03-04 15:20:20,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:20,981 INFO L124 PetriNetUnfolderBase]: 80/274 cut-off events. [2025-03-04 15:20:20,981 INFO L125 PetriNetUnfolderBase]: For 664/671 co-relation queries the response was YES. [2025-03-04 15:20:20,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 274 events. 80/274 cut-off events. For 664/671 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1169 event pairs, 30 based on Foata normal form. 10/284 useless extension candidates. Maximal degree in co-relation 822. Up to 149 conditions per place. [2025-03-04 15:20:20,983 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 61 selfloop transitions, 34 changer transitions 2/101 dead transitions. [2025-03-04 15:20:20,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 101 transitions, 880 flow [2025-03-04 15:20:20,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 15:20:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 15:20:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 192 transitions. [2025-03-04 15:20:20,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2025-03-04 15:20:20,985 INFO L175 Difference]: Start difference. First operand has 102 places, 71 transitions, 551 flow. Second operand 16 states and 192 transitions. [2025-03-04 15:20:20,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 101 transitions, 880 flow [2025-03-04 15:20:20,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 101 transitions, 865 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:20,991 INFO L231 Difference]: Finished difference. Result has 118 places, 84 transitions, 719 flow [2025-03-04 15:20:20,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=719, PETRI_PLACES=118, PETRI_TRANSITIONS=84} [2025-03-04 15:20:20,993 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 85 predicate places. [2025-03-04 15:20:20,993 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 84 transitions, 719 flow [2025-03-04 15:20:20,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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:20:20,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:20,994 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:20,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:20:20,994 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:20,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:20,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1039843196, now seen corresponding path program 2 times [2025-03-04 15:20:20,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:20,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909899214] [2025-03-04 15:20:20,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:20,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:21,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 15:20:21,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-03-04 15:20:21,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:21,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:25,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:25,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909899214] [2025-03-04 15:20:25,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909899214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:25,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:25,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 15:20:25,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448056265] [2025-03-04 15:20:25,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:25,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:20:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:25,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:20:25,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:20:25,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-03-04 15:20:25,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 84 transitions, 719 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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:20:25,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:25,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-03-04 15:20:25,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:26,924 INFO L124 PetriNetUnfolderBase]: 94/303 cut-off events. [2025-03-04 15:20:26,924 INFO L125 PetriNetUnfolderBase]: For 853/856 co-relation queries the response was YES. [2025-03-04 15:20:26,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 303 events. 94/303 cut-off events. For 853/856 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1328 event pairs, 36 based on Foata normal form. 4/307 useless extension candidates. Maximal degree in co-relation 1064. Up to 157 conditions per place. [2025-03-04 15:20:26,926 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 68 selfloop transitions, 37 changer transitions 2/109 dead transitions. [2025-03-04 15:20:26,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 109 transitions, 1045 flow [2025-03-04 15:20:26,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:20:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 15:20:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 193 transitions. [2025-03-04 15:20:26,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34587813620071683 [2025-03-04 15:20:26,929 INFO L175 Difference]: Start difference. First operand has 118 places, 84 transitions, 719 flow. Second operand 18 states and 193 transitions. [2025-03-04 15:20:26,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 109 transitions, 1045 flow [2025-03-04 15:20:26,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 109 transitions, 984 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-04 15:20:26,936 INFO L231 Difference]: Finished difference. Result has 133 places, 90 transitions, 804 flow [2025-03-04 15:20:26,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=804, PETRI_PLACES=133, PETRI_TRANSITIONS=90} [2025-03-04 15:20:26,936 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 100 predicate places. [2025-03-04 15:20:26,936 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 90 transitions, 804 flow [2025-03-04 15:20:26,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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:20:26,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:26,937 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:26,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:20:26,937 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:26,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:26,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1040881076, now seen corresponding path program 3 times [2025-03-04 15:20:26,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:26,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331774527] [2025-03-04 15:20:26,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:20:26,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:26,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 11 equivalence classes. [2025-03-04 15:20:26,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-03-04 15:20:26,964 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:20:26,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:31,101 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:31,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:31,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331774527] [2025-03-04 15:20:31,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331774527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:31,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:31,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 15:20:31,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160024850] [2025-03-04 15:20:31,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:31,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:20:31,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:31,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:20:31,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:20:31,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-03-04 15:20:31,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 90 transitions, 804 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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:20:31,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:31,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-03-04 15:20:31,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:32,424 INFO L124 PetriNetUnfolderBase]: 99/316 cut-off events. [2025-03-04 15:20:32,424 INFO L125 PetriNetUnfolderBase]: For 942/945 co-relation queries the response was YES. [2025-03-04 15:20:32,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1257 conditions, 316 events. 99/316 cut-off events. For 942/945 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1425 event pairs, 31 based on Foata normal form. 4/320 useless extension candidates. Maximal degree in co-relation 1150. Up to 153 conditions per place. [2025-03-04 15:20:32,428 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 74 selfloop transitions, 43 changer transitions 0/119 dead transitions. [2025-03-04 15:20:32,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 119 transitions, 1180 flow [2025-03-04 15:20:32,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:20:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:20:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 189 transitions. [2025-03-04 15:20:32,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3586337760910816 [2025-03-04 15:20:32,430 INFO L175 Difference]: Start difference. First operand has 133 places, 90 transitions, 804 flow. Second operand 17 states and 189 transitions. [2025-03-04 15:20:32,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 119 transitions, 1180 flow [2025-03-04 15:20:32,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 119 transitions, 1105 flow, removed 19 selfloop flow, removed 8 redundant places. [2025-03-04 15:20:32,437 INFO L231 Difference]: Finished difference. Result has 144 places, 98 transitions, 917 flow [2025-03-04 15:20:32,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=917, PETRI_PLACES=144, PETRI_TRANSITIONS=98} [2025-03-04 15:20:32,438 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 111 predicate places. [2025-03-04 15:20:32,438 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 98 transitions, 917 flow [2025-03-04 15:20:32,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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:20:32,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:32,438 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:32,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:20:32,438 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:32,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:32,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1010350106, now seen corresponding path program 4 times [2025-03-04 15:20:32,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:32,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826086733] [2025-03-04 15:20:32,439 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:20:32,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:32,447 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-04 15:20:32,482 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:20:32,482 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:20:32,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:36,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:36,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826086733] [2025-03-04 15:20:36,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826086733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:36,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:36,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:20:36,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969403983] [2025-03-04 15:20:36,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:36,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:20:36,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:36,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:20:36,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:20:36,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-03-04 15:20:36,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 98 transitions, 917 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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:20:36,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:36,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-03-04 15:20:36,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:37,731 INFO L124 PetriNetUnfolderBase]: 107/347 cut-off events. [2025-03-04 15:20:37,732 INFO L125 PetriNetUnfolderBase]: For 1205/1208 co-relation queries the response was YES. [2025-03-04 15:20:37,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 347 events. 107/347 cut-off events. For 1205/1208 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1669 event pairs, 31 based on Foata normal form. 6/353 useless extension candidates. Maximal degree in co-relation 1332. Up to 123 conditions per place. [2025-03-04 15:20:37,734 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 83 selfloop transitions, 46 changer transitions 0/131 dead transitions. [2025-03-04 15:20:37,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 131 transitions, 1345 flow [2025-03-04 15:20:37,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 15:20:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 15:20:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 222 transitions. [2025-03-04 15:20:37,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2025-03-04 15:20:37,736 INFO L175 Difference]: Start difference. First operand has 144 places, 98 transitions, 917 flow. Second operand 20 states and 222 transitions. [2025-03-04 15:20:37,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 131 transitions, 1345 flow [2025-03-04 15:20:37,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 131 transitions, 1278 flow, removed 6 selfloop flow, removed 10 redundant places. [2025-03-04 15:20:37,743 INFO L231 Difference]: Finished difference. Result has 157 places, 104 transitions, 1016 flow [2025-03-04 15:20:37,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1016, PETRI_PLACES=157, PETRI_TRANSITIONS=104} [2025-03-04 15:20:37,744 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 124 predicate places. [2025-03-04 15:20:37,744 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 104 transitions, 1016 flow [2025-03-04 15:20:37,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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:20:37,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:37,744 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:37,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:20:37,744 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:37,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:37,745 INFO L85 PathProgramCache]: Analyzing trace with hash 945539606, now seen corresponding path program 5 times [2025-03-04 15:20:37,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:37,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949596196] [2025-03-04 15:20:37,745 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:20:37,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:37,753 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 11 equivalence classes. [2025-03-04 15:20:37,780 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:20:37,780 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 15:20:37,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 15:20:38,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:38,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949596196] [2025-03-04 15:20:38,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949596196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:38,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140379151] [2025-03-04 15:20:38,979 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:20:38,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:38,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:38,982 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:20:38,983 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:20:39,036 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 11 equivalence classes. [2025-03-04 15:20:39,125 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:20:39,125 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 15:20:39,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:39,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-04 15:20:39,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:40,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-04 15:20:40,679 INFO L349 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2025-03-04 15:20:40,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2025-03-04 15:20:40,971 INFO L349 Elim1Store]: treesize reduction 176, result has 40.9 percent of original size [2025-03-04 15:20:40,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 56 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 66 case distinctions, treesize of input 93 treesize of output 155 [2025-03-04 15:20:41,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:20:41,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 56 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 535 treesize of output 349 [2025-03-04 15:20:42,447 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:20:42,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:42,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-04 15:20:42,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-04 15:20:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:42,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140379151] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:42,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:20:42,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 25] total 37 [2025-03-04 15:20:42,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067871223] [2025-03-04 15:20:42,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:42,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:20:42,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:42,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:20:42,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 15:20:42,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2025-03-04 15:20:42,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 104 transitions, 1016 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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:20:42,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:42,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2025-03-04 15:20:42,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:43,483 INFO L124 PetriNetUnfolderBase]: 101/360 cut-off events. [2025-03-04 15:20:43,483 INFO L125 PetriNetUnfolderBase]: For 1552/1554 co-relation queries the response was YES. [2025-03-04 15:20:43,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 360 events. 101/360 cut-off events. For 1552/1554 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1894 event pairs, 20 based on Foata normal form. 5/365 useless extension candidates. Maximal degree in co-relation 1497. Up to 54 conditions per place. [2025-03-04 15:20:43,486 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 93 selfloop transitions, 46 changer transitions 0/149 dead transitions. [2025-03-04 15:20:43,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 149 transitions, 1610 flow [2025-03-04 15:20:43,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:20:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:20:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 178 transitions. [2025-03-04 15:20:43,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.478494623655914 [2025-03-04 15:20:43,488 INFO L175 Difference]: Start difference. First operand has 157 places, 104 transitions, 1016 flow. Second operand 12 states and 178 transitions. [2025-03-04 15:20:43,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 149 transitions, 1610 flow [2025-03-04 15:20:43,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 149 transitions, 1531 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-03-04 15:20:43,497 INFO L231 Difference]: Finished difference. Result has 161 places, 115 transitions, 1190 flow [2025-03-04 15:20:43,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1190, PETRI_PLACES=161, PETRI_TRANSITIONS=115} [2025-03-04 15:20:43,498 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 128 predicate places. [2025-03-04 15:20:43,498 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 115 transitions, 1190 flow [2025-03-04 15:20:43,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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:20:43,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:43,499 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:43,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:20:43,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 15:20:43,699 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:43,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:43,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1036916622, now seen corresponding path program 3 times [2025-03-04 15:20:43,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:43,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532353512] [2025-03-04 15:20:43,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:20:43,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:43,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 11 equivalence classes. [2025-03-04 15:20:43,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-03-04 15:20:43,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:20:43,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:47,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:47,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532353512] [2025-03-04 15:20:47,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532353512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:47,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:47,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:20:47,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094923532] [2025-03-04 15:20:47,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:47,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:20:47,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:47,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:20:47,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:20:47,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-03-04 15:20:47,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 115 transitions, 1190 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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:20:47,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:47,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-03-04 15:20:47,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:48,212 INFO L124 PetriNetUnfolderBase]: 155/484 cut-off events. [2025-03-04 15:20:48,212 INFO L125 PetriNetUnfolderBase]: For 1892/1894 co-relation queries the response was YES. [2025-03-04 15:20:48,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2182 conditions, 484 events. 155/484 cut-off events. For 1892/1894 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2718 event pairs, 41 based on Foata normal form. 6/490 useless extension candidates. Maximal degree in co-relation 2052. Up to 186 conditions per place. [2025-03-04 15:20:48,226 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 108 selfloop transitions, 38 changer transitions 0/148 dead transitions. [2025-03-04 15:20:48,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 148 transitions, 1670 flow [2025-03-04 15:20:48,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:20:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:20:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 167 transitions. [2025-03-04 15:20:48,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3847926267281106 [2025-03-04 15:20:48,229 INFO L175 Difference]: Start difference. First operand has 161 places, 115 transitions, 1190 flow. Second operand 14 states and 167 transitions. [2025-03-04 15:20:48,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 148 transitions, 1670 flow [2025-03-04 15:20:48,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 148 transitions, 1654 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:48,254 INFO L231 Difference]: Finished difference. Result has 178 places, 122 transitions, 1392 flow [2025-03-04 15:20:48,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1392, PETRI_PLACES=178, PETRI_TRANSITIONS=122} [2025-03-04 15:20:48,256 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 145 predicate places. [2025-03-04 15:20:48,256 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 122 transitions, 1392 flow [2025-03-04 15:20:48,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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:20:48,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:48,256 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:48,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:20:48,256 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:48,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:48,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1976684140, now seen corresponding path program 4 times [2025-03-04 15:20:48,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:48,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785316453] [2025-03-04 15:20:48,261 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:20:48,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:48,290 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-04 15:20:48,560 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:20:48,560 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:20:48,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:53,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:53,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785316453] [2025-03-04 15:20:53,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785316453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:53,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:53,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 15:20:53,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688717092] [2025-03-04 15:20:53,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:53,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:20:53,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:53,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:20:53,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:20:53,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-03-04 15:20:53,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 122 transitions, 1392 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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:20:53,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:53,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-03-04 15:20:53,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:54,419 INFO L124 PetriNetUnfolderBase]: 168/523 cut-off events. [2025-03-04 15:20:54,419 INFO L125 PetriNetUnfolderBase]: For 2557/2559 co-relation queries the response was YES. [2025-03-04 15:20:54,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2399 conditions, 523 events. 168/523 cut-off events. For 2557/2559 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3051 event pairs, 43 based on Foata normal form. 6/529 useless extension candidates. Maximal degree in co-relation 2264. Up to 227 conditions per place. [2025-03-04 15:20:54,427 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 106 selfloop transitions, 43 changer transitions 0/151 dead transitions. [2025-03-04 15:20:54,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 151 transitions, 1833 flow [2025-03-04 15:20:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:20:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:20:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 170 transitions. [2025-03-04 15:20:54,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2025-03-04 15:20:54,431 INFO L175 Difference]: Start difference. First operand has 178 places, 122 transitions, 1392 flow. Second operand 15 states and 170 transitions. [2025-03-04 15:20:54,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 151 transitions, 1833 flow [2025-03-04 15:20:54,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 151 transitions, 1784 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-04 15:20:54,453 INFO L231 Difference]: Finished difference. Result has 189 places, 127 transitions, 1527 flow [2025-03-04 15:20:54,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1527, PETRI_PLACES=189, PETRI_TRANSITIONS=127} [2025-03-04 15:20:54,457 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 156 predicate places. [2025-03-04 15:20:54,457 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 127 transitions, 1527 flow [2025-03-04 15:20:54,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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:20:54,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:54,457 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:54,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:20:54,458 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:54,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:54,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1662386742, now seen corresponding path program 5 times [2025-03-04 15:20:54,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:54,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859775778] [2025-03-04 15:20:54,459 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:20:54,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:54,472 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 11 equivalence classes. [2025-03-04 15:20:54,532 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:20:54,532 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 15:20:54,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:55,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:55,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859775778] [2025-03-04 15:20:55,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859775778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:55,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:55,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:55,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812922203] [2025-03-04 15:20:55,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:55,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:55,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:55,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:55,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:55,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-03-04 15:20:55,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 127 transitions, 1527 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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:20:55,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:55,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-03-04 15:20:55,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:56,205 INFO L124 PetriNetUnfolderBase]: 144/493 cut-off events. [2025-03-04 15:20:56,206 INFO L125 PetriNetUnfolderBase]: For 3127/3129 co-relation queries the response was YES. [2025-03-04 15:20:56,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2376 conditions, 493 events. 144/493 cut-off events. For 3127/3129 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2953 event pairs, 35 based on Foata normal form. 4/497 useless extension candidates. Maximal degree in co-relation 2238. Up to 132 conditions per place. [2025-03-04 15:20:56,213 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 86 selfloop transitions, 44 changer transitions 0/139 dead transitions. [2025-03-04 15:20:56,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 139 transitions, 1818 flow [2025-03-04 15:20:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:20:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:20:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 152 transitions. [2025-03-04 15:20:56,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3771712158808933 [2025-03-04 15:20:56,214 INFO L175 Difference]: Start difference. First operand has 189 places, 127 transitions, 1527 flow. Second operand 13 states and 152 transitions. [2025-03-04 15:20:56,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 139 transitions, 1818 flow [2025-03-04 15:20:56,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 139 transitions, 1734 flow, removed 13 selfloop flow, removed 9 redundant places. [2025-03-04 15:20:56,229 INFO L231 Difference]: Finished difference. Result has 191 places, 126 transitions, 1521 flow [2025-03-04 15:20:56,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1521, PETRI_PLACES=191, PETRI_TRANSITIONS=126} [2025-03-04 15:20:56,230 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 158 predicate places. [2025-03-04 15:20:56,230 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 126 transitions, 1521 flow [2025-03-04 15:20:56,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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:20:56,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:56,230 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:56,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:20:56,230 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:20:56,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:56,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1966601889, now seen corresponding path program 1 times [2025-03-04 15:20:56,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:56,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154692351] [2025-03-04 15:20:56,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:56,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:56,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 15:20:56,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:20:56,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:56,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:58,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:58,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154692351] [2025-03-04 15:20:58,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154692351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:58,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:58,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:20:58,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665398459] [2025-03-04 15:20:58,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:58,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:20:58,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:58,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:20:58,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:20:58,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-03-04 15:20:58,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 126 transitions, 1521 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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:20:58,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:58,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-03-04 15:20:58,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:00,166 INFO L124 PetriNetUnfolderBase]: 122/452 cut-off events. [2025-03-04 15:21:00,167 INFO L125 PetriNetUnfolderBase]: For 2935/2937 co-relation queries the response was YES. [2025-03-04 15:21:00,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 452 events. 122/452 cut-off events. For 2935/2937 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2741 event pairs, 47 based on Foata normal form. 12/459 useless extension candidates. Maximal degree in co-relation 2105. Up to 223 conditions per place. [2025-03-04 15:21:00,170 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 71 selfloop transitions, 20 changer transitions 30/143 dead transitions. [2025-03-04 15:21:00,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 143 transitions, 1837 flow [2025-03-04 15:21:00,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:21:00,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:21:00,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2025-03-04 15:21:00,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4717741935483871 [2025-03-04 15:21:00,171 INFO L175 Difference]: Start difference. First operand has 191 places, 126 transitions, 1521 flow. Second operand 8 states and 117 transitions. [2025-03-04 15:21:00,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 143 transitions, 1837 flow [2025-03-04 15:21:00,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 143 transitions, 1756 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-03-04 15:21:00,182 INFO L231 Difference]: Finished difference. Result has 188 places, 109 transitions, 1199 flow [2025-03-04 15:21:00,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1199, PETRI_PLACES=188, PETRI_TRANSITIONS=109} [2025-03-04 15:21:00,184 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 155 predicate places. [2025-03-04 15:21:00,186 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 109 transitions, 1199 flow [2025-03-04 15:21:00,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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:21:00,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:00,186 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:00,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:21:00,187 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:21:00,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:00,187 INFO L85 PathProgramCache]: Analyzing trace with hash 507812115, now seen corresponding path program 1 times [2025-03-04 15:21:00,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:00,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705921414] [2025-03-04 15:21:00,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:00,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:00,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 15:21:00,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:21:00,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:00,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:21:02,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:02,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705921414] [2025-03-04 15:21:02,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705921414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:02,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:02,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:21:02,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122193503] [2025-03-04 15:21:02,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:02,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:21:02,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:02,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:21:02,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:21:02,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-03-04 15:21:02,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 109 transitions, 1199 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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:21:02,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:02,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-03-04 15:21:02,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:03,722 INFO L124 PetriNetUnfolderBase]: 84/337 cut-off events. [2025-03-04 15:21:03,722 INFO L125 PetriNetUnfolderBase]: For 1954/1956 co-relation queries the response was YES. [2025-03-04 15:21:03,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1589 conditions, 337 events. 84/337 cut-off events. For 1954/1956 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1800 event pairs, 40 based on Foata normal form. 8/343 useless extension candidates. Maximal degree in co-relation 1479. Up to 195 conditions per place. [2025-03-04 15:21:03,724 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 59 selfloop transitions, 24 changer transitions 17/119 dead transitions. [2025-03-04 15:21:03,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 119 transitions, 1424 flow [2025-03-04 15:21:03,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:21:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:21:03,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 165 transitions. [2025-03-04 15:21:03,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4094292803970223 [2025-03-04 15:21:03,725 INFO L175 Difference]: Start difference. First operand has 188 places, 109 transitions, 1199 flow. Second operand 13 states and 165 transitions. [2025-03-04 15:21:03,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 119 transitions, 1424 flow [2025-03-04 15:21:03,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 119 transitions, 1316 flow, removed 3 selfloop flow, removed 12 redundant places. [2025-03-04 15:21:03,733 INFO L231 Difference]: Finished difference. Result has 182 places, 97 transitions, 988 flow [2025-03-04 15:21:03,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=988, PETRI_PLACES=182, PETRI_TRANSITIONS=97} [2025-03-04 15:21:03,734 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 149 predicate places. [2025-03-04 15:21:03,734 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 97 transitions, 988 flow [2025-03-04 15:21:03,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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:21:03,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:03,734 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:03,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:21:03,734 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:21:03,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:03,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2091320834, now seen corresponding path program 1 times [2025-03-04 15:21:03,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:03,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306316238] [2025-03-04 15:21:03,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:03,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:03,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 15:21:03,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:21:03,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:03,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:21:05,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:05,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306316238] [2025-03-04 15:21:05,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306316238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:05,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:05,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:21:05,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022666221] [2025-03-04 15:21:05,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:05,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:21:05,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:05,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:21:05,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:21:06,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-03-04 15:21:06,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 97 transitions, 988 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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:21:06,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:06,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-03-04 15:21:06,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:06,496 INFO L124 PetriNetUnfolderBase]: 95/322 cut-off events. [2025-03-04 15:21:06,496 INFO L125 PetriNetUnfolderBase]: For 1062/1062 co-relation queries the response was YES. [2025-03-04 15:21:06,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 322 events. 95/322 cut-off events. For 1062/1062 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1559 event pairs, 16 based on Foata normal form. 2/324 useless extension candidates. Maximal degree in co-relation 1319. Up to 85 conditions per place. [2025-03-04 15:21:06,499 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 89 selfloop transitions, 26 changer transitions 0/117 dead transitions. [2025-03-04 15:21:06,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 117 transitions, 1329 flow [2025-03-04 15:21:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:21:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:21:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2025-03-04 15:21:06,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36950146627565983 [2025-03-04 15:21:06,502 INFO L175 Difference]: Start difference. First operand has 182 places, 97 transitions, 988 flow. Second operand 11 states and 126 transitions. [2025-03-04 15:21:06,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 117 transitions, 1329 flow [2025-03-04 15:21:06,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 117 transitions, 1234 flow, removed 4 selfloop flow, removed 20 redundant places. [2025-03-04 15:21:06,510 INFO L231 Difference]: Finished difference. Result has 163 places, 96 transitions, 933 flow [2025-03-04 15:21:06,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=933, PETRI_PLACES=163, PETRI_TRANSITIONS=96} [2025-03-04 15:21:06,511 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 130 predicate places. [2025-03-04 15:21:06,512 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 96 transitions, 933 flow [2025-03-04 15:21:06,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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:21:06,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:06,513 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:06,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 15:21:06,513 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:21:06,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2092424737, now seen corresponding path program 2 times [2025-03-04 15:21:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:06,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020376185] [2025-03-04 15:21:06,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:21:06,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:06,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 15:21:06,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:21:06,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:21:06,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:21:07,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:07,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020376185] [2025-03-04 15:21:07,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020376185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:07,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:07,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:21:07,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545362228] [2025-03-04 15:21:07,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:07,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:21:07,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:07,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:21:07,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:21:07,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-03-04 15:21:07,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 96 transitions, 933 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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:21:07,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:07,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-03-04 15:21:07,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:08,716 INFO L124 PetriNetUnfolderBase]: 63/284 cut-off events. [2025-03-04 15:21:08,717 INFO L125 PetriNetUnfolderBase]: For 939/939 co-relation queries the response was YES. [2025-03-04 15:21:08,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 284 events. 63/284 cut-off events. For 939/939 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1450 event pairs, 20 based on Foata normal form. 3/284 useless extension candidates. Maximal degree in co-relation 1138. Up to 93 conditions per place. [2025-03-04 15:21:08,718 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 57 selfloop transitions, 27 changer transitions 8/111 dead transitions. [2025-03-04 15:21:08,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 111 transitions, 1171 flow [2025-03-04 15:21:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:21:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:21:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 212 transitions. [2025-03-04 15:21:08,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4559139784946237 [2025-03-04 15:21:08,720 INFO L175 Difference]: Start difference. First operand has 163 places, 96 transitions, 933 flow. Second operand 15 states and 212 transitions. [2025-03-04 15:21:08,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 111 transitions, 1171 flow [2025-03-04 15:21:08,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 111 transitions, 1125 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-03-04 15:21:08,724 INFO L231 Difference]: Finished difference. Result has 170 places, 92 transitions, 912 flow [2025-03-04 15:21:08,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=912, PETRI_PLACES=170, PETRI_TRANSITIONS=92} [2025-03-04 15:21:08,725 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 137 predicate places. [2025-03-04 15:21:08,725 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 92 transitions, 912 flow [2025-03-04 15:21:08,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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:21:08,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:08,726 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:08,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 15:21:08,726 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:21:08,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:08,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2124599017, now seen corresponding path program 3 times [2025-03-04 15:21:08,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:08,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636964699] [2025-03-04 15:21:08,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:21:08,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:08,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-03-04 15:21:08,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 45 statements. [2025-03-04 15:21:08,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 15:21:08,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:21:10,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:10,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636964699] [2025-03-04 15:21:10,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636964699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:10,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:10,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:21:10,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655448914] [2025-03-04 15:21:10,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:10,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:21:10,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:10,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:21:10,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:21:10,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-03-04 15:21:10,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 92 transitions, 912 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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:21:10,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:10,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-03-04 15:21:10,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:10,987 INFO L124 PetriNetUnfolderBase]: 57/262 cut-off events. [2025-03-04 15:21:10,988 INFO L125 PetriNetUnfolderBase]: For 970/970 co-relation queries the response was YES. [2025-03-04 15:21:10,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 262 events. 57/262 cut-off events. For 970/970 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1278 event pairs, 15 based on Foata normal form. 6/267 useless extension candidates. Maximal degree in co-relation 1095. Up to 93 conditions per place. [2025-03-04 15:21:10,990 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 51 selfloop transitions, 23 changer transitions 16/104 dead transitions. [2025-03-04 15:21:10,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 104 transitions, 1124 flow [2025-03-04 15:21:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:21:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:21:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 199 transitions. [2025-03-04 15:21:10,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45852534562211983 [2025-03-04 15:21:10,992 INFO L175 Difference]: Start difference. First operand has 170 places, 92 transitions, 912 flow. Second operand 14 states and 199 transitions. [2025-03-04 15:21:10,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 104 transitions, 1124 flow [2025-03-04 15:21:10,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 104 transitions, 1015 flow, removed 7 selfloop flow, removed 17 redundant places. [2025-03-04 15:21:10,998 INFO L231 Difference]: Finished difference. Result has 161 places, 79 transitions, 737 flow [2025-03-04 15:21:10,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=737, PETRI_PLACES=161, PETRI_TRANSITIONS=79} [2025-03-04 15:21:10,998 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 128 predicate places. [2025-03-04 15:21:10,999 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 79 transitions, 737 flow [2025-03-04 15:21:10,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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:21:10,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:10,999 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:10,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 15:21:10,999 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:21:11,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:11,000 INFO L85 PathProgramCache]: Analyzing trace with hash -753043011, now seen corresponding path program 4 times [2025-03-04 15:21:11,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:11,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142437680] [2025-03-04 15:21:11,000 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:21:11,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:11,008 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-04 15:21:11,029 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:21:11,029 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:21:11,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:13,600 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:21:13,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:13,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142437680] [2025-03-04 15:21:13,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142437680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:13,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:13,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:21:13,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840506773] [2025-03-04 15:21:13,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:13,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:21:13,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:13,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:21:13,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:21:13,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-03-04 15:21:13,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 79 transitions, 737 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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:21:13,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:13,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-03-04 15:21:13,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:14,195 INFO L124 PetriNetUnfolderBase]: 49/231 cut-off events. [2025-03-04 15:21:14,196 INFO L125 PetriNetUnfolderBase]: For 657/657 co-relation queries the response was YES. [2025-03-04 15:21:14,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 231 events. 49/231 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1028 event pairs, 20 based on Foata normal form. 3/234 useless extension candidates. Maximal degree in co-relation 932. Up to 111 conditions per place. [2025-03-04 15:21:14,197 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 46 selfloop transitions, 16 changer transitions 13/87 dead transitions. [2025-03-04 15:21:14,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 87 transitions, 911 flow [2025-03-04 15:21:14,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:21:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:21:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 174 transitions. [2025-03-04 15:21:14,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2025-03-04 15:21:14,200 INFO L175 Difference]: Start difference. First operand has 161 places, 79 transitions, 737 flow. Second operand 12 states and 174 transitions. [2025-03-04 15:21:14,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 87 transitions, 911 flow [2025-03-04 15:21:14,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 87 transitions, 837 flow, removed 3 selfloop flow, removed 17 redundant places. [2025-03-04 15:21:14,206 INFO L231 Difference]: Finished difference. Result has 144 places, 71 transitions, 631 flow [2025-03-04 15:21:14,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=631, PETRI_PLACES=144, PETRI_TRANSITIONS=71} [2025-03-04 15:21:14,207 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 111 predicate places. [2025-03-04 15:21:14,207 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 71 transitions, 631 flow [2025-03-04 15:21:14,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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:21:14,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:14,208 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:14,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 15:21:14,208 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:21:14,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:14,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1882855231, now seen corresponding path program 2 times [2025-03-04 15:21:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:14,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213290632] [2025-03-04 15:21:14,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:21:14,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:14,217 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 15:21:14,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:21:14,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:21:14,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat