./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark01_conjunctive.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/loop-zilu/benchmark01_conjunctive.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 1b503f9744330c40db60063d7713649b00b515fae7df517a0a6da071e866822e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:45:00,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:45:00,296 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:45:00,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:45:00,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:45:00,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:45:00,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:45:00,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:45:00,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:45:00,328 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:45:00,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:45:00,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:45:00,328 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:45:00,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:45:00,329 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:45:00,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:45:00,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:45:00,329 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:45:00,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:45:00,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:45:00,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:45:00,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:45:00,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:45:00,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:45:00,329 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:45:00,329 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:45:00,329 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:45:00,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:45:00,329 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:45:00,331 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:45:00,331 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:45:00,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:45:00,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:45:00,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:45:00,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:45:00,331 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:45:00,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:45:00,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:45:00,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:45:00,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:45:00,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:45:00,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:45:00,332 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:45:00,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:45:00,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:45:00,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:45:00,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:45:00,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:45:00,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:45:00,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:45:00,332 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 -> 1b503f9744330c40db60063d7713649b00b515fae7df517a0a6da071e866822e [2025-01-10 01:45:00,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:45:00,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:45:00,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:45:00,549 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:45:00,549 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:45:00,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark01_conjunctive.i [2025-01-10 01:45:01,640 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35fab253a/280db05bb843422b8b46008a7f1528a7/FLAGf65d0e004 [2025-01-10 01:45:01,824 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:45:01,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark01_conjunctive.i [2025-01-10 01:45:01,833 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35fab253a/280db05bb843422b8b46008a7f1528a7/FLAGf65d0e004 [2025-01-10 01:45:01,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35fab253a/280db05bb843422b8b46008a7f1528a7 [2025-01-10 01:45:01,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:45:01,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:45:01,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:45:01,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:45:01,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:45:01,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:45:01" (1/1) ... [2025-01-10 01:45:01,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eafad42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:01, skipping insertion in model container [2025-01-10 01:45:01,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:45:01" (1/1) ... [2025-01-10 01:45:01,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:45:01,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:45:01,985 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:45:01,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:45:02,007 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:45:02,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:02 WrapperNode [2025-01-10 01:45:02,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:45:02,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:45:02,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:45:02,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:45:02,014 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:45:02" (1/1) ... [2025-01-10 01:45:02,019 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:45:02" (1/1) ... [2025-01-10 01:45:02,030 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 38 [2025-01-10 01:45:02,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:45:02,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:45:02,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:45:02,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:45:02,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:02" (1/1) ... [2025-01-10 01:45:02,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:02" (1/1) ... [2025-01-10 01:45:02,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:02" (1/1) ... [2025-01-10 01:45:02,047 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:45:02,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:02" (1/1) ... [2025-01-10 01:45:02,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:02" (1/1) ... [2025-01-10 01:45:02,050 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:02" (1/1) ... [2025-01-10 01:45:02,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:02" (1/1) ... [2025-01-10 01:45:02,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:02" (1/1) ... [2025-01-10 01:45:02,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:02" (1/1) ... [2025-01-10 01:45:02,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:02" (1/1) ... [2025-01-10 01:45:02,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:45:02,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:45:02,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:45:02,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:45:02,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:02" (1/1) ... [2025-01-10 01:45:02,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:45:02,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:02,090 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:45:02,092 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:45:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:45:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:45:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:45:02,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:45:02,150 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:45:02,151 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:45:02,241 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-10 01:45:02,241 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:45:02,248 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:45:02,249 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 01:45:02,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:45:02 BoogieIcfgContainer [2025-01-10 01:45:02,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:45:02,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:45:02,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:45:02,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:45:02,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:45:01" (1/3) ... [2025-01-10 01:45:02,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff35c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:45:02, skipping insertion in model container [2025-01-10 01:45:02,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:02" (2/3) ... [2025-01-10 01:45:02,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff35c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:45:02, skipping insertion in model container [2025-01-10 01:45:02,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:45:02" (3/3) ... [2025-01-10 01:45:02,258 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark01_conjunctive.i [2025-01-10 01:45:02,268 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:45:02,269 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark01_conjunctive.i that has 1 procedures, 17 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-01-10 01:45:02,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:45:02,308 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;@7696ecad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:45:02,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-10 01:45:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:45:02,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:02,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:45:02,316 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:45:02,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:02,319 INFO L85 PathProgramCache]: Analyzing trace with hash 889570283, now seen corresponding path program 1 times [2025-01-10 01:45:02,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:02,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142833849] [2025-01-10 01:45:02,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:02,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:02,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:45:02,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:45:02,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:02,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:02,460 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:45:02,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:02,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142833849] [2025-01-10 01:45:02,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142833849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:02,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:45:02,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:45:02,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043814270] [2025-01-10 01:45:02,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:02,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:45:02,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:02,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:45:02,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:45:02,481 INFO L87 Difference]: Start difference. First operand has 17 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:02,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:02,509 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-01-10 01:45:02,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:45:02,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:45:02,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:02,515 INFO L225 Difference]: With dead ends: 24 [2025-01-10 01:45:02,515 INFO L226 Difference]: Without dead ends: 8 [2025-01-10 01:45:02,517 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:45:02,520 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:02,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:02,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-01-10 01:45:02,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-01-10 01:45:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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:45:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-01-10 01:45:02,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2025-01-10 01:45:02,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:02,543 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-01-10 01:45:02,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-01-10 01:45:02,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:45:02,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:02,544 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:02,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:45:02,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:45:02,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:02,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1806875048, now seen corresponding path program 1 times [2025-01-10 01:45:02,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:02,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975224490] [2025-01-10 01:45:02,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:02,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:02,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:45:02,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:45:02,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:02,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:02,590 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:45:02,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:02,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975224490] [2025-01-10 01:45:02,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975224490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:02,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:45:02,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:45:02,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888076912] [2025-01-10 01:45:02,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:02,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:45:02,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:02,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:45:02,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:45:02,593 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:02,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:02,603 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-01-10 01:45:02,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:45:02,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:45:02,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:02,604 INFO L225 Difference]: With dead ends: 13 [2025-01-10 01:45:02,604 INFO L226 Difference]: Without dead ends: 12 [2025-01-10 01:45:02,604 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:45:02,605 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:02,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:02,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-01-10 01:45:02,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-01-10 01:45:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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:45:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-01-10 01:45:02,607 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2025-01-10 01:45:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:02,607 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-01-10 01:45:02,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-01-10 01:45:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:45:02,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:02,608 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:45:02,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:45:02,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:45:02,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:02,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2063660077, now seen corresponding path program 1 times [2025-01-10 01:45:02,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:02,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558994200] [2025-01-10 01:45:02,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:02,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:02,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:45:02,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:45:02,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:02,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:02,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:02,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558994200] [2025-01-10 01:45:02,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558994200] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:02,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185814825] [2025-01-10 01:45:02,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:02,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:02,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:02,695 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:45:02,697 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:45:02,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:45:02,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:45:02,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:02,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:02,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:45:02,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:02,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:02,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185814825] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:02,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:02,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-10 01:45:02,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515291796] [2025-01-10 01:45:02,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:02,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:45:02,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:02,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:45:02,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:45:02,899 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:02,940 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2025-01-10 01:45:02,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:45:02,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 01:45:02,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:02,941 INFO L225 Difference]: With dead ends: 25 [2025-01-10 01:45:02,941 INFO L226 Difference]: Without dead ends: 24 [2025-01-10 01:45:02,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:45:02,942 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:02,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:02,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-10 01:45:02,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-10 01:45:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2025-01-10 01:45:02,949 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 11 [2025-01-10 01:45:02,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:02,949 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2025-01-10 01:45:02,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2025-01-10 01:45:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:45:02,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:02,950 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1] [2025-01-10 01:45:02,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:45:03,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:03,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:45:03,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:03,151 INFO L85 PathProgramCache]: Analyzing trace with hash -103816004, now seen corresponding path program 2 times [2025-01-10 01:45:03,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:03,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143058163] [2025-01-10 01:45:03,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:45:03,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:03,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:45:03,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:45:03,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:45:03,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:03,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:03,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143058163] [2025-01-10 01:45:03,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143058163] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:03,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284536397] [2025-01-10 01:45:03,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:45:03,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:03,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:03,403 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:45:03,405 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:45:03,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:45:03,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:45:03,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:45:03,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:03,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:45:03,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:03,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:03,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284536397] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:03,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:03,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-01-10 01:45:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496588224] [2025-01-10 01:45:03,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:03,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:45:03,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:03,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:45:03,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=153, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:45:03,699 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 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:45:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:03,748 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-01-10 01:45:03,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:45:03,748 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 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 23 [2025-01-10 01:45:03,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:03,749 INFO L225 Difference]: With dead ends: 49 [2025-01-10 01:45:03,749 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 01:45:03,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=170, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:45:03,750 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:03,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:03,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 01:45:03,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-10 01:45:03,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 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:45:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2025-01-10 01:45:03,756 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 23 [2025-01-10 01:45:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:03,756 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2025-01-10 01:45:03,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 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:45:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2025-01-10 01:45:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 01:45:03,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:03,757 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 1, 1, 1, 1] [2025-01-10 01:45:03,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:45:03,963 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:45:03,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:45:03,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:03,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1491167834, now seen corresponding path program 3 times [2025-01-10 01:45:03,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:03,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131193809] [2025-01-10 01:45:03,964 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:45:03,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:03,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 11 equivalence classes. [2025-01-10 01:45:04,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:45:04,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:45:04,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:04,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:04,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131193809] [2025-01-10 01:45:04,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131193809] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:04,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456800821] [2025-01-10 01:45:04,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:45:04,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:04,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:04,289 INFO L229 MonitoredProcess]: Starting monitored process 4 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:45:04,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:45:04,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 11 equivalence classes. [2025-01-10 01:45:04,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:45:04,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:45:04,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:04,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:45:04,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:04,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:04,873 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:04,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456800821] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:04,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:04,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-01-10 01:45:04,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323928316] [2025-01-10 01:45:04,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:04,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-10 01:45:04,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:04,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-10 01:45:04,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=648, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 01:45:04,875 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 35 states, 34 states have (on average 4.029411764705882) internal successors, (137), 35 states have internal predecessors, (137), 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:45:04,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:04,978 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2025-01-10 01:45:04,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:45:04,979 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.029411764705882) internal successors, (137), 35 states have internal predecessors, (137), 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 47 [2025-01-10 01:45:04,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:04,979 INFO L225 Difference]: With dead ends: 97 [2025-01-10 01:45:04,979 INFO L226 Difference]: Without dead ends: 96 [2025-01-10 01:45:04,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=577, Invalid=683, Unknown=0, NotChecked=0, Total=1260 [2025-01-10 01:45:04,980 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:04,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:45:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-10 01:45:04,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-10 01:45:04,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 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:45:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2025-01-10 01:45:04,994 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 47 [2025-01-10 01:45:04,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:04,994 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2025-01-10 01:45:04,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.029411764705882) internal successors, (137), 35 states have internal predecessors, (137), 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:45:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2025-01-10 01:45:04,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 01:45:04,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:04,996 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 1, 1, 1, 1] [2025-01-10 01:45:05,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:45:05,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:05,197 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:45:05,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:05,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1338247062, now seen corresponding path program 4 times [2025-01-10 01:45:05,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:05,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282618084] [2025-01-10 01:45:05,198 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:45:05,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:05,210 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 95 statements into 2 equivalence classes. [2025-01-10 01:45:05,256 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 01:45:05,256 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:45:05,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:06,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282618084] [2025-01-10 01:45:06,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282618084] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701864402] [2025-01-10 01:45:06,412 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:45:06,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:06,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:06,414 INFO L229 MonitoredProcess]: Starting monitored process 5 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:45:06,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:45:06,455 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 95 statements into 2 equivalence classes. [2025-01-10 01:45:06,475 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 01:45:06,476 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:45:06,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:06,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-10 01:45:06,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:07,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:08,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701864402] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:08,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:08,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 70 [2025-01-10 01:45:08,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676485882] [2025-01-10 01:45:08,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:08,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-01-10 01:45:08,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:08,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-01-10 01:45:08,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1926, Invalid=3044, Unknown=0, NotChecked=0, Total=4970 [2025-01-10 01:45:08,378 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand has 71 states, 70 states have (on average 4.014285714285714) internal successors, (281), 71 states have internal predecessors, (281), 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:45:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:08,506 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2025-01-10 01:45:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-10 01:45:08,506 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 4.014285714285714) internal successors, (281), 71 states have internal predecessors, (281), 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 95 [2025-01-10 01:45:08,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:08,507 INFO L225 Difference]: With dead ends: 129 [2025-01-10 01:45:08,507 INFO L226 Difference]: Without dead ends: 128 [2025-01-10 01:45:08,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1997, Invalid=3115, Unknown=0, NotChecked=0, Total=5112 [2025-01-10 01:45:08,509 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:08,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:45:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-10 01:45:08,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-01-10 01:45:08,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.0078740157480315) internal successors, (128), 127 states have internal predecessors, (128), 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:45:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2025-01-10 01:45:08,515 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 95 [2025-01-10 01:45:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:08,516 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2025-01-10 01:45:08,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 4.014285714285714) internal successors, (281), 71 states have internal predecessors, (281), 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:45:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2025-01-10 01:45:08,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-10 01:45:08,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:08,518 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 30, 1, 1, 1, 1] [2025-01-10 01:45:08,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:45:08,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-10 01:45:08,722 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-01-10 01:45:08,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:08,722 INFO L85 PathProgramCache]: Analyzing trace with hash -978682434, now seen corresponding path program 5 times [2025-01-10 01:45:08,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:08,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223710131] [2025-01-10 01:45:08,723 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:45:08,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:08,733 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 127 statements into 31 equivalence classes. [2025-01-10 01:45:08,885 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 127 of 127 statements. [2025-01-10 01:45:08,886 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-01-10 01:45:08,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:45:08,886 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:45:08,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-10 01:45:08,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-10 01:45:08,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:08,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:45:08,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:45:08,940 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:45:08,940 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2025-01-10 01:45:08,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2025-01-10 01:45:08,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:45:08,944 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2025-01-10 01:45:08,974 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:45:08,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:45:08 BoogieIcfgContainer [2025-01-10 01:45:08,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:45:08,976 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:45:08,976 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:45:08,977 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:45:08,977 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:45:02" (3/4) ... [2025-01-10 01:45:08,978 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 01:45:09,012 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 33. [2025-01-10 01:45:09,059 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:45:09,059 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:45:09,059 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:45:09,060 INFO L158 Benchmark]: Toolchain (without parser) took 7197.80ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 124.2MB in the beginning and 216.0MB in the end (delta: -91.7MB). Peak memory consumption was 91.7MB. Max. memory is 16.1GB. [2025-01-10 01:45:09,060 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:45:09,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.19ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 114.4MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:45:09,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.34ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 113.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:45:09,060 INFO L158 Benchmark]: Boogie Preprocessor took 27.42ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 111.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:45:09,061 INFO L158 Benchmark]: RCFGBuilder took 190.09ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 101.5MB in the end (delta: 9.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:45:09,061 INFO L158 Benchmark]: TraceAbstraction took 6724.86ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 101.5MB in the beginning and 225.1MB in the end (delta: -123.6MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2025-01-10 01:45:09,061 INFO L158 Benchmark]: Witness Printer took 82.76ms. Allocated memory is still 352.3MB. Free memory was 225.1MB in the beginning and 216.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:45:09,062 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 145.19ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 114.4MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.34ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 113.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.42ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 111.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 190.09ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 101.5MB in the end (delta: 9.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6724.86ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 101.5MB in the beginning and 225.1MB in the end (delta: -123.6MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. * Witness Printer took 82.76ms. Allocated memory is still 352.3MB. Free memory was 225.1MB in the beginning and 216.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 24]: integer overflow possible integer overflow possible We found a FailurePath: [L20] int x = __VERIFIER_nondet_int(); [L21] int y = __VERIFIER_nondet_int(); [L22] COND FALSE !(!(x==1 && y==1)) VAL [x=1, y=1] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=2, y=2] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=4, y=4] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=8, y=8] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=16, y=16] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=32, y=32] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=64, y=64] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=128, y=128] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=256, y=256] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=512, y=512] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=1024, y=1024] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=2048, y=2048] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=4096, y=4096] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=8192, y=8192] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=16384, y=16384] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=32768, y=32768] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=65536, y=65536] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=131072, y=131072] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=262144, y=262144] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=524288, y=524288] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=1048576, y=1048576] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=2097152, y=2097152] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=4194304, y=4194304] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=8388608, y=8388608] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=16777216, y=16777216] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=33554432, y=33554432] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=67108864, y=67108864] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=134217728, y=134217728] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=268435456, y=268435456] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=536870912, y=536870912] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=1073741824, y=1073741824] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] x+y - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 7, TraceHistogramMax: 31, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 202 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 235 IncrementalHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 42 mSDtfsCounter, 235 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=6, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 492 NumberOfCodeBlocks, 492 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 527 ConstructedInterpolants, 0 QuantifiedInterpolants, 3075 SizeOfPredicates, 8 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3828 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 RESULT: Ultimate proved your program to be incorrect! [2025-01-10 01:45:09,081 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)