./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/pr4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/array-tiling/pr4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14a75e050103eb09182e049a798a738dec478e3acaa4fb01ae8649b715b8362f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:38:54,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:38:54,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:38:54,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:38:54,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:38:54,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:38:54,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:38:54,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:38:54,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:38:54,868 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:38:54,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:38:54,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:38:54,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:38:54,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:38:54,869 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:38:54,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:38:54,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:38:54,869 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:38:54,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:38:54,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:38:54,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:38:54,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:38:54,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:38:54,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:38:54,869 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:38:54,870 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:38:54,870 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:38:54,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:38:54,870 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:38:54,870 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:38:54,870 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:38:54,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:38:54,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:38:54,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:38:54,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:38:54,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:38:54,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:38:54,870 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:38:54,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:38:54,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:38:54,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:38:54,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:38:54,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:38:54,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:38:54,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:38:54,871 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 -> 14a75e050103eb09182e049a798a738dec478e3acaa4fb01ae8649b715b8362f [2025-03-17 14:38:55,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:38:55,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:38:55,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:38:55,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:38:55,114 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:38:55,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pr4.c [2025-03-17 14:38:56,293 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d1e8344/faba848ebc204ab48477181e75f13d9f/FLAGdf8f3f492 [2025-03-17 14:38:56,531 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:38:56,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pr4.c [2025-03-17 14:38:56,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d1e8344/faba848ebc204ab48477181e75f13d9f/FLAGdf8f3f492 [2025-03-17 14:38:56,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d1e8344/faba848ebc204ab48477181e75f13d9f [2025-03-17 14:38:56,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:38:56,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:38:56,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:38:56,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:38:56,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:38:56,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:38:56" (1/1) ... [2025-03-17 14:38:56,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a383f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:56, skipping insertion in model container [2025-03-17 14:38:56,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:38:56" (1/1) ... [2025-03-17 14:38:56,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:38:56,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:38:56,989 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:38:57,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:38:57,023 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:38:57,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:57 WrapperNode [2025-03-17 14:38:57,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:38:57,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:38:57,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:38:57,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:38:57,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:57" (1/1) ... [2025-03-17 14:38:57,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:57" (1/1) ... [2025-03-17 14:38:57,047 INFO L138 Inliner]: procedures = 15, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 119 [2025-03-17 14:38:57,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:38:57,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:38:57,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:38:57,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:38:57,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:57" (1/1) ... [2025-03-17 14:38:57,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:57" (1/1) ... [2025-03-17 14:38:57,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:57" (1/1) ... [2025-03-17 14:38:57,065 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 6, 10]. 56 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 8 writes are split as follows [0, 0, 8]. [2025-03-17 14:38:57,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:57" (1/1) ... [2025-03-17 14:38:57,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:57" (1/1) ... [2025-03-17 14:38:57,069 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:57" (1/1) ... [2025-03-17 14:38:57,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:57" (1/1) ... [2025-03-17 14:38:57,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:57" (1/1) ... [2025-03-17 14:38:57,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:57" (1/1) ... [2025-03-17 14:38:57,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:38:57,074 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:38:57,074 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:38:57,074 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:38:57,074 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:57" (1/1) ... [2025-03-17 14:38:57,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:38:57,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:57,098 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-17 14:38:57,100 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-17 14:38:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:38:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:38:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:38:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:38:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 14:38:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:38:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:38:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:38:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:38:57,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:38:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:38:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:38:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:38:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:38:57,168 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:38:57,170 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:38:57,411 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-17 14:38:57,411 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:38:57,422 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:38:57,423 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:38:57,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:57 BoogieIcfgContainer [2025-03-17 14:38:57,424 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:38:57,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:38:57,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:38:57,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:38:57,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:38:56" (1/3) ... [2025-03-17 14:38:57,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd708eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:38:57, skipping insertion in model container [2025-03-17 14:38:57,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:57" (2/3) ... [2025-03-17 14:38:57,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd708eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:38:57, skipping insertion in model container [2025-03-17 14:38:57,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:57" (3/3) ... [2025-03-17 14:38:57,434 INFO L128 eAbstractionObserver]: Analyzing ICFG pr4.c [2025-03-17 14:38:57,443 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:38:57,445 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pr4.c that has 1 procedures, 97 locations, 1 initial locations, 2 loop locations, and 38 error locations. [2025-03-17 14:38:57,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:38:57,487 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;@3500b5ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:38:57,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-17 14:38:57,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 96 states have internal predecessors, (108), 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-17 14:38:57,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:38:57,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:57,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:38:57,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:57,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:57,498 INFO L85 PathProgramCache]: Analyzing trace with hash -155228841, now seen corresponding path program 1 times [2025-03-17 14:38:57,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:57,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535835687] [2025-03-17 14:38:57,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:57,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:57,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:38:57,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:38:57,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:57,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:57,635 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-17 14:38:57,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:57,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535835687] [2025-03-17 14:38:57,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535835687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:57,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:57,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:38:57,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889402151] [2025-03-17 14:38:57,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:57,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:38:57,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:57,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:38:57,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:38:57,657 INFO L87 Difference]: Start difference. First operand has 97 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 96 states have internal predecessors, (108), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:57,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:57,669 INFO L93 Difference]: Finished difference Result 190 states and 209 transitions. [2025-03-17 14:38:57,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:38:57,670 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 14:38:57,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:57,674 INFO L225 Difference]: With dead ends: 190 [2025-03-17 14:38:57,674 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 14:38:57,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:38:57,677 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:57,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:57,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 14:38:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-17 14:38:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.8) internal successors, (99), 92 states have internal predecessors, (99), 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-17 14:38:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2025-03-17 14:38:57,704 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 6 [2025-03-17 14:38:57,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:57,704 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2025-03-17 14:38:57,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2025-03-17 14:38:57,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:38:57,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:57,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:38:57,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:38:57,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:57,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:57,705 INFO L85 PathProgramCache]: Analyzing trace with hash -155227880, now seen corresponding path program 1 times [2025-03-17 14:38:57,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:57,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696195357] [2025-03-17 14:38:57,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:57,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:57,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:38:57,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:38:57,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:57,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:57,894 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-17 14:38:57,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:57,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696195357] [2025-03-17 14:38:57,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696195357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:57,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:57,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:57,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346255640] [2025-03-17 14:38:57,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:57,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:57,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:57,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:57,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:57,896 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:57,930 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2025-03-17 14:38:57,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:57,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 14:38:57,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:57,931 INFO L225 Difference]: With dead ends: 93 [2025-03-17 14:38:57,931 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 14:38:57,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:57,932 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 186 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:57,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 91 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:57,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 14:38:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 14:38:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.7818181818181817) internal successors, (98), 91 states have internal predecessors, (98), 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-17 14:38:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2025-03-17 14:38:57,938 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 6 [2025-03-17 14:38:57,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:57,939 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2025-03-17 14:38:57,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2025-03-17 14:38:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:38:57,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:57,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:57,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:38:57,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:57,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:57,940 INFO L85 PathProgramCache]: Analyzing trace with hash -517096919, now seen corresponding path program 1 times [2025-03-17 14:38:57,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:57,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468022012] [2025-03-17 14:38:57,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:57,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:57,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:38:57,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:38:57,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:57,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:58,155 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-17 14:38:58,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:58,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468022012] [2025-03-17 14:38:58,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468022012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:58,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:58,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:38:58,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974962819] [2025-03-17 14:38:58,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:58,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:38:58,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:58,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:38:58,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:38:58,156 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:58,185 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2025-03-17 14:38:58,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:58,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 14:38:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:58,186 INFO L225 Difference]: With dead ends: 92 [2025-03-17 14:38:58,186 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 14:38:58,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:38:58,187 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:58,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 90 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:58,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 14:38:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-17 14:38:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 90 states have internal predecessors, (97), 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-17 14:38:58,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2025-03-17 14:38:58,191 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 7 [2025-03-17 14:38:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:58,191 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2025-03-17 14:38:58,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2025-03-17 14:38:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 14:38:58,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:58,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:58,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:38:58,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:58,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1213439308, now seen corresponding path program 1 times [2025-03-17 14:38:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:58,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618754129] [2025-03-17 14:38:58,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:58,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:58,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:38:58,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:38:58,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:58,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:58,245 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-17 14:38:58,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:58,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618754129] [2025-03-17 14:38:58,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618754129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:58,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:58,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:38:58,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683367044] [2025-03-17 14:38:58,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:58,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:38:58,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:58,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:38:58,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:38:58,247 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-17 14:38:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:58,422 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2025-03-17 14:38:58,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:38:58,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 14:38:58,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:58,423 INFO L225 Difference]: With dead ends: 163 [2025-03-17 14:38:58,423 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 14:38:58,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:38:58,426 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 39 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:58,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 83 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:38:58,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 14:38:58,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2025-03-17 14:38:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 94 states have (on average 1.5) internal successors, (141), 129 states have internal predecessors, (141), 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-17 14:38:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2025-03-17 14:38:58,435 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 10 [2025-03-17 14:38:58,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:58,436 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2025-03-17 14:38:58,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-17 14:38:58,436 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2025-03-17 14:38:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:38:58,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:58,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:58,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:38:58,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:58,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:58,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1639768523, now seen corresponding path program 1 times [2025-03-17 14:38:58,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:58,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234417605] [2025-03-17 14:38:58,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:58,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:58,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:38:58,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:38:58,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:58,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:58,521 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-17 14:38:58,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:58,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234417605] [2025-03-17 14:38:58,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234417605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:58,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:58,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:58,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480070743] [2025-03-17 14:38:58,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:58,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:58,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:58,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:58,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:58,523 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:58,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:58,616 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2025-03-17 14:38:58,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:58,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 14:38:58,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:58,618 INFO L225 Difference]: With dead ends: 139 [2025-03-17 14:38:58,618 INFO L226 Difference]: Without dead ends: 137 [2025-03-17 14:38:58,618 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-17 14:38:58,618 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:58,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 201 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-17 14:38:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-17 14:38:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 101 states have (on average 1.4752475247524752) internal successors, (149), 136 states have internal predecessors, (149), 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-17 14:38:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2025-03-17 14:38:58,626 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 15 [2025-03-17 14:38:58,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:58,631 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2025-03-17 14:38:58,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2025-03-17 14:38:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:38:58,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:58,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:58,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:38:58,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:58,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:58,632 INFO L85 PathProgramCache]: Analyzing trace with hash -913881684, now seen corresponding path program 1 times [2025-03-17 14:38:58,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:58,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129642709] [2025-03-17 14:38:58,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:58,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:58,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:38:58,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:38:58,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:58,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:38:58,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:58,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129642709] [2025-03-17 14:38:58,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129642709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:58,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:58,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:38:58,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364590348] [2025-03-17 14:38:58,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:58,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:58,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:58,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:58,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:38:58,783 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-17 14:38:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:58,912 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2025-03-17 14:38:58,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:58,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 22 [2025-03-17 14:38:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:58,913 INFO L225 Difference]: With dead ends: 155 [2025-03-17 14:38:58,913 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 14:38:58,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:38:58,914 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 175 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:58,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 76 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:58,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 14:38:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2025-03-17 14:38:58,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 136 states have internal predecessors, (148), 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-17 14:38:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2025-03-17 14:38:58,919 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 22 [2025-03-17 14:38:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:58,919 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2025-03-17 14:38:58,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-17 14:38:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2025-03-17 14:38:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 14:38:58,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:58,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:58,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:38:58,920 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:58,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1497037168, now seen corresponding path program 1 times [2025-03-17 14:38:58,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:58,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728895187] [2025-03-17 14:38:58,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:58,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:38:58,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:38:58,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:58,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:58,978 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-17 14:38:58,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:58,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728895187] [2025-03-17 14:38:58,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728895187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:58,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:58,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:58,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602267446] [2025-03-17 14:38:58,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:58,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:58,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:58,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:58,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:58,980 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-17 14:38:59,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:59,084 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2025-03-17 14:38:59,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:59,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2025-03-17 14:38:59,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:59,085 INFO L225 Difference]: With dead ends: 142 [2025-03-17 14:38:59,085 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 14:38:59,085 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-17 14:38:59,085 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 21 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:59,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 139 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:59,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 14:38:59,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-03-17 14:38:59,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 139 states have internal predecessors, (151), 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-17 14:38:59,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2025-03-17 14:38:59,093 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 30 [2025-03-17 14:38:59,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:59,093 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2025-03-17 14:38:59,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-17 14:38:59,093 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2025-03-17 14:38:59,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 14:38:59,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:59,094 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:59,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:38:59,094 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:59,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:59,095 INFO L85 PathProgramCache]: Analyzing trace with hash -774592299, now seen corresponding path program 1 times [2025-03-17 14:38:59,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:59,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527549892] [2025-03-17 14:38:59,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:59,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:59,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 14:38:59,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 14:38:59,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:59,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:59,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527549892] [2025-03-17 14:38:59,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527549892] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058575707] [2025-03-17 14:38:59,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:59,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:59,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:59,168 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-17 14:38:59,170 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-17 14:38:59,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 14:38:59,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 14:38:59,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:59,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:59,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:59,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:59,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:38:59,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058575707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:59,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:38:59,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 14:38:59,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320303237] [2025-03-17 14:38:59,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:59,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:59,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:59,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:59,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:59,295 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 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-17 14:38:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:59,439 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2025-03-17 14:38:59,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:59,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 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) Word has length 36 [2025-03-17 14:38:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:59,443 INFO L225 Difference]: With dead ends: 140 [2025-03-17 14:38:59,443 INFO L226 Difference]: Without dead ends: 123 [2025-03-17 14:38:59,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:59,444 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 59 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:59,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 89 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-17 14:38:59,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-17 14:38:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 122 states have internal predecessors, (134), 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-17 14:38:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2025-03-17 14:38:59,447 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 36 [2025-03-17 14:38:59,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:59,447 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2025-03-17 14:38:59,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 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-17 14:38:59,448 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2025-03-17 14:38:59,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 14:38:59,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:59,448 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:59,455 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-17 14:38:59,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:59,649 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:59,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1757442556, now seen corresponding path program 1 times [2025-03-17 14:38:59,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:59,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27630176] [2025-03-17 14:38:59,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:59,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:59,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 14:38:59,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:38:59,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:59,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:59,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:59,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27630176] [2025-03-17 14:38:59,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27630176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:59,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323784651] [2025-03-17 14:38:59,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:59,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:59,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:59,711 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-17 14:38:59,713 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-17 14:38:59,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 14:38:59,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:38:59,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:59,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:59,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:59,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:59,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:59,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323784651] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:59,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:59,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 14:38:59,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854476094] [2025-03-17 14:38:59,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:59,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:38:59,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:59,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:38:59,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:38:59,880 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 10 states, 9 states have (on average 10.777777777777779) internal successors, (97), 10 states have internal predecessors, (97), 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-17 14:39:00,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:00,065 INFO L93 Difference]: Finished difference Result 176 states and 210 transitions. [2025-03-17 14:39:00,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:39:00,065 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.777777777777779) internal successors, (97), 10 states have internal predecessors, (97), 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 37 [2025-03-17 14:39:00,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:00,066 INFO L225 Difference]: With dead ends: 176 [2025-03-17 14:39:00,066 INFO L226 Difference]: Without dead ends: 159 [2025-03-17 14:39:00,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:39:00,066 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 146 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:00,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 153 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:39:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-17 14:39:00,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-17 14:39:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 154 states have (on average 1.1493506493506493) internal successors, (177), 158 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2025-03-17 14:39:00,074 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 37 [2025-03-17 14:39:00,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:00,074 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2025-03-17 14:39:00,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.777777777777779) internal successors, (97), 10 states have internal predecessors, (97), 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-17 14:39:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2025-03-17 14:39:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 14:39:00,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:00,075 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:00,083 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-17 14:39:00,275 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,SelfDestructingSolverStorable8 [2025-03-17 14:39:00,275 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:39:00,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:00,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1592675253, now seen corresponding path program 1 times [2025-03-17 14:39:00,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:00,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283728684] [2025-03-17 14:39:00,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:00,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:00,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 14:39:00,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 14:39:00,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:00,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:39:00,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:00,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283728684] [2025-03-17 14:39:00,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283728684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:00,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113065531] [2025-03-17 14:39:00,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:00,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:00,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:00,366 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-17 14:39:00,367 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-17 14:39:00,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 14:39:00,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 14:39:00,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:00,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:00,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:39:00,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:39:00,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:39:00,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113065531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:00,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:39:00,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 14:39:00,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101291305] [2025-03-17 14:39:00,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:00,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:39:00,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:00,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:39:00,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:39:00,451 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 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-17 14:39:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:00,537 INFO L93 Difference]: Finished difference Result 159 states and 177 transitions. [2025-03-17 14:39:00,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:39:00,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 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 48 [2025-03-17 14:39:00,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:00,538 INFO L225 Difference]: With dead ends: 159 [2025-03-17 14:39:00,539 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 14:39:00,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 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-17 14:39:00,539 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 89 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:00,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 72 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:00,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 14:39:00,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-17 14:39:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 154 states have (on average 1.1428571428571428) internal successors, (176), 157 states have internal predecessors, (176), 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-17 14:39:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2025-03-17 14:39:00,545 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 48 [2025-03-17 14:39:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:00,545 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2025-03-17 14:39:00,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 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-17 14:39:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2025-03-17 14:39:00,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 14:39:00,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:00,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:00,556 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-17 14:39:00,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:00,748 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:39:00,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:00,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2128292561, now seen corresponding path program 1 times [2025-03-17 14:39:00,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:00,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445515610] [2025-03-17 14:39:00,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:00,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:00,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 14:39:00,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 14:39:00,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:00,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:39:00,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:00,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445515610] [2025-03-17 14:39:00,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445515610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:00,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542859247] [2025-03-17 14:39:00,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:00,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:00,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:00,834 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-17 14:39:00,836 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-17 14:39:00,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 14:39:00,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 14:39:00,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:00,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:00,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:39:00,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:00,911 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:39:00,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:39:00,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542859247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:00,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:00,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 14:39:00,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246640831] [2025-03-17 14:39:00,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:00,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:39:00,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:00,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:39:00,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:39:00,946 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 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-17 14:39:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:01,111 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2025-03-17 14:39:01,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:39:01,111 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 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 49 [2025-03-17 14:39:01,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:01,112 INFO L225 Difference]: With dead ends: 180 [2025-03-17 14:39:01,112 INFO L226 Difference]: Without dead ends: 179 [2025-03-17 14:39:01,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 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-17 14:39:01,112 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 118 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:01,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 168 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:39:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-17 14:39:01,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-03-17 14:39:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 175 states have (on average 1.1428571428571428) internal successors, (200), 178 states have internal predecessors, (200), 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-17 14:39:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 200 transitions. [2025-03-17 14:39:01,117 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 200 transitions. Word has length 49 [2025-03-17 14:39:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:01,117 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 200 transitions. [2025-03-17 14:39:01,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 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-17 14:39:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 200 transitions. [2025-03-17 14:39:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 14:39:01,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:01,118 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:01,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:39:01,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:01,319 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:39:01,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:01,320 INFO L85 PathProgramCache]: Analyzing trace with hash -832743078, now seen corresponding path program 2 times [2025-03-17 14:39:01,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:01,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777792586] [2025-03-17 14:39:01,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:01,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:01,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-17 14:39:01,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 70 statements. [2025-03-17 14:39:01,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:01,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-17 14:39:01,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:01,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777792586] [2025-03-17 14:39:01,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777792586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:01,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134570000] [2025-03-17 14:39:01,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:01,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:01,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:01,368 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-17 14:39:01,369 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-17 14:39:01,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-17 14:39:01,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 70 statements. [2025-03-17 14:39:01,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:01,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:01,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:39:01,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-17 14:39:01,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-17 14:39:01,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134570000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:01,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:01,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-17 14:39:01,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004658307] [2025-03-17 14:39:01,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:01,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:39:01,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:01,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:39:01,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:39:01,572 INFO L87 Difference]: Start difference. First operand 179 states and 200 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:01,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:01,643 INFO L93 Difference]: Finished difference Result 179 states and 200 transitions. [2025-03-17 14:39:01,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:39:01,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-17 14:39:01,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:01,644 INFO L225 Difference]: With dead ends: 179 [2025-03-17 14:39:01,644 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 14:39:01,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:39:01,645 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 68 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:01,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 38 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:01,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 14:39:01,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-17 14:39:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 139 states have (on average 1.1151079136690647) internal successors, (155), 141 states have internal predecessors, (155), 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-17 14:39:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 155 transitions. [2025-03-17 14:39:01,649 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 155 transitions. Word has length 70 [2025-03-17 14:39:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:01,650 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 155 transitions. [2025-03-17 14:39:01,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2025-03-17 14:39:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 14:39:01,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:01,652 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:01,658 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-17 14:39:01,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 14:39:01,853 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:39:01,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:01,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1705724720, now seen corresponding path program 1 times [2025-03-17 14:39:01,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:01,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990228033] [2025-03-17 14:39:01,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:01,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:01,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 14:39:01,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 14:39:01,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:01,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-17 14:39:01,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:01,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990228033] [2025-03-17 14:39:01,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990228033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:01,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:01,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:39:01,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514756412] [2025-03-17 14:39:01,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:01,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:01,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:01,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:01,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:01,912 INFO L87 Difference]: Start difference. First operand 142 states and 155 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 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-17 14:39:01,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:01,967 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2025-03-17 14:39:01,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:01,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 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 83 [2025-03-17 14:39:01,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:01,968 INFO L225 Difference]: With dead ends: 142 [2025-03-17 14:39:01,968 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 14:39:01,968 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-17 14:39:01,968 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:01,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 39 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:01,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 14:39:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-17 14:39:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 139 states have (on average 1.1079136690647482) internal successors, (154), 140 states have internal predecessors, (154), 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-17 14:39:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2025-03-17 14:39:01,972 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 83 [2025-03-17 14:39:01,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:01,972 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2025-03-17 14:39:01,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 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-17 14:39:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2025-03-17 14:39:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 14:39:01,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:01,973 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:01,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:39:01,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:39:01,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:01,974 INFO L85 PathProgramCache]: Analyzing trace with hash -569110294, now seen corresponding path program 2 times [2025-03-17 14:39:01,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:01,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815368407] [2025-03-17 14:39:01,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:01,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:01,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-17 14:39:01,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 89 statements. [2025-03-17 14:39:01,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:01,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:02,053 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-17 14:39:02,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:02,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815368407] [2025-03-17 14:39:02,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815368407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:02,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610433410] [2025-03-17 14:39:02,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:02,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:02,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:02,055 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-17 14:39:02,056 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-17 14:39:02,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-17 14:39:02,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 89 statements. [2025-03-17 14:39:02,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:02,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:02,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:39:02,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-17 14:39:02,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-17 14:39:02,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610433410] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:02,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:02,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 2] total 7 [2025-03-17 14:39:02,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15949509] [2025-03-17 14:39:02,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:02,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:39:02,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:02,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:39:02,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:39:02,471 INFO L87 Difference]: Start difference. First operand 141 states and 154 transitions. Second operand has 9 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-17 14:39:02,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:02,522 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2025-03-17 14:39:02,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:39:02,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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 89 [2025-03-17 14:39:02,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:02,523 INFO L225 Difference]: With dead ends: 141 [2025-03-17 14:39:02,523 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:39:02,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 171 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:39:02,524 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 100 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:02,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 15 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:39:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:39:02,524 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-17 14:39:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:39:02,524 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2025-03-17 14:39:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:02,524 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:39:02,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-17 14:39:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:39:02,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:39:02,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2025-03-17 14:39:02,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2025-03-17 14:39:02,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2025-03-17 14:39:02,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2025-03-17 14:39:02,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2025-03-17 14:39:02,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:39:02,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:02,730 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:02,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:39:02,805 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:39:02,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:39:02 BoogieIcfgContainer [2025-03-17 14:39:02,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:39:02,814 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:39:02,814 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:39:02,814 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:39:02,815 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:57" (3/4) ... [2025-03-17 14:39:02,816 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:39:02,823 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-17 14:39:02,823 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-17 14:39:02,823 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:39:02,823 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:39:02,879 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:39:02,879 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:39:02,879 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:39:02,880 INFO L158 Benchmark]: Toolchain (without parser) took 6017.95ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 78.6MB in the end (delta: 27.2MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2025-03-17 14:39:02,880 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:39:02,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.64ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 94.5MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:39:02,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.04ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 92.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:39:02,880 INFO L158 Benchmark]: Boogie Preprocessor took 25.31ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:39:02,880 INFO L158 Benchmark]: IcfgBuilder took 350.63ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 72.7MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:39:02,881 INFO L158 Benchmark]: TraceAbstraction took 5387.86ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 85.3MB in the end (delta: -12.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:39:02,881 INFO L158 Benchmark]: Witness Printer took 65.00ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 78.6MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:39:02,882 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.18ms. Allocated memory is still 201.3MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 160.64ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 94.5MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.04ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 92.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.31ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 350.63ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 72.7MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5387.86ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 85.3MB in the end (delta: -12.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 65.00ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 78.6MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 68]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 68]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 97 locations, 108 edges, 38 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1211 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1211 mSDsluCounter, 1359 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 636 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1698 IncrementalHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 723 mSDtfsCounter, 1698 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 620 GetRequests, 557 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=11, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 837 NumberOfCodeBlocks, 573 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1058 ConstructedInterpolants, 0 QuantifiedInterpolants, 3799 SizeOfPredicates, 4 NumberOfNonLiveVariables, 690 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 512/667 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 38 specifications checked. All of them hold - InvariantResult [Line: 29]: Location Invariant Derived location invariant: (((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) || ((((2 <= CELLCOUNT) && (i == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647))) - InvariantResult [Line: 68]: Location Invariant Derived location invariant: (((((i == 0) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647)) || ((((1 <= i) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 4) : ((CELLCOUNT % 4) + 4)) == 0)) && (CELLCOUNT <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:39:02,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE