./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-lit/mcmillan2006.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/mcmillan2006.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 45cd9f1eda35cecb580d3b7fe5199506be9e5041f2297c1c3e22e0a862fa68be --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:57:17,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:57:17,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:57:17,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:57:17,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:57:17,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:57:17,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:57:17,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:57:17,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:57:17,891 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:57:17,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:57:17,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:57:17,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:57:17,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:57:17,892 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:57:17,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:57:17,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:57:17,892 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:57:17,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:57:17,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:57:17,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:57:17,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:57:17,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:57:17,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:57:17,893 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:57:17,893 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:57:17,893 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:57:17,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:57:17,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:57:17,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:57:17,893 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:57:17,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:57:17,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:57:17,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:57:17,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:57:17,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:57:17,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:57:17,894 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:57:17,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:57:17,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:57:17,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:57:17,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:57:17,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:57:17,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:57:17,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:57:17,894 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 -> 45cd9f1eda35cecb580d3b7fe5199506be9e5041f2297c1c3e22e0a862fa68be [2025-03-09 01:57:18,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:57:18,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:57:18,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:57:18,108 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:57:18,108 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:57:18,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/mcmillan2006.i [2025-03-09 01:57:19,229 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30fe53d89/0169a11365e54fe08187360f261a271d/FLAG6dea43f23 [2025-03-09 01:57:19,454 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:57:19,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/mcmillan2006.i [2025-03-09 01:57:19,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30fe53d89/0169a11365e54fe08187360f261a271d/FLAG6dea43f23 [2025-03-09 01:57:19,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30fe53d89/0169a11365e54fe08187360f261a271d [2025-03-09 01:57:19,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:57:19,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:57:19,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:57:19,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:57:19,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:57:19,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:57:19" (1/1) ... [2025-03-09 01:57:19,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56fcfe1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:19, skipping insertion in model container [2025-03-09 01:57:19,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:57:19" (1/1) ... [2025-03-09 01:57:19,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:57:19,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:57:19,944 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:57:19,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:57:19,964 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:57:19,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:19 WrapperNode [2025-03-09 01:57:19,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:57:19,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:57:19,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:57:19,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:57:19,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:19" (1/1) ... [2025-03-09 01:57:19,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:19" (1/1) ... [2025-03-09 01:57:19,989 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2025-03-09 01:57:19,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:57:19,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:57:19,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:57:19,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:57:19,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:19" (1/1) ... [2025-03-09 01:57:19,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:19" (1/1) ... [2025-03-09 01:57:19,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:19" (1/1) ... [2025-03-09 01:57:20,010 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-09 01:57:20,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:19" (1/1) ... [2025-03-09 01:57:20,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:19" (1/1) ... [2025-03-09 01:57:20,017 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:19" (1/1) ... [2025-03-09 01:57:20,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:19" (1/1) ... [2025-03-09 01:57:20,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:19" (1/1) ... [2025-03-09 01:57:20,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:19" (1/1) ... [2025-03-09 01:57:20,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:57:20,025 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:57:20,025 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:57:20,025 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:57:20,025 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:19" (1/1) ... [2025-03-09 01:57:20,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:57:20,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:20,058 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:57:20,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:57:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:57:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:57:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:57:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:57:20,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:57:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:57:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:57:20,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:57:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:57:20,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:57:20,128 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:57:20,130 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:57:20,246 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-09 01:57:20,246 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:57:20,252 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:57:20,252 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:57:20,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:57:20 BoogieIcfgContainer [2025-03-09 01:57:20,253 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:57:20,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:57:20,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:57:20,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:57:20,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:57:19" (1/3) ... [2025-03-09 01:57:20,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60560378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:57:20, skipping insertion in model container [2025-03-09 01:57:20,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:19" (2/3) ... [2025-03-09 01:57:20,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60560378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:57:20, skipping insertion in model container [2025-03-09 01:57:20,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:57:20" (3/3) ... [2025-03-09 01:57:20,263 INFO L128 eAbstractionObserver]: Analyzing ICFG mcmillan2006.i [2025-03-09 01:57:20,275 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:57:20,276 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mcmillan2006.i that has 1 procedures, 21 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-09 01:57:20,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:57:20,329 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;@582609be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:57:20,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 01:57:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:57:20,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:20,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:57:20,338 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-09 01:57:20,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash 55317753, now seen corresponding path program 1 times [2025-03-09 01:57:20,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:20,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530065275] [2025-03-09 01:57:20,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:20,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:20,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:57:20,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:57:20,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:20,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:20,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:20,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530065275] [2025-03-09 01:57:20,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530065275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:20,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:20,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:57:20,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153392923] [2025-03-09 01:57:20,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:20,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:57:20,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:20,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:57:20,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:20,535 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 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 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:20,579 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2025-03-09 01:57:20,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:57:20,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-03-09 01:57:20,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:20,586 INFO L225 Difference]: With dead ends: 38 [2025-03-09 01:57:20,586 INFO L226 Difference]: Without dead ends: 18 [2025-03-09 01:57:20,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:20,593 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:20,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:20,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-09 01:57:20,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-09 01:57:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:20,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-03-09 01:57:20,614 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 5 [2025-03-09 01:57:20,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:20,615 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-03-09 01:57:20,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:20,615 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-03-09 01:57:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:57:20,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:20,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:20,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:57:20,616 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-09 01:57:20,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:20,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1301014924, now seen corresponding path program 1 times [2025-03-09 01:57:20,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:20,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645222393] [2025-03-09 01:57:20,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:20,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:20,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:57:20,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:57:20,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:20,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:20,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:20,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645222393] [2025-03-09 01:57:20,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645222393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:20,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:20,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:57:20,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000306358] [2025-03-09 01:57:20,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:20,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:57:20,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:20,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:57:20,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:20,694 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:20,714 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2025-03-09 01:57:20,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:57:20,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-03-09 01:57:20,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:20,715 INFO L225 Difference]: With dead ends: 25 [2025-03-09 01:57:20,715 INFO L226 Difference]: Without dead ends: 23 [2025-03-09 01:57:20,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:20,717 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:20,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 31 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-09 01:57:20,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-09 01:57:20,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-03-09 01:57:20,721 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 8 [2025-03-09 01:57:20,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:20,721 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-03-09 01:57:20,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-03-09 01:57:20,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:57:20,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:20,721 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:20,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:57:20,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:57:20,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:20,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1296274824, now seen corresponding path program 1 times [2025-03-09 01:57:20,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:20,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506256143] [2025-03-09 01:57:20,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:20,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:20,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:57:20,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:57:20,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:20,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:20,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506256143] [2025-03-09 01:57:20,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506256143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885535601] [2025-03-09 01:57:20,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:20,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:20,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:20,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:20,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:57:20,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:57:20,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:57:20,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:20,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:20,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:57:20,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:20,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:57:20,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885535601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:20,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:57:20,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 01:57:20,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572612755] [2025-03-09 01:57:20,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:20,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:57:20,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:20,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:57:20,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:57:20,923 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:20,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:20,954 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-03-09 01:57:20,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:57:20,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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 8 [2025-03-09 01:57:20,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:20,955 INFO L225 Difference]: With dead ends: 23 [2025-03-09 01:57:20,955 INFO L226 Difference]: Without dead ends: 22 [2025-03-09 01:57:20,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:57:20,956 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:20,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-09 01:57:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-09 01:57:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-03-09 01:57:20,958 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 8 [2025-03-09 01:57:20,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:20,959 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-03-09 01:57:20,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:20,959 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-03-09 01:57:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:57:20,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:20,961 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:57:20,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:57:21,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:21,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:57:21,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1529813893, now seen corresponding path program 1 times [2025-03-09 01:57:21,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:21,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671669157] [2025-03-09 01:57:21,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:21,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:21,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:57:21,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:57:21,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:21,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:21,258 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-09 01:57:21,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:21,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671669157] [2025-03-09 01:57:21,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671669157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:21,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101744291] [2025-03-09 01:57:21,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:21,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:21,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:21,262 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:21,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:57:21,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:57:21,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:57:21,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:21,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:21,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:57:21,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:21,341 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-09 01:57:21,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:21,385 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-09 01:57:21,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101744291] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:21,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:21,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:57:21,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635055243] [2025-03-09 01:57:21,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:21,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:57:21,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:21,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:57:21,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:57:21,387 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:21,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:21,417 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-03-09 01:57:21,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:57:21,417 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 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-09 01:57:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:21,418 INFO L225 Difference]: With dead ends: 32 [2025-03-09 01:57:21,418 INFO L226 Difference]: Without dead ends: 31 [2025-03-09 01:57:21,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:57:21,419 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:21,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:21,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-09 01:57:21,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-09 01:57:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:21,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-03-09 01:57:21,422 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 9 [2025-03-09 01:57:21,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:21,423 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-09 01:57:21,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-03-09 01:57:21,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:57:21,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:21,423 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:21,429 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-09 01:57:21,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 01:57:21,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:57:21,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:21,629 INFO L85 PathProgramCache]: Analyzing trace with hash 85477102, now seen corresponding path program 1 times [2025-03-09 01:57:21,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:21,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457947217] [2025-03-09 01:57:21,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:21,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:21,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:57:21,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:57:21,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:21,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:57:21,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:21,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457947217] [2025-03-09 01:57:21,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457947217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:21,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:21,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:57:21,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629575662] [2025-03-09 01:57:21,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:21,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:57:21,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:21,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:57:21,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:21,713 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:21,733 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2025-03-09 01:57:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:57:21,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2025-03-09 01:57:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:21,734 INFO L225 Difference]: With dead ends: 43 [2025-03-09 01:57:21,734 INFO L226 Difference]: Without dead ends: 31 [2025-03-09 01:57:21,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:21,735 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:21,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:21,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-09 01:57:21,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-09 01:57:21,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.25) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-03-09 01:57:21,738 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2025-03-09 01:57:21,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:21,738 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-03-09 01:57:21,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-03-09 01:57:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:57:21,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:21,739 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:21,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:57:21,739 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-09 01:57:21,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:21,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1957253779, now seen corresponding path program 1 times [2025-03-09 01:57:21,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:21,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361378871] [2025-03-09 01:57:21,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:21,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:21,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:57:21,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:57:21,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:21,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:57:21,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:21,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361378871] [2025-03-09 01:57:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361378871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:21,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106685056] [2025-03-09 01:57:21,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:21,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:21,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:21,810 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:21,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:57:21,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:57:21,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:57:21,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:21,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:21,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:57:21,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:21,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:22,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106685056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:22,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:22,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-03-09 01:57:22,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803826976] [2025-03-09 01:57:22,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:22,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:57:22,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:22,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:57:22,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:57:22,013 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:22,127 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2025-03-09 01:57:22,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:57:22,127 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 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 16 [2025-03-09 01:57:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:22,128 INFO L225 Difference]: With dead ends: 43 [2025-03-09 01:57:22,128 INFO L226 Difference]: Without dead ends: 30 [2025-03-09 01:57:22,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:57:22,128 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:22,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:22,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-09 01:57:22,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-09 01:57:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2025-03-09 01:57:22,131 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 16 [2025-03-09 01:57:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:22,131 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-03-09 01:57:22,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2025-03-09 01:57:22,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 01:57:22,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:22,131 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-03-09 01:57:22,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:57:22,337 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-09 01:57:22,337 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-09 01:57:22,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:22,337 INFO L85 PathProgramCache]: Analyzing trace with hash 544633562, now seen corresponding path program 2 times [2025-03-09 01:57:22,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:22,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199765703] [2025-03-09 01:57:22,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:22,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:22,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:57:22,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-09 01:57:22,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:57:22,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:22,372 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:57:22,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:22,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199765703] [2025-03-09 01:57:22,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199765703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:22,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322358207] [2025-03-09 01:57:22,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:22,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:22,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:22,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:22,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:57:22,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:57:22,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-09 01:57:22,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:57:22,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:22,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:57:22,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:57:22,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:57:22,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322358207] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:22,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:22,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:57:22,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678353894] [2025-03-09 01:57:22,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:22,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:57:22,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:22,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:57:22,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:57:22,484 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:22,502 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-03-09 01:57:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:57:22,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 18 [2025-03-09 01:57:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:22,503 INFO L225 Difference]: With dead ends: 30 [2025-03-09 01:57:22,503 INFO L226 Difference]: Without dead ends: 29 [2025-03-09 01:57:22,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:57:22,504 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:22,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 15 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:22,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-09 01:57:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2025-03-09 01:57:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:22,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2025-03-09 01:57:22,507 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2025-03-09 01:57:22,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:22,507 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2025-03-09 01:57:22,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2025-03-09 01:57:22,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 01:57:22,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:22,509 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:22,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:57:22,710 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-09 01:57:22,710 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:57:22,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:22,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1156051177, now seen corresponding path program 1 times [2025-03-09 01:57:22,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:22,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34525614] [2025-03-09 01:57:22,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:22,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:22,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:57:22,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:57:22,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:22,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:22,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:57:22,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:22,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34525614] [2025-03-09 01:57:22,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34525614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:22,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206889457] [2025-03-09 01:57:22,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:22,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:22,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:22,793 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-09 01:57:22,794 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-09 01:57:22,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:57:22,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:57:22,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:22,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:22,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:57:22,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:22,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:57:22,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:57:22,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206889457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:22,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:22,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:57:22,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743726939] [2025-03-09 01:57:22,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:22,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:57:22,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:22,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:57:22,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:57:22,891 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:22,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:22,923 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2025-03-09 01:57:22,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:57:22,923 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 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 20 [2025-03-09 01:57:22,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:22,924 INFO L225 Difference]: With dead ends: 37 [2025-03-09 01:57:22,925 INFO L226 Difference]: Without dead ends: 36 [2025-03-09 01:57:22,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:57:22,925 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:22,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-09 01:57:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-09 01:57:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2025-03-09 01:57:22,929 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 20 [2025-03-09 01:57:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:22,929 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2025-03-09 01:57:22,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2025-03-09 01:57:22,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 01:57:22,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:22,933 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:57:22,939 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-09 01:57:23,134 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-09 01:57:23,134 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:57:23,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:23,135 INFO L85 PathProgramCache]: Analyzing trace with hash -86746351, now seen corresponding path program 2 times [2025-03-09 01:57:23,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:23,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383604317] [2025-03-09 01:57:23,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:23,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:23,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-09 01:57:23,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 35 statements. [2025-03-09 01:57:23,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:57:23,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-09 01:57:23,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:23,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383604317] [2025-03-09 01:57:23,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383604317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:23,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369885035] [2025-03-09 01:57:23,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:23,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:23,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:23,188 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:23,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:57:23,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-09 01:57:23,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 35 statements. [2025-03-09 01:57:23,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:57:23,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:23,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:57:23,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-09 01:57:23,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-09 01:57:23,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369885035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:23,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:23,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 01:57:23,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446865007] [2025-03-09 01:57:23,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:23,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:57:23,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:23,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:57:23,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:57:23,348 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:23,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:23,375 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2025-03-09 01:57:23,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:57:23,375 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-09 01:57:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:23,376 INFO L225 Difference]: With dead ends: 36 [2025-03-09 01:57:23,376 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:57:23,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:57:23,378 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:23,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:57:23,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:57:23,378 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-09 01:57:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:57:23,378 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2025-03-09 01:57:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:23,378 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:57:23,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:57:23,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:57:23,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-09 01:57:23,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-09 01:57:23,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-09 01:57:23,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-09 01:57:23,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:57:23,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:23,592 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:57:23,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:57:23,665 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:57:23,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:57:23 BoogieIcfgContainer [2025-03-09 01:57:23,676 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:57:23,677 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:57:23,677 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:57:23,677 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:57:23,678 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:57:20" (3/4) ... [2025-03-09 01:57:23,679 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:57:23,685 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 01:57:23,685 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:57:23,685 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:57:23,685 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:57:23,737 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:57:23,737 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:57:23,737 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:57:23,738 INFO L158 Benchmark]: Toolchain (without parser) took 3929.25ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 109.4MB in the end (delta: 24.7MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2025-03-09 01:57:23,738 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:23,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.39ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 123.1MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:57:23,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.09ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 122.2MB in the end (delta: 927.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:23,739 INFO L158 Benchmark]: Boogie Preprocessor took 33.21ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 121.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:23,740 INFO L158 Benchmark]: IcfgBuilder took 228.28ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 108.8MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:57:23,740 INFO L158 Benchmark]: TraceAbstraction took 3420.90ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 115.1MB in the end (delta: -6.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:23,740 INFO L158 Benchmark]: Witness Printer took 60.31ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 109.4MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:23,741 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.21ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.39ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 123.1MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.09ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 122.2MB in the end (delta: 927.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.21ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 121.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 228.28ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 108.8MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3420.90ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 115.1MB in the end (delta: -6.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 60.31ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 109.4MB in the end (delta: 5.7MB). There was no memory consumed. 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: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: 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: 30]: 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, 21 locations, 25 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 304 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 345 IncrementalHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 91 mSDtfsCounter, 345 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 173 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=8, InterpolantAutomatonStates: 62, 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, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 238 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 826 SizeOfPredicates, 7 NumberOfNonLiveVariables, 363 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 213/317 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: 30]: Location Invariant Derived location invariant: (((i == 0) && (n <= 1000)) || ((1 <= i) && (n <= 1000))) - InvariantResult [Line: 31]: Location Invariant Derived location invariant: ((((i == 0) && (n <= 1000)) || ((1 <= i) && (n <= 1))) || (((i <= 2147483646) && (1 <= i)) && (n <= 1000))) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:57:23,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE