./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-examples/standard_init6_ground-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-examples/standard_init6_ground-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 388c926a79a6b5e7bef889b40d9a18e5c4aeb62f40be1f5a1ab2f0fe0344f6c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:18:49,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:18:49,501 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:18:49,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:18:49,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:18:49,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:18:49,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:18:49,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:18:49,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:18:49,528 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:18:49,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:18:49,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:18:49,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:18:49,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:18:49,529 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:18:49,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:18:49,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:18:49,529 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:18:49,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:18:49,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:18:49,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:18:49,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:18:49,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:18:49,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:18:49,530 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:18:49,530 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:18:49,530 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:18:49,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:18:49,530 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:18:49,530 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:18:49,531 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:18:49,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:18:49,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:18:49,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:18:49,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:18:49,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:18:49,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:18:49,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:18:49,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:18:49,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:18:49,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:18:49,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:18:49,532 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:18:49,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:18:49,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:18:49,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:18:49,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:18:49,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:18:49,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:18:49,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:18:49,532 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-jdk21/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 -> 388c926a79a6b5e7bef889b40d9a18e5c4aeb62f40be1f5a1ab2f0fe0344f6c1 [2025-01-10 01:18:49,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:18:49,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:18:49,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:18:49,702 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:18:49,702 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:18:49,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_init6_ground-2.i [2025-01-10 01:18:50,977 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd043e5aa/fd3a7396b0fc4f3fb7d47f3aa21e67ec/FLAG01eee7ff7 [2025-01-10 01:18:51,224 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:18:51,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-examples/standard_init6_ground-2.i [2025-01-10 01:18:51,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd043e5aa/fd3a7396b0fc4f3fb7d47f3aa21e67ec/FLAG01eee7ff7 [2025-01-10 01:18:51,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd043e5aa/fd3a7396b0fc4f3fb7d47f3aa21e67ec [2025-01-10 01:18:51,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:18:51,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:18:51,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:18:51,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:18:51,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:18:51,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:18:51" (1/1) ... [2025-01-10 01:18:51,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a2495ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:51, skipping insertion in model container [2025-01-10 01:18:51,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:18:51" (1/1) ... [2025-01-10 01:18:51,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:18:51,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:18:51,705 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:18:51,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:18:51,729 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:18:51,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:51 WrapperNode [2025-01-10 01:18:51,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:18:51,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:18:51,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:18:51,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:18:51,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:51" (1/1) ... [2025-01-10 01:18:51,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:51" (1/1) ... [2025-01-10 01:18:51,753 INFO L138 Inliner]: procedures = 15, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2025-01-10 01:18:51,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:18:51,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:18:51,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:18:51,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:18:51,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:51" (1/1) ... [2025-01-10 01:18:51,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:51" (1/1) ... [2025-01-10 01:18:51,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:51" (1/1) ... [2025-01-10 01:18:51,775 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-01-10 01:18:51,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:51" (1/1) ... [2025-01-10 01:18:51,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:51" (1/1) ... [2025-01-10 01:18:51,781 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:51" (1/1) ... [2025-01-10 01:18:51,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:51" (1/1) ... [2025-01-10 01:18:51,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:51" (1/1) ... [2025-01-10 01:18:51,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:51" (1/1) ... [2025-01-10 01:18:51,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:51" (1/1) ... [2025-01-10 01:18:51,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:18:51,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:18:51,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:18:51,790 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:18:51,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:51" (1/1) ... [2025-01-10 01:18:51,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:18:51,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:51,816 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:18:51,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:18:51,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:18:51,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:18:51,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:18:51,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:18:51,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:18:51,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:18:51,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:18:51,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:18:51,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:18:51,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:18:51,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:18:51,883 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:18:51,884 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:18:52,042 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-10 01:18:52,042 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:18:52,049 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:18:52,049 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:18:52,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:18:52 BoogieIcfgContainer [2025-01-10 01:18:52,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:18:52,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:18:52,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:18:52,054 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:18:52,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:18:51" (1/3) ... [2025-01-10 01:18:52,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b8d56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:18:52, skipping insertion in model container [2025-01-10 01:18:52,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:18:51" (2/3) ... [2025-01-10 01:18:52,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b8d56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:18:52, skipping insertion in model container [2025-01-10 01:18:52,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:18:52" (3/3) ... [2025-01-10 01:18:52,056 INFO L128 eAbstractionObserver]: Analyzing ICFG standard_init6_ground-2.i [2025-01-10 01:18:52,065 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:18:52,066 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG standard_init6_ground-2.i that has 1 procedures, 45 locations, 1 initial locations, 7 loop locations, and 14 error locations. [2025-01-10 01:18:52,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:18:52,125 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;@7eec830, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:18:52,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-10 01:18:52,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 01:18:52,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:52,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 01:18:52,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:18:52,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:52,146 INFO L85 PathProgramCache]: Analyzing trace with hash 925636, now seen corresponding path program 1 times [2025-01-10 01:18:52,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:52,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743151935] [2025-01-10 01:18:52,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:52,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:18:52,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:18:52,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:52,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:18:52,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:52,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743151935] [2025-01-10 01:18:52,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743151935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:52,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:52,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:18:52,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223020456] [2025-01-10 01:18:52,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:52,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:52,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:52,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:52,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:18:52,393 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:52,570 INFO L93 Difference]: Finished difference Result 102 states and 133 transitions. [2025-01-10 01:18:52,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:52,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 01:18:52,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:52,584 INFO L225 Difference]: With dead ends: 102 [2025-01-10 01:18:52,587 INFO L226 Difference]: Without dead ends: 57 [2025-01-10 01:18:52,590 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-01-10 01:18:52,593 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:52,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 44 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:18:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-10 01:18:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-10 01:18:52,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 56 states have internal predecessors, (63), 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-01-10 01:18:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2025-01-10 01:18:52,641 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 4 [2025-01-10 01:18:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:52,645 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2025-01-10 01:18:52,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2025-01-10 01:18:52,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:18:52,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:52,646 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 01:18:52,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:18:52,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:18:52,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:52,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1805857894, now seen corresponding path program 1 times [2025-01-10 01:18:52,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:52,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652110770] [2025-01-10 01:18:52,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:52,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:52,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:18:52,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:18:52,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:52,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:52,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:18:52,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:52,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652110770] [2025-01-10 01:18:52,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652110770] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:52,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347857829] [2025-01-10 01:18:52,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:52,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:52,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:52,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:18:52,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:18:52,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:18:52,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:18:52,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:52,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:52,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:18:52,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:18:52,822 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:18:52,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347857829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:52,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:18:52,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 01:18:52,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505650118] [2025-01-10 01:18:52,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:52,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:52,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:52,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:52,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:18:52,824 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-01-10 01:18:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:52,902 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2025-01-10 01:18:52,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:52,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-01-10 01:18:52,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:52,903 INFO L225 Difference]: With dead ends: 57 [2025-01-10 01:18:52,903 INFO L226 Difference]: Without dead ends: 51 [2025-01-10 01:18:52,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:18:52,904 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:52,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 25 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:18:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-10 01:18:52,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-10 01:18:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 50 states have internal predecessors, (57), 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-01-10 01:18:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2025-01-10 01:18:52,909 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 7 [2025-01-10 01:18:52,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:52,909 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2025-01-10 01:18:52,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-01-10 01:18:52,909 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2025-01-10 01:18:52,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:18:52,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:52,909 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 01:18:52,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:18:53,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:53,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:18:53,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:53,111 INFO L85 PathProgramCache]: Analyzing trace with hash 147019906, now seen corresponding path program 1 times [2025-01-10 01:18:53,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:53,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747980349] [2025-01-10 01:18:53,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:53,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:53,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:18:53,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:18:53,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:53,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:18:53,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:53,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747980349] [2025-01-10 01:18:53,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747980349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:53,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:53,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:18:53,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264164850] [2025-01-10 01:18:53,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:53,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:18:53,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:53,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:18:53,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:18:53,137 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:53,182 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2025-01-10 01:18:53,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:18:53,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:18:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:53,183 INFO L225 Difference]: With dead ends: 51 [2025-01-10 01:18:53,183 INFO L226 Difference]: Without dead ends: 45 [2025-01-10 01:18:53,183 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-01-10 01:18:53,184 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:53,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 23 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:53,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-10 01:18:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2025-01-10 01:18:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-01-10 01:18:53,212 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 8 [2025-01-10 01:18:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:53,212 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-01-10 01:18:53,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-01-10 01:18:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 01:18:53,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:53,212 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-01-10 01:18:53,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:18:53,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:18:53,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:53,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1981117206, now seen corresponding path program 1 times [2025-01-10 01:18:53,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:53,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409076127] [2025-01-10 01:18:53,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:53,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:53,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:18:53,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:18:53,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:53,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:18:53,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:53,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409076127] [2025-01-10 01:18:53,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409076127] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:18:53,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347010835] [2025-01-10 01:18:53,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:53,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:53,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:18:53,274 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:18:53,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:18:53,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:18:53,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:18:53,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:53,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:53,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:18:53,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:18:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:18:53,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:18:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:18:53,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347010835] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:18:53,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:18:53,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 01:18:53,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749529251] [2025-01-10 01:18:53,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:18:53,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:18:53,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:53,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:18:53,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:18:53,349 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:53,460 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2025-01-10 01:18:53,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:18:53,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-10 01:18:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:53,461 INFO L225 Difference]: With dead ends: 114 [2025-01-10 01:18:53,461 INFO L226 Difference]: Without dead ends: 87 [2025-01-10 01:18:53,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:18:53,462 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 74 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:53,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 31 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:18:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-10 01:18:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-01-10 01:18:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 86 states have internal predecessors, (93), 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-01-10 01:18:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2025-01-10 01:18:53,468 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 30 [2025-01-10 01:18:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:53,468 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2025-01-10 01:18:53,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2025-01-10 01:18:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 01:18:53,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:53,469 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:53,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:18:53,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:18:53,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:18:53,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:53,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1772350160, now seen corresponding path program 2 times [2025-01-10 01:18:53,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:53,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780879929] [2025-01-10 01:18:53,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:18:53,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:53,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-01-10 01:18:53,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 84 statements. [2025-01-10 01:18:53,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:18:53,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-01-10 01:18:53,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:53,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780879929] [2025-01-10 01:18:53,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780879929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:53,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:53,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:18:53,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235939905] [2025-01-10 01:18:53,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:53,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:53,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:53,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:53,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:53,799 INFO L87 Difference]: Start difference. First operand 87 states and 93 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-01-10 01:18:53,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:53,838 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2025-01-10 01:18:53,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:53,839 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 84 [2025-01-10 01:18:53,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:53,839 INFO L225 Difference]: With dead ends: 87 [2025-01-10 01:18:53,839 INFO L226 Difference]: Without dead ends: 86 [2025-01-10 01:18:53,839 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-01-10 01:18:53,840 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:53,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:53,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-10 01:18:53,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-01-10 01:18:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:18:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2025-01-10 01:18:53,853 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 84 [2025-01-10 01:18:53,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:53,854 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2025-01-10 01:18:53,854 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-01-10 01:18:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2025-01-10 01:18:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 01:18:53,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:53,861 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:53,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:18:53,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:18:53,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:53,861 INFO L85 PathProgramCache]: Analyzing trace with hash 891720004, now seen corresponding path program 1 times [2025-01-10 01:18:53,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:53,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446722181] [2025-01-10 01:18:53,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:53,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:53,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 01:18:53,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 01:18:53,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:53,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-01-10 01:18:54,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:54,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446722181] [2025-01-10 01:18:54,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446722181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:54,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:54,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:18:54,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215316878] [2025-01-10 01:18:54,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:54,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:54,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:54,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:54,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:54,225 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-01-10 01:18:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:54,246 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2025-01-10 01:18:54,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:54,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 85 [2025-01-10 01:18:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:54,248 INFO L225 Difference]: With dead ends: 92 [2025-01-10 01:18:54,248 INFO L226 Difference]: Without dead ends: 91 [2025-01-10 01:18:54,248 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-01-10 01:18:54,248 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:54,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-10 01:18:54,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-10 01:18:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.0777777777777777) 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-01-10 01:18:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2025-01-10 01:18:54,260 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 85 [2025-01-10 01:18:54,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:54,261 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2025-01-10 01:18:54,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-01-10 01:18:54,261 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2025-01-10 01:18:54,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-10 01:18:54,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:18:54,262 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:18:54,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:18:54,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-01-10 01:18:54,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:18:54,263 INFO L85 PathProgramCache]: Analyzing trace with hash -86893280, now seen corresponding path program 1 times [2025-01-10 01:18:54,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:18:54,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896728485] [2025-01-10 01:18:54,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:18:54,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:18:54,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 01:18:54,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 01:18:54,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:18:54,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:18:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-01-10 01:18:54,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:18:54,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896728485] [2025-01-10 01:18:54,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896728485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:18:54,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:18:54,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:18:54,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090249406] [2025-01-10 01:18:54,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:18:54,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:18:54,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:18:54,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:18:54,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:18:54,423 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-01-10 01:18:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:18:54,440 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2025-01-10 01:18:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:18:54,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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 90 [2025-01-10 01:18:54,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:18:54,440 INFO L225 Difference]: With dead ends: 91 [2025-01-10 01:18:54,440 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:18:54,441 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-01-10 01:18:54,441 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:18:54,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:18:54,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:18:54,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:18:54,442 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-01-10 01:18:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:18:54,442 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2025-01-10 01:18:54,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:18:54,442 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:18:54,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-01-10 01:18:54,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:18:54,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:18:54,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2025-01-10 01:18:54,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2025-01-10 01:18:54,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-01-10 01:18:54,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-01-10 01:18:54,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-01-10 01:18:54,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-01-10 01:18:54,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2025-01-10 01:18:54,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2025-01-10 01:18:54,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-01-10 01:18:54,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-01-10 01:18:54,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-01-10 01:18:54,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-01-10 01:18:54,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-01-10 01:18:54,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-01-10 01:18:54,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:18:54,448 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-01-10 01:18:54,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:18:54,506 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:18:54,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:18:54 BoogieIcfgContainer [2025-01-10 01:18:54,527 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:18:54,528 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:18:54,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:18:54,528 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:18:54,529 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:18:52" (3/4) ... [2025-01-10 01:18:54,530 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:18:54,544 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-10 01:18:54,547 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:18:54,548 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:18:54,548 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:18:54,641 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:18:54,641 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:18:54,641 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:18:54,642 INFO L158 Benchmark]: Toolchain (without parser) took 3085.61ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 64.1MB in the end (delta: 46.0MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2025-01-10 01:18:54,642 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:18:54,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.09ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 99.3MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:18:54,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.65ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 98.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:18:54,643 INFO L158 Benchmark]: Boogie Preprocessor took 33.96ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 96.1MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:18:54,643 INFO L158 Benchmark]: RCFGBuilder took 259.67ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 83.6MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:18:54,643 INFO L158 Benchmark]: TraceAbstraction took 2476.56ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 70.2MB in the end (delta: 12.4MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2025-01-10 01:18:54,643 INFO L158 Benchmark]: Witness Printer took 113.46ms. Allocated memory is still 142.6MB. Free memory was 70.2MB in the beginning and 64.1MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:18:54,644 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.09ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 99.3MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.65ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 98.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.96ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 96.1MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 259.67ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 83.6MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2476.56ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 70.2MB in the end (delta: 12.4MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Witness Printer took 113.46ms. Allocated memory is still 142.6MB. Free memory was 70.2MB in the beginning and 64.1MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: 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: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: 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, 45 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 357 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 204 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 292 IncrementalHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 153 mSDtfsCounter, 292 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=6, InterpolantAutomatonStates: 28, 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, 7 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 345 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 160 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 421/426 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 14 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (0 < ((long long) x + 1)) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:18:54,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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