./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/05-lval_ls_02-idx_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/05-lval_ls_02-idx_nr.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 6a6d4c6573ed55a0a96a38de6d1424f0a577970a6c88cea50d5cb9a315d791fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:33:14,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:33:14,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:33:14,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:33:14,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:33:14,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:33:14,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:33:14,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:33:14,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:33:14,319 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:33:14,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:33:14,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:33:14,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:33:14,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:33:14,319 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:33:14,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:33:14,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:33:14,320 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:33:14,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:33:14,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:33:14,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:33:14,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:33:14,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:33:14,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:33:14,320 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:33:14,320 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:33:14,320 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:33:14,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:33:14,320 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:33:14,320 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:33:14,320 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:33:14,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:33:14,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:33:14,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:33:14,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:33:14,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:33:14,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:33:14,321 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:33:14,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:33:14,321 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:33:14,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:33:14,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:33:14,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:33:14,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:33:14,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:33:14,321 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 -> 6a6d4c6573ed55a0a96a38de6d1424f0a577970a6c88cea50d5cb9a315d791fd [2025-03-09 06:33:14,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:33:14,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:33:14,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:33:14,533 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:33:14,533 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:33:14,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/05-lval_ls_02-idx_nr.i [2025-03-09 06:33:15,648 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ccd202bf/641d0a36a5b8441c993496d04bef92bb/FLAGdd2bdb7c4 [2025-03-09 06:33:15,941 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:33:15,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/05-lval_ls_02-idx_nr.i [2025-03-09 06:33:15,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ccd202bf/641d0a36a5b8441c993496d04bef92bb/FLAGdd2bdb7c4 [2025-03-09 06:33:15,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ccd202bf/641d0a36a5b8441c993496d04bef92bb [2025-03-09 06:33:15,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:33:15,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:33:15,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:33:15,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:33:15,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:33:15,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:33:15" (1/1) ... [2025-03-09 06:33:15,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2336e5d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:15, skipping insertion in model container [2025-03-09 06:33:15,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:33:15" (1/1) ... [2025-03-09 06:33:16,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:33:16,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:33:16,196 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:33:16,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:33:16,259 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:33:16,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16 WrapperNode [2025-03-09 06:33:16,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:33:16,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:33:16,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:33:16,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:33:16,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,281 INFO L138 Inliner]: procedures = 162, calls = 58, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2025-03-09 06:33:16,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:33:16,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:33:16,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:33:16,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:33:16,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,302 INFO L175 MemorySlicer]: Split 50 memory accesses to 1 slices as follows [50]. 100 percent of accesses are in the largest equivalence class. The 50 initializations are split as follows [50]. The 0 writes are split as follows [0]. [2025-03-09 06:33:16,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,308 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:33:16,317 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:33:16,318 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:33:16,318 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:33:16,319 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (1/1) ... [2025-03-09 06:33:16,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:33:16,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:16,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 06:33:16,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 06:33:16,359 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:33:16,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:33:16,359 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 06:33:16,359 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 06:33:16,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:33:16,360 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:33:16,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:33:16,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:33:16,361 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:33:16,443 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:33:16,445 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:33:16,580 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:33:16,580 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:33:16,783 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:33:16,783 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:33:16,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:33:16 BoogieIcfgContainer [2025-03-09 06:33:16,783 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:33:16,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:33:16,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:33:16,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:33:16,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:33:15" (1/3) ... [2025-03-09 06:33:16,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713e5f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:33:16, skipping insertion in model container [2025-03-09 06:33:16,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:16" (2/3) ... [2025-03-09 06:33:16,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713e5f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:33:16, skipping insertion in model container [2025-03-09 06:33:16,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:33:16" (3/3) ... [2025-03-09 06:33:16,791 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_02-idx_nr.i [2025-03-09 06:33:16,801 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:33:16,802 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_02-idx_nr.i that has 2 procedures, 27 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-09 06:33:16,803 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:33:16,828 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:33:16,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 58 flow [2025-03-09 06:33:16,872 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-03-09 06:33:16,874 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:33:16,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 26 events. 1/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 47 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 7. Up to 2 conditions per place. [2025-03-09 06:33:16,876 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 58 flow [2025-03-09 06:33:16,878 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 55 flow [2025-03-09 06:33:16,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:33:16,900 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;@57559d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:33:16,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-09 06:33:16,904 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:33:16,904 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-09 06:33:16,904 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:33:16,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:16,905 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 06:33:16,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:33:16,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:16,909 INFO L85 PathProgramCache]: Analyzing trace with hash 243513, now seen corresponding path program 1 times [2025-03-09 06:33:16,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:16,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781075193] [2025-03-09 06:33:16,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:16,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:16,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:33:16,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:33:16,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:16,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:17,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:17,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781075193] [2025-03-09 06:33:17,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781075193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:17,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:17,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:33:17,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428857755] [2025-03-09 06:33:17,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:17,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:33:17,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:17,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:33:17,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:33:17,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-03-09 06:33:17,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:17,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:17,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-03-09 06:33:17,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:17,245 INFO L124 PetriNetUnfolderBase]: 31/104 cut-off events. [2025-03-09 06:33:17,247 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:33:17,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 104 events. 31/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 350 event pairs, 30 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 164. Up to 79 conditions per place. [2025-03-09 06:33:17,249 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 17 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2025-03-09 06:33:17,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 99 flow [2025-03-09 06:33:17,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:33:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:33:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-03-09 06:33:17,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2025-03-09 06:33:17,260 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 55 flow. Second operand 4 states and 59 transitions. [2025-03-09 06:33:17,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 99 flow [2025-03-09 06:33:17,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 98 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:33:17,265 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 78 flow [2025-03-09 06:33:17,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2025-03-09 06:33:17,270 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2025-03-09 06:33:17,271 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 78 flow [2025-03-09 06:33:17,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:17,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:17,272 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 06:33:17,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:33:17,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:33:17,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:17,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1335250073, now seen corresponding path program 1 times [2025-03-09 06:33:17,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:17,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187656410] [2025-03-09 06:33:17,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:17,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:17,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:33:17,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:33:17,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:17,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:17,421 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-09 06:33:17,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:17,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187656410] [2025-03-09 06:33:17,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187656410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:17,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971817545] [2025-03-09 06:33:17,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:17,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:17,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:17,423 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-09 06:33:17,425 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-09 06:33:17,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:33:17,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:33:17,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:17,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:17,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:33:17,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:33:17,519 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-09 06:33:17,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:33:17,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971817545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:17,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:33:17,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 06:33:17,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636483502] [2025-03-09 06:33:17,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:17,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:33:17,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:17,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:33:17,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:33:17,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-03-09 06:33:17,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:17,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:17,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-03-09 06:33:17,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:17,596 INFO L124 PetriNetUnfolderBase]: 31/103 cut-off events. [2025-03-09 06:33:17,597 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 06:33:17,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 103 events. 31/103 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 349 event pairs, 30 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 181. Up to 74 conditions per place. [2025-03-09 06:33:17,600 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 13 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2025-03-09 06:33:17,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 112 flow [2025-03-09 06:33:17,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:33:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:33:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2025-03-09 06:33:17,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4567901234567901 [2025-03-09 06:33:17,603 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 78 flow. Second operand 6 states and 74 transitions. [2025-03-09 06:33:17,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 112 flow [2025-03-09 06:33:17,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:33:17,605 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 84 flow [2025-03-09 06:33:17,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2025-03-09 06:33:17,606 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2025-03-09 06:33:17,606 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 84 flow [2025-03-09 06:33:17,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:17,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:17,607 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-09 06:33:17,615 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-09 06:33:17,811 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-09 06:33:17,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:33:17,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:17,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1556920885, now seen corresponding path program 1 times [2025-03-09 06:33:17,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:17,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860607428] [2025-03-09 06:33:17,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:17,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:17,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:33:17,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:33:17,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:17,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:17,868 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-09 06:33:17,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:17,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860607428] [2025-03-09 06:33:17,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860607428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:17,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:17,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:33:17,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444538943] [2025-03-09 06:33:17,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:17,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:33:17,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:17,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:33:17,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:33:17,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-03-09 06:33:17,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:17,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:17,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-03-09 06:33:17,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:17,924 INFO L124 PetriNetUnfolderBase]: 31/102 cut-off events. [2025-03-09 06:33:17,924 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 06:33:17,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 102 events. 31/102 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 347 event pairs, 30 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 177. Up to 77 conditions per place. [2025-03-09 06:33:17,925 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 14 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2025-03-09 06:33:17,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 116 flow [2025-03-09 06:33:17,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:33:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:33:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-09 06:33:17,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2025-03-09 06:33:17,926 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 84 flow. Second operand 3 states and 44 transitions. [2025-03-09 06:33:17,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 116 flow [2025-03-09 06:33:17,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 94 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-09 06:33:17,927 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 66 flow [2025-03-09 06:33:17,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2025-03-09 06:33:17,927 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-03-09 06:33:17,928 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 66 flow [2025-03-09 06:33:17,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:17,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:17,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:17,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:33:17,928 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:33:17,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:17,928 INFO L85 PathProgramCache]: Analyzing trace with hash 919154506, now seen corresponding path program 1 times [2025-03-09 06:33:17,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:17,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578276120] [2025-03-09 06:33:17,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:17,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:17,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:33:17,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:33:17,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:17,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:18,003 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-09 06:33:18,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:18,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578276120] [2025-03-09 06:33:18,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578276120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:18,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162344907] [2025-03-09 06:33:18,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:18,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:18,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:18,006 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-09 06:33:18,007 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-09 06:33:18,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:33:18,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:33:18,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:18,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:18,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:33:18,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:33:18,086 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-09 06:33:18,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:33:18,110 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-09 06:33:18,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162344907] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:33:18,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:33:18,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 06:33:18,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214817513] [2025-03-09 06:33:18,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:33:18,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:33:18,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:18,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:33:18,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:33:18,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-03-09 06:33:18,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 66 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:18,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:18,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-03-09 06:33:18,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:18,199 INFO L124 PetriNetUnfolderBase]: 31/106 cut-off events. [2025-03-09 06:33:18,199 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-09 06:33:18,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 106 events. 31/106 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 344 event pairs, 30 based on Foata normal form. 2/99 useless extension candidates. Maximal degree in co-relation 170. Up to 75 conditions per place. [2025-03-09 06:33:18,199 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 14 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2025-03-09 06:33:18,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 123 flow [2025-03-09 06:33:18,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:33:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:33:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2025-03-09 06:33:18,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.455026455026455 [2025-03-09 06:33:18,200 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 66 flow. Second operand 7 states and 86 transitions. [2025-03-09 06:33:18,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 123 flow [2025-03-09 06:33:18,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 109 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:33:18,201 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 92 flow [2025-03-09 06:33:18,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-03-09 06:33:18,201 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2025-03-09 06:33:18,201 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 92 flow [2025-03-09 06:33:18,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:18,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:18,202 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:18,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:33:18,402 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-09 06:33:18,402 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:33:18,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:18,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1533485558, now seen corresponding path program 2 times [2025-03-09 06:33:18,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:18,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001170081] [2025-03-09 06:33:18,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:33:18,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:18,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 06:33:18,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 16 statements. [2025-03-09 06:33:18,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:33:18,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:18,461 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-09 06:33:18,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:18,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001170081] [2025-03-09 06:33:18,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001170081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:18,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:18,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:33:18,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94796208] [2025-03-09 06:33:18,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:18,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:33:18,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:18,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:33:18,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:33:18,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-03-09 06:33:18,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:18,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:18,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-03-09 06:33:18,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:18,520 INFO L124 PetriNetUnfolderBase]: 37/115 cut-off events. [2025-03-09 06:33:18,520 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-09 06:33:18,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 115 events. 37/115 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 351 event pairs, 16 based on Foata normal form. 6/114 useless extension candidates. Maximal degree in co-relation 196. Up to 67 conditions per place. [2025-03-09 06:33:18,521 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 26 selfloop transitions, 4 changer transitions 6/42 dead transitions. [2025-03-09 06:33:18,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 190 flow [2025-03-09 06:33:18,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:33:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:33:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-03-09 06:33:18,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2025-03-09 06:33:18,522 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 92 flow. Second operand 5 states and 80 transitions. [2025-03-09 06:33:18,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 190 flow [2025-03-09 06:33:18,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:33:18,526 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 113 flow [2025-03-09 06:33:18,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2025-03-09 06:33:18,527 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2025-03-09 06:33:18,527 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 113 flow [2025-03-09 06:33:18,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:18,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:18,527 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:18,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:33:18,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:33:18,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1533284843, now seen corresponding path program 1 times [2025-03-09 06:33:18,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:18,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076786796] [2025-03-09 06:33:18,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:18,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:18,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:33:18,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:33:18,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:18,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:18,603 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-09 06:33:18,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:18,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076786796] [2025-03-09 06:33:18,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076786796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:18,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:18,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:33:18,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193531253] [2025-03-09 06:33:18,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:18,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:33:18,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:18,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:33:18,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:33:18,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-03-09 06:33:18,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:18,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:18,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-03-09 06:33:18,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:18,664 INFO L124 PetriNetUnfolderBase]: 24/96 cut-off events. [2025-03-09 06:33:18,664 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-09 06:33:18,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 96 events. 24/96 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 296 event pairs, 11 based on Foata normal form. 14/109 useless extension candidates. Maximal degree in co-relation 202. Up to 45 conditions per place. [2025-03-09 06:33:18,664 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 26 selfloop transitions, 4 changer transitions 4/40 dead transitions. [2025-03-09 06:33:18,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 208 flow [2025-03-09 06:33:18,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:33:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:33:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-03-09 06:33:18,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2025-03-09 06:33:18,666 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 113 flow. Second operand 5 states and 78 transitions. [2025-03-09 06:33:18,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 208 flow [2025-03-09 06:33:18,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 200 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 06:33:18,667 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 131 flow [2025-03-09 06:33:18,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2025-03-09 06:33:18,668 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2025-03-09 06:33:18,668 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 131 flow [2025-03-09 06:33:18,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:18,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:18,668 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:18,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:33:18,668 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:33:18,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:18,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2093849656, now seen corresponding path program 1 times [2025-03-09 06:33:18,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:18,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220387407] [2025-03-09 06:33:18,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:18,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:18,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:33:18,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:33:18,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:18,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:18,748 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-09 06:33:18,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:18,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220387407] [2025-03-09 06:33:18,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220387407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:18,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:18,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:33:18,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299122875] [2025-03-09 06:33:18,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:18,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:33:18,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:18,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:33:18,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:33:18,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 27 [2025-03-09 06:33:18,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:18,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:18,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 27 [2025-03-09 06:33:18,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:18,781 INFO L124 PetriNetUnfolderBase]: 10/62 cut-off events. [2025-03-09 06:33:18,781 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-09 06:33:18,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 62 events. 10/62 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 130 event pairs, 2 based on Foata normal form. 6/67 useless extension candidates. Maximal degree in co-relation 142. Up to 24 conditions per place. [2025-03-09 06:33:18,782 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 22 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2025-03-09 06:33:18,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 189 flow [2025-03-09 06:33:18,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:33:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:33:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-03-09 06:33:18,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-09 06:33:18,783 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 131 flow. Second operand 3 states and 54 transitions. [2025-03-09 06:33:18,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 189 flow [2025-03-09 06:33:18,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 182 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 06:33:18,784 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 132 flow [2025-03-09 06:33:18,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2025-03-09 06:33:18,784 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2025-03-09 06:33:18,784 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 132 flow [2025-03-09 06:33:18,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:18,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:18,785 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:18,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:33:18,787 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:33:18,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:18,787 INFO L85 PathProgramCache]: Analyzing trace with hash -988246000, now seen corresponding path program 1 times [2025-03-09 06:33:18,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:18,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434677439] [2025-03-09 06:33:18,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:18,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:18,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:33:18,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:33:18,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:18,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:18,921 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-09 06:33:18,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:18,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434677439] [2025-03-09 06:33:18,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434677439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:18,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004621863] [2025-03-09 06:33:18,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:18,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:18,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:18,927 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-09 06:33:18,929 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-09 06:33:18,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:33:18,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:33:18,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:18,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:18,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:33:18,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:33:19,011 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-09 06:33:19,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:33:19,077 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-09 06:33:19,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004621863] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:33:19,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:33:19,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-09 06:33:19,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384908306] [2025-03-09 06:33:19,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:33:19,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 06:33:19,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:19,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 06:33:19,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-09 06:33:19,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-03-09 06:33:19,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 132 flow. Second operand has 18 states, 18 states have (on average 10.5) internal successors, (189), 18 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:19,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:19,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-03-09 06:33:19,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:19,197 INFO L124 PetriNetUnfolderBase]: 10/74 cut-off events. [2025-03-09 06:33:19,197 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-09 06:33:19,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 74 events. 10/74 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 125 event pairs, 9 based on Foata normal form. 4/77 useless extension candidates. Maximal degree in co-relation 145. Up to 37 conditions per place. [2025-03-09 06:33:19,198 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 16 selfloop transitions, 15 changer transitions 0/39 dead transitions. [2025-03-09 06:33:19,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 39 transitions, 242 flow [2025-03-09 06:33:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 06:33:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 06:33:19,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 168 transitions. [2025-03-09 06:33:19,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4148148148148148 [2025-03-09 06:33:19,199 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 132 flow. Second operand 15 states and 168 transitions. [2025-03-09 06:33:19,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 39 transitions, 242 flow [2025-03-09 06:33:19,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 39 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:33:19,200 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 225 flow [2025-03-09 06:33:19,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=225, PETRI_PLACES=62, PETRI_TRANSITIONS=39} [2025-03-09 06:33:19,201 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 33 predicate places. [2025-03-09 06:33:19,201 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 39 transitions, 225 flow [2025-03-09 06:33:19,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.5) internal successors, (189), 18 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:19,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:19,201 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:19,208 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-09 06:33:19,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:19,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:33:19,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:19,403 INFO L85 PathProgramCache]: Analyzing trace with hash 727817616, now seen corresponding path program 2 times [2025-03-09 06:33:19,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:19,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097800306] [2025-03-09 06:33:19,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:33:19,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:19,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-09 06:33:19,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 34 statements. [2025-03-09 06:33:19,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:33:19,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:19,478 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-09 06:33:19,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:19,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097800306] [2025-03-09 06:33:19,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097800306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:19,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:19,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:33:19,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668845638] [2025-03-09 06:33:19,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:19,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:33:19,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:19,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:33:19,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:33:19,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-09 06:33:19,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 39 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:19,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:19,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-09 06:33:19,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:19,561 INFO L124 PetriNetUnfolderBase]: 13/75 cut-off events. [2025-03-09 06:33:19,561 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-03-09 06:33:19,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 75 events. 13/75 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 111 event pairs, 7 based on Foata normal form. 2/76 useless extension candidates. Maximal degree in co-relation 164. Up to 26 conditions per place. [2025-03-09 06:33:19,561 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 33 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2025-03-09 06:33:19,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 42 transitions, 307 flow [2025-03-09 06:33:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:33:19,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:33:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2025-03-09 06:33:19,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41975308641975306 [2025-03-09 06:33:19,562 INFO L175 Difference]: Start difference. First operand has 62 places, 39 transitions, 225 flow. Second operand 6 states and 68 transitions. [2025-03-09 06:33:19,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 42 transitions, 307 flow [2025-03-09 06:33:19,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 42 transitions, 297 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 06:33:19,564 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 221 flow [2025-03-09 06:33:19,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2025-03-09 06:33:19,565 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 33 predicate places. [2025-03-09 06:33:19,565 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 221 flow [2025-03-09 06:33:19,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:19,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:19,565 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:19,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:33:19,565 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:33:19,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:19,565 INFO L85 PathProgramCache]: Analyzing trace with hash 964885289, now seen corresponding path program 1 times [2025-03-09 06:33:19,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:19,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520601599] [2025-03-09 06:33:19,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:19,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:19,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 06:33:19,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 06:33:19,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:19,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:19,784 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-09 06:33:19,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:19,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520601599] [2025-03-09 06:33:19,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520601599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:19,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742005860] [2025-03-09 06:33:19,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:19,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:19,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:19,786 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-09 06:33:19,788 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-09 06:33:19,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 06:33:19,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 06:33:19,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:19,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:19,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:33:19,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:33:19,918 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-09 06:33:19,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:33:20,074 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-09 06:33:20,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742005860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:33:20,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:33:20,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-03-09 06:33:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424156879] [2025-03-09 06:33:20,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:33:20,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 06:33:20,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:20,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 06:33:20,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-09 06:33:20,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-03-09 06:33:20,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 38 transitions, 221 flow. Second operand has 23 states, 23 states have (on average 10.434782608695652) internal successors, (240), 23 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:20,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:20,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-03-09 06:33:20,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:20,235 INFO L124 PetriNetUnfolderBase]: 10/81 cut-off events. [2025-03-09 06:33:20,235 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-03-09 06:33:20,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 81 events. 10/81 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 112 event pairs, 9 based on Foata normal form. 3/83 useless extension candidates. Maximal degree in co-relation 198. Up to 37 conditions per place. [2025-03-09 06:33:20,237 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 16 selfloop transitions, 21 changer transitions 0/44 dead transitions. [2025-03-09 06:33:20,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 44 transitions, 349 flow [2025-03-09 06:33:20,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 06:33:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 06:33:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 227 transitions. [2025-03-09 06:33:20,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.400352733686067 [2025-03-09 06:33:20,238 INFO L175 Difference]: Start difference. First operand has 62 places, 38 transitions, 221 flow. Second operand 21 states and 227 transitions. [2025-03-09 06:33:20,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 44 transitions, 349 flow [2025-03-09 06:33:20,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 44 transitions, 337 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 06:33:20,240 INFO L231 Difference]: Finished difference. Result has 81 places, 44 transitions, 320 flow [2025-03-09 06:33:20,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=320, PETRI_PLACES=81, PETRI_TRANSITIONS=44} [2025-03-09 06:33:20,243 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 52 predicate places. [2025-03-09 06:33:20,243 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 44 transitions, 320 flow [2025-03-09 06:33:20,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.434782608695652) internal successors, (240), 23 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:20,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:20,244 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:20,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 06:33:20,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:20,448 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:33:20,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:20,448 INFO L85 PathProgramCache]: Analyzing trace with hash -861793669, now seen corresponding path program 2 times [2025-03-09 06:33:20,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:20,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320354149] [2025-03-09 06:33:20,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:33:20,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:20,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-09 06:33:20,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 43 statements. [2025-03-09 06:33:20,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:33:20,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:20,505 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-09 06:33:20,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:20,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320354149] [2025-03-09 06:33:20,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320354149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:20,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:20,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:33:20,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82787192] [2025-03-09 06:33:20,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:20,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:33:20,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:20,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:33:20,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:33:20,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-09 06:33:20,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 44 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:20,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:20,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-09 06:33:20,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:20,578 INFO L124 PetriNetUnfolderBase]: 12/81 cut-off events. [2025-03-09 06:33:20,578 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-03-09 06:33:20,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 81 events. 12/81 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 102 event pairs, 5 based on Foata normal form. 2/82 useless extension candidates. Maximal degree in co-relation 221. Up to 30 conditions per place. [2025-03-09 06:33:20,578 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 39 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-03-09 06:33:20,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 48 transitions, 416 flow [2025-03-09 06:33:20,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:33:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:33:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2025-03-09 06:33:20,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41975308641975306 [2025-03-09 06:33:20,583 INFO L175 Difference]: Start difference. First operand has 81 places, 44 transitions, 320 flow. Second operand 6 states and 68 transitions. [2025-03-09 06:33:20,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 48 transitions, 416 flow [2025-03-09 06:33:20,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 48 transitions, 373 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-03-09 06:33:20,585 INFO L231 Difference]: Finished difference. Result has 72 places, 43 transitions, 283 flow [2025-03-09 06:33:20,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=72, PETRI_TRANSITIONS=43} [2025-03-09 06:33:20,586 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 43 predicate places. [2025-03-09 06:33:20,586 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 43 transitions, 283 flow [2025-03-09 06:33:20,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:20,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:20,586 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:20,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 06:33:20,586 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:33:20,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:20,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1510306173, now seen corresponding path program 1 times [2025-03-09 06:33:20,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:20,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232427956] [2025-03-09 06:33:20,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:20,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:20,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 06:33:20,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 06:33:20,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:20,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:20,689 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-09 06:33:20,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:20,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232427956] [2025-03-09 06:33:20,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232427956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:20,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:20,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:33:20,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526637916] [2025-03-09 06:33:20,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:20,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:33:20,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:20,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:33:20,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:33:20,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-09 06:33:20,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 43 transitions, 283 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:20,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:20,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-09 06:33:20,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:20,763 INFO L124 PetriNetUnfolderBase]: 11/78 cut-off events. [2025-03-09 06:33:20,763 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2025-03-09 06:33:20,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 78 events. 11/78 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 89 event pairs, 5 based on Foata normal form. 2/79 useless extension candidates. Maximal degree in co-relation 207. Up to 29 conditions per place. [2025-03-09 06:33:20,763 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 32 selfloop transitions, 3 changer transitions 8/47 dead transitions. [2025-03-09 06:33:20,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 47 transitions, 377 flow [2025-03-09 06:33:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:33:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:33:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2025-03-09 06:33:20,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3915343915343915 [2025-03-09 06:33:20,766 INFO L175 Difference]: Start difference. First operand has 72 places, 43 transitions, 283 flow. Second operand 7 states and 74 transitions. [2025-03-09 06:33:20,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 47 transitions, 377 flow [2025-03-09 06:33:20,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 47 transitions, 363 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-09 06:33:20,769 INFO L231 Difference]: Finished difference. Result has 72 places, 37 transitions, 251 flow [2025-03-09 06:33:20,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=72, PETRI_TRANSITIONS=37} [2025-03-09 06:33:20,770 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 43 predicate places. [2025-03-09 06:33:20,771 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 37 transitions, 251 flow [2025-03-09 06:33:20,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:20,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:20,771 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:20,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:33:20,771 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-09 06:33:20,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:20,772 INFO L85 PathProgramCache]: Analyzing trace with hash -945799787, now seen corresponding path program 1 times [2025-03-09 06:33:20,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:20,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581966209] [2025-03-09 06:33:20,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:20,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:20,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 06:33:20,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 06:33:20,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:20,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:20,864 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-09 06:33:20,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:20,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581966209] [2025-03-09 06:33:20,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581966209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:20,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:20,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:33:20,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699858494] [2025-03-09 06:33:20,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:20,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:33:20,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:20,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:33:20,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:33:20,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-09 06:33:20,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 37 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:20,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:20,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-09 06:33:20,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:20,911 INFO L124 PetriNetUnfolderBase]: 8/62 cut-off events. [2025-03-09 06:33:20,911 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-09 06:33:20,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 62 events. 8/62 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 2 based on Foata normal form. 2/63 useless extension candidates. Maximal degree in co-relation 203. Up to 29 conditions per place. [2025-03-09 06:33:20,911 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 0 selfloop transitions, 0 changer transitions 40/40 dead transitions. [2025-03-09 06:33:20,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 40 transitions, 328 flow [2025-03-09 06:33:20,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:33:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:33:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2025-03-09 06:33:20,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2025-03-09 06:33:20,912 INFO L175 Difference]: Start difference. First operand has 72 places, 37 transitions, 251 flow. Second operand 6 states and 60 transitions. [2025-03-09 06:33:20,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 40 transitions, 328 flow [2025-03-09 06:33:20,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 40 transitions, 316 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 06:33:20,914 INFO L231 Difference]: Finished difference. Result has 61 places, 0 transitions, 0 flow [2025-03-09 06:33:20,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=61, PETRI_TRANSITIONS=0} [2025-03-09 06:33:20,914 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 32 predicate places. [2025-03-09 06:33:20,915 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 0 transitions, 0 flow [2025-03-09 06:33:20,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:20,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 9 remaining) [2025-03-09 06:33:20,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 9 remaining) [2025-03-09 06:33:20,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 9 remaining) [2025-03-09 06:33:20,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 9 remaining) [2025-03-09 06:33:20,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-03-09 06:33:20,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 9 remaining) [2025-03-09 06:33:20,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 9 remaining) [2025-03-09 06:33:20,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 9 remaining) [2025-03-09 06:33:20,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 9 remaining) [2025-03-09 06:33:20,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:33:20,919 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:20,925 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 06:33:20,925 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 06:33:20,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 06:33:20 BasicIcfg [2025-03-09 06:33:20,928 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 06:33:20,928 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:33:20,929 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:33:20,929 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:33:20,930 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:33:16" (3/4) ... [2025-03-09 06:33:20,930 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 06:33:20,932 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-09 06:33:20,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2025-03-09 06:33:20,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-09 06:33:20,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-09 06:33:20,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 06:33:20,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-09 06:33:20,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 06:33:20,990 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 06:33:20,990 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 06:33:20,990 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:33:20,990 INFO L158 Benchmark]: Toolchain (without parser) took 5016.67ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.4MB in the beginning and 80.2MB in the end (delta: 31.2MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2025-03-09 06:33:20,991 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:33:20,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.50ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 90.5MB in the end (delta: 20.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 06:33:20,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.37ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 88.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:33:20,991 INFO L158 Benchmark]: Boogie Preprocessor took 34.59ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 87.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:33:20,991 INFO L158 Benchmark]: IcfgBuilder took 466.22ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 86.3MB in the end (delta: 753.3kB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2025-03-09 06:33:20,991 INFO L158 Benchmark]: TraceAbstraction took 4143.09ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 85.6MB in the beginning and 86.7MB in the end (delta: -1.1MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2025-03-09 06:33:20,991 INFO L158 Benchmark]: Witness Printer took 61.48ms. Allocated memory is still 176.2MB. Free memory was 86.7MB in the beginning and 80.2MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:33:20,992 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.50ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 90.5MB in the end (delta: 20.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.37ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 88.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.59ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 87.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 466.22ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 86.3MB in the end (delta: 753.3kB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4143.09ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 85.6MB in the beginning and 86.7MB in the end (delta: -1.1MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * Witness Printer took 61.48ms. Allocated memory is still 176.2MB. Free memory was 86.7MB in the beginning and 80.2MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 688]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 688]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 693]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 693]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 683]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 683]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 38 locations, 37 edges, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.1s, OverallIterations: 13, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 206 mSDsluCounter, 158 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1028 IncrementalHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 22 mSDtfsCounter, 1028 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 104 SyntacticMatches, 11 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=320occurred in iteration=10, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 372 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 418 ConstructedInterpolants, 0 QuantifiedInterpolants, 1060 SizeOfPredicates, 13 NumberOfNonLiveVariables, 737 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 546/797 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 06:33:21,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE