./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-lit/cggmp2005.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/cggmp2005.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 d9c82f96058e75055db08c6be05f7339c74a06f1004576b8854261e31deb5a7c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:44:30,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:44:30,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:44:30,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:44:30,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:44:30,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:44:30,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:44:30,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:44:30,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:44:30,782 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:44:30,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:44:30,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:44:30,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:44:30,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:44:30,784 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:44:30,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:44:30,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:44:30,784 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:44:30,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:44:30,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:44:30,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:44:30,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:44:30,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:44:30,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:44:30,785 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:44:30,785 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:44:30,785 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:44:30,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:44:30,785 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:44:30,785 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:44:30,785 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:44:30,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:44:30,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:44:30,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:44:30,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:44:30,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:44:30,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:44:30,786 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:44:30,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:44:30,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:44:30,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:44:30,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:44:30,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:44:30,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:44:30,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:44:30,786 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 -> d9c82f96058e75055db08c6be05f7339c74a06f1004576b8854261e31deb5a7c [2025-03-04 10:44:30,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:44:30,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:44:30,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:44:30,997 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:44:30,997 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:44:30,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/cggmp2005.i [2025-03-04 10:44:32,144 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14383fb2d/62205223002445bea7b30ed37bc50cf7/FLAG388f0ffdc [2025-03-04 10:44:32,330 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:44:32,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/cggmp2005.i [2025-03-04 10:44:32,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14383fb2d/62205223002445bea7b30ed37bc50cf7/FLAG388f0ffdc [2025-03-04 10:44:32,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14383fb2d/62205223002445bea7b30ed37bc50cf7 [2025-03-04 10:44:32,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:44:32,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:44:32,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:44:32,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:44:32,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:44:32,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:44:32" (1/1) ... [2025-03-04 10:44:32,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e3487e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:32, skipping insertion in model container [2025-03-04 10:44:32,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:44:32" (1/1) ... [2025-03-04 10:44:32,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:44:32,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:44:32,836 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:44:32,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:44:32,857 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:44:32,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:32 WrapperNode [2025-03-04 10:44:32,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:44:32,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:44:32,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:44:32,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:44:32,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:32" (1/1) ... [2025-03-04 10:44:32,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:32" (1/1) ... [2025-03-04 10:44:32,881 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 30 [2025-03-04 10:44:32,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:44:32,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:44:32,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:44:32,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:44:32,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:32" (1/1) ... [2025-03-04 10:44:32,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:32" (1/1) ... [2025-03-04 10:44:32,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:32" (1/1) ... [2025-03-04 10:44:32,898 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:44:32,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:32" (1/1) ... [2025-03-04 10:44:32,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:32" (1/1) ... [2025-03-04 10:44:32,900 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:32" (1/1) ... [2025-03-04 10:44:32,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:32" (1/1) ... [2025-03-04 10:44:32,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:32" (1/1) ... [2025-03-04 10:44:32,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:32" (1/1) ... [2025-03-04 10:44:32,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:44:32,906 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:44:32,907 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:44:32,907 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:44:32,907 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:32" (1/1) ... [2025-03-04 10:44:32,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:44:32,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:32,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:44:32,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:44:32,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:44:32,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:44:32,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:44:32,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:44:32,992 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:44:32,994 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:44:33,069 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-04 10:44:33,071 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:44:33,076 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:44:33,076 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:44:33,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:44:33 BoogieIcfgContainer [2025-03-04 10:44:33,076 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:44:33,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:44:33,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:44:33,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:44:33,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:44:32" (1/3) ... [2025-03-04 10:44:33,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195e39d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:44:33, skipping insertion in model container [2025-03-04 10:44:33,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:32" (2/3) ... [2025-03-04 10:44:33,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195e39d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:44:33, skipping insertion in model container [2025-03-04 10:44:33,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:44:33" (3/3) ... [2025-03-04 10:44:33,084 INFO L128 eAbstractionObserver]: Analyzing ICFG cggmp2005.i [2025-03-04 10:44:33,093 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:44:33,094 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cggmp2005.i that has 1 procedures, 19 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-04 10:44:33,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:44:33,140 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;@1cde0188, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:44:33,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:44:33,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.5) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:33,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 10:44:33,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:33,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 10:44:33,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:44:33,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:33,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1568959, now seen corresponding path program 1 times [2025-03-04 10:44:33,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:33,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505276326] [2025-03-04 10:44:33,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:33,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:33,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:44:33,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:44:33,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:33,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:33,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:33,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505276326] [2025-03-04 10:44:33,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505276326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:33,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:33,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:44:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062832750] [2025-03-04 10:44:33,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:33,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:44:33,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:33,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:44:33,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:33,309 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.5) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:33,338 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-03-04 10:44:33,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:44:33,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2025-03-04 10:44:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:33,344 INFO L225 Difference]: With dead ends: 28 [2025-03-04 10:44:33,344 INFO L226 Difference]: Without dead ends: 14 [2025-03-04 10:44:33,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:33,347 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:33,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:33,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-04 10:44:33,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-04 10:44:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.4) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-04 10:44:33,367 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 4 [2025-03-04 10:44:33,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:33,367 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-04 10:44:33,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-04 10:44:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:44:33,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:33,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:44:33,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:44:33,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:44:33,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:33,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1507769117, now seen corresponding path program 1 times [2025-03-04 10:44:33,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:33,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817018144] [2025-03-04 10:44:33,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:33,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:33,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:44:33,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:44:33,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:33,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:33,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:33,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817018144] [2025-03-04 10:44:33,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817018144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:33,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:33,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:44:33,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090232903] [2025-03-04 10:44:33,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:33,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:44:33,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:33,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:44:33,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:33,405 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:33,416 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-03-04 10:44:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:44:33,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2025-03-04 10:44:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:33,417 INFO L225 Difference]: With dead ends: 17 [2025-03-04 10:44:33,417 INFO L226 Difference]: Without dead ends: 16 [2025-03-04 10:44:33,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:33,417 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:33,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 12 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-04 10:44:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-04 10:44:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-04 10:44:33,420 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 6 [2025-03-04 10:44:33,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:33,420 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-04 10:44:33,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-04 10:44:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:44:33,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:33,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:33,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:44:33,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:44:33,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:33,422 INFO L85 PathProgramCache]: Analyzing trace with hash -503797648, now seen corresponding path program 1 times [2025-03-04 10:44:33,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:33,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147659891] [2025-03-04 10:44:33,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:33,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:33,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:44:33,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:44:33,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:33,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:33,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:33,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147659891] [2025-03-04 10:44:33,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147659891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:33,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:33,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:44:33,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312029687] [2025-03-04 10:44:33,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:33,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:44:33,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:33,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:44:33,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:33,455 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:33,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:33,464 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-04 10:44:33,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:44:33,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2025-03-04 10:44:33,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:33,465 INFO L225 Difference]: With dead ends: 15 [2025-03-04 10:44:33,465 INFO L226 Difference]: Without dead ends: 14 [2025-03-04 10:44:33,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:33,466 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:33,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:33,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-04 10:44:33,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-04 10:44:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-04 10:44:33,470 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2025-03-04 10:44:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:33,471 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-04 10:44:33,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-04 10:44:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:44:33,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:33,471 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:33,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:44:33,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:44:33,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:33,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1181764366, now seen corresponding path program 1 times [2025-03-04 10:44:33,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:33,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494698392] [2025-03-04 10:44:33,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:33,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:33,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:44:33,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:44:33,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:33,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:33,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:33,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494698392] [2025-03-04 10:44:33,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494698392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:33,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825410303] [2025-03-04 10:44:33,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:33,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:33,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:33,513 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:44:33,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:44:33,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:44:33,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:44:33,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:33,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:33,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:44:33,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:33,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:44:33,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825410303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:33,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:44:33,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 10:44:33,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793616272] [2025-03-04 10:44:33,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:33,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:44:33,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:33,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:44:33,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:44:33,608 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:33,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:33,631 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-04 10:44:33,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:44:33,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2025-03-04 10:44:33,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:33,632 INFO L225 Difference]: With dead ends: 14 [2025-03-04 10:44:33,632 INFO L226 Difference]: Without dead ends: 13 [2025-03-04 10:44:33,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:44:33,633 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:33,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:33,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-04 10:44:33,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-04 10:44:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-03-04 10:44:33,635 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2025-03-04 10:44:33,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:33,636 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-03-04 10:44:33,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-03-04 10:44:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:44:33,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:33,636 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:33,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:44:33,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:33,844 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:44:33,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:33,846 INFO L85 PathProgramCache]: Analyzing trace with hash -2020010333, now seen corresponding path program 1 times [2025-03-04 10:44:33,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:33,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253376637] [2025-03-04 10:44:33,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:33,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:33,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:44:33,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:44:33,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:33,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:33,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:33,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:33,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253376637] [2025-03-04 10:44:33,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253376637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:33,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035053214] [2025-03-04 10:44:33,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:33,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:33,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:33,898 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:44:33,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:44:33,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:44:33,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:44:33,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:33,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:33,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:44:33,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:33,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:33,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035053214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:33,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:33,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:44:33,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234886761] [2025-03-04 10:44:33,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:33,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:44:33,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:33,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:44:33,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:44:33,983 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:34,019 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-04 10:44:34,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:44:34,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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) Word has length 10 [2025-03-04 10:44:34,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:34,020 INFO L225 Difference]: With dead ends: 30 [2025-03-04 10:44:34,020 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 10:44:34,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:44:34,020 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:34,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 21 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:34,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 10:44:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-03-04 10:44:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:34,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-03-04 10:44:34,023 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2025-03-04 10:44:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:34,024 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-03-04 10:44:34,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:34,024 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-03-04 10:44:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:44:34,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:34,024 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:44:34,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:44:34,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:34,225 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:44:34,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1804189100, now seen corresponding path program 1 times [2025-03-04 10:44:34,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:34,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990832807] [2025-03-04 10:44:34,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:34,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:34,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:44:34,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:44:34,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:34,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:34,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:34,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:34,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990832807] [2025-03-04 10:44:34,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990832807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:34,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222784253] [2025-03-04 10:44:34,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:34,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:34,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:34,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:44:34,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:44:34,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:44:34,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:44:34,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:34,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:34,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:44:34,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:34,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:34,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222784253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:34,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:34,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 10:44:34,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287678183] [2025-03-04 10:44:34,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:34,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:44:34,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:34,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:44:34,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:44:34,352 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:34,375 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-03-04 10:44:34,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:44:34,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 10:44:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:34,376 INFO L225 Difference]: With dead ends: 29 [2025-03-04 10:44:34,376 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 10:44:34,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:44:34,377 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:34,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 10:44:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 10:44:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2025-03-04 10:44:34,382 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 11 [2025-03-04 10:44:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:34,382 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2025-03-04 10:44:34,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2025-03-04 10:44:34,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:44:34,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:34,382 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1] [2025-03-04 10:44:34,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:44:34,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:34,590 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:44:34,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:34,590 INFO L85 PathProgramCache]: Analyzing trace with hash -918584238, now seen corresponding path program 2 times [2025-03-04 10:44:34,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:34,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561919988] [2025-03-04 10:44:34,590 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:34,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:34,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:44:34,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:44:34,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:44:34,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:34,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:34,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561919988] [2025-03-04 10:44:34,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561919988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:34,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382793285] [2025-03-04 10:44:34,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:34,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:34,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:34,703 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:44:34,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:44:34,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:44:34,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:44:34,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:44:34,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:34,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:44:34,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:34,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:34,887 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:34,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382793285] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:34,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:34,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-03-04 10:44:34,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916630608] [2025-03-04 10:44:34,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:34,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:44:34,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:34,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:44:34,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:44:34,889 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 18 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:35,009 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2025-03-04 10:44:35,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:44:35,011 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 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) Word has length 25 [2025-03-04 10:44:35,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:35,012 INFO L225 Difference]: With dead ends: 29 [2025-03-04 10:44:35,012 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 10:44:35,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=243, Invalid=513, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:44:35,013 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:35,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:35,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 10:44:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2025-03-04 10:44:35,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2025-03-04 10:44:35,019 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2025-03-04 10:44:35,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:35,019 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2025-03-04 10:44:35,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2025-03-04 10:44:35,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 10:44:35,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:35,020 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2025-03-04 10:44:35,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:44:35,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:35,220 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:44:35,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:35,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1588659677, now seen corresponding path program 2 times [2025-03-04 10:44:35,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:35,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559418419] [2025-03-04 10:44:35,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:35,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:35,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:44:35,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:44:35,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:44:35,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:35,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:35,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559418419] [2025-03-04 10:44:35,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559418419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:35,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774488727] [2025-03-04 10:44:35,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:35,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:35,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:35,354 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:44:35,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:44:35,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:44:35,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:44:35,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:44:35,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:35,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:44:35,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:35,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:44:35,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774488727] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:35,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:35,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-03-04 10:44:35,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900738625] [2025-03-04 10:44:35,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:35,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 10:44:35,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:35,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 10:44:35,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:44:35,579 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 21 states, 20 states have (on average 3.8) internal successors, (76), 21 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:35,763 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2025-03-04 10:44:35,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:44:35,764 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.8) internal successors, (76), 21 states have internal predecessors, (76), 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) Word has length 26 [2025-03-04 10:44:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:35,764 INFO L225 Difference]: With dead ends: 29 [2025-03-04 10:44:35,764 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:44:35,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=310, Invalid=682, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:44:35,765 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:35,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:35,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:44:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:44:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:44:35,765 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2025-03-04 10:44:35,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:35,765 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:44:35,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.8) internal successors, (76), 21 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:44:35,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:44:35,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-04 10:44:35,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-04 10:44:35,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-04 10:44:35,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-04 10:44:35,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:44:35,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:35,975 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-03-04 10:44:35,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:44:36,007 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:44:36,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:44:36 BoogieIcfgContainer [2025-03-04 10:44:36,015 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:44:36,015 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:44:36,016 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:44:36,016 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:44:36,016 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:44:33" (3/4) ... [2025-03-04 10:44:36,017 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:44:36,025 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-04 10:44:36,026 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:44:36,026 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:44:36,026 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:44:36,084 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:44:36,085 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:44:36,085 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:44:36,085 INFO L158 Benchmark]: Toolchain (without parser) took 3374.03ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 76.4MB in the end (delta: 30.2MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2025-03-04 10:44:36,086 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:44:36,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.52ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.7MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:44:36,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.38ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.7MB in the end (delta: 915.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:44:36,086 INFO L158 Benchmark]: Boogie Preprocessor took 23.83ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.9MB in the end (delta: 865.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:44:36,086 INFO L158 Benchmark]: IcfgBuilder took 169.58ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 83.2MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:44:36,086 INFO L158 Benchmark]: TraceAbstraction took 2937.25ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 81.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:44:36,087 INFO L158 Benchmark]: Witness Printer took 69.33ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 76.4MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:44:36,087 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 128.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.52ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.7MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.38ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.7MB in the end (delta: 915.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.83ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.9MB in the end (delta: 865.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 169.58ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 83.2MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2937.25ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 81.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 69.33ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 76.4MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 304 IncrementalHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 48 mSDtfsCounter, 304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 782 SizeOfPredicates, 2 NumberOfNonLiveVariables, 224 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 128/289 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 4 specifications checked. All of them hold - InvariantResult [Line: 28]: Location Invariant Derived location invariant: ((((((6 == j) && (9 == i)) || ((i == 1) && (j == 10))) || ((7 == i) && (7 == j))) || ((5 == i) && (j == 8))) || ((3 == i) && (9 == j))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:44:36,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE