./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-52.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e7037638bfc89d1603e251f5487ce9312923d7aa6beb63f860e372ba0b9ad000 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:43:18,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:43:18,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:43:18,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:43:18,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:43:18,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:43:18,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:43:18,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:43:18,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:43:18,500 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:43:18,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:43:18,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:43:18,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:43:18,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:43:18,501 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:43:18,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:43:18,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:43:18,502 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:43:18,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:43:18,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:43:18,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:43:18,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:43:18,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:43:18,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:43:18,502 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:43:18,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:43:18,502 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:43:18,503 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:43:18,503 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:43:18,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:43:18,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:43:18,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:43:18,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:43:18,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:43:18,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:43:18,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:43:18,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:43:18,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:43:18,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:43:18,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:43:18,504 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:43:18,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:43:18,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:43:18,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:43:18,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:43:18,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:43:18,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:43:18,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:43:18,505 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 ! call(reach_error())) ) 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 -> e7037638bfc89d1603e251f5487ce9312923d7aa6beb63f860e372ba0b9ad000 [2025-01-09 13:43:18,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:43:18,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:43:18,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:43:18,695 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:43:18,695 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:43:18,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-52.i [2025-01-09 13:43:19,788 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1a0b1553/b84907e5911145f9b38db8af9b15ca0a/FLAG465b7b9fd [2025-01-09 13:43:20,014 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:43:20,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-52.i [2025-01-09 13:43:20,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1a0b1553/b84907e5911145f9b38db8af9b15ca0a/FLAG465b7b9fd [2025-01-09 13:43:20,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1a0b1553/b84907e5911145f9b38db8af9b15ca0a [2025-01-09 13:43:20,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:43:20,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:43:20,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:43:20,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:43:20,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:43:20,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:43:20" (1/1) ... [2025-01-09 13:43:20,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49efd45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:43:20, skipping insertion in model container [2025-01-09 13:43:20,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:43:20" (1/1) ... [2025-01-09 13:43:20,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:43:20,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-52.i[915,928] [2025-01-09 13:43:20,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:43:20,203 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:43:20,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-52.i[915,928] [2025-01-09 13:43:20,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:43:20,238 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:43:20,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:43:20 WrapperNode [2025-01-09 13:43:20,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:43:20,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:43:20,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:43:20,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:43:20,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:43:20" (1/1) ... [2025-01-09 13:43:20,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:43:20" (1/1) ... [2025-01-09 13:43:20,264 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-01-09 13:43:20,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:43:20,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:43:20,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:43:20,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:43:20,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:43:20" (1/1) ... [2025-01-09 13:43:20,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:43:20" (1/1) ... [2025-01-09 13:43:20,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:43:20" (1/1) ... [2025-01-09 13:43:20,285 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-09 13:43:20,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:43:20" (1/1) ... [2025-01-09 13:43:20,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:43:20" (1/1) ... [2025-01-09 13:43:20,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:43:20" (1/1) ... [2025-01-09 13:43:20,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:43:20" (1/1) ... [2025-01-09 13:43:20,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:43:20" (1/1) ... [2025-01-09 13:43:20,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:43:20" (1/1) ... [2025-01-09 13:43:20,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:43:20" (1/1) ... [2025-01-09 13:43:20,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:43:20,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:43:20,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:43:20,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:43:20,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:43:20" (1/1) ... [2025-01-09 13:43:20,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:43:20,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:43:20,331 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-09 13:43:20,339 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-09 13:43:20,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:43:20,355 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:43:20,355 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:43:20,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:43:20,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:43:20,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:43:20,415 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:43:20,416 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:43:20,700 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 13:43:20,700 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:43:20,708 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:43:20,708 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:43:20,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:43:20 BoogieIcfgContainer [2025-01-09 13:43:20,709 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:43:20,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:43:20,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:43:20,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:43:20,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:43:20" (1/3) ... [2025-01-09 13:43:20,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1238e7c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:43:20, skipping insertion in model container [2025-01-09 13:43:20,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:43:20" (2/3) ... [2025-01-09 13:43:20,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1238e7c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:43:20, skipping insertion in model container [2025-01-09 13:43:20,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:43:20" (3/3) ... [2025-01-09 13:43:20,716 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-52.i [2025-01-09 13:43:20,725 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:43:20,727 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-52.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:43:20,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:43:20,767 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;@33fb1465, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:43:20,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:43:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 13:43:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 13:43:20,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:43:20,776 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:43:20,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:43:20,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:43:20,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1786952717, now seen corresponding path program 1 times [2025-01-09 13:43:20,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:43:20,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995896210] [2025-01-09 13:43:20,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:43:20,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:43:20,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 13:43:20,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 13:43:20,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:43:20,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:43:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 13:43:20,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:43:20,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995896210] [2025-01-09 13:43:20,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995896210] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:43:20,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200205014] [2025-01-09 13:43:20,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:43:20,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:43:20,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:43:20,943 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-09 13:43:20,945 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-09 13:43:21,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 13:43:21,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 13:43:21,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:43:21,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:43:21,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:43:21,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:43:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 13:43:21,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:43:21,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200205014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:43:21,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:43:21,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:43:21,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806204517] [2025-01-09 13:43:21,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:43:21,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:43:21,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:43:21,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:43:21,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:43:21,159 INFO L87 Difference]: Start difference. First operand has 51 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 13:43:21,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:43:21,173 INFO L93 Difference]: Finished difference Result 99 states and 157 transitions. [2025-01-09 13:43:21,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:43:21,174 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 86 [2025-01-09 13:43:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:43:21,180 INFO L225 Difference]: With dead ends: 99 [2025-01-09 13:43:21,180 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 13:43:21,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:43:21,184 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:43:21,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:43:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 13:43:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-09 13:43:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 13:43:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-01-09 13:43:21,206 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 86 [2025-01-09 13:43:21,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:43:21,206 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-01-09 13:43:21,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 13:43:21,207 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-01-09 13:43:21,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 13:43:21,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:43:21,208 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:43:21,215 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-09 13:43:21,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:43:21,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:43:21,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:43:21,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1911067661, now seen corresponding path program 1 times [2025-01-09 13:43:21,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:43:21,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630239890] [2025-01-09 13:43:21,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:43:21,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:43:21,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 13:43:21,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 13:43:21,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:43:21,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:43:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 13:43:38,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:43:38,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630239890] [2025-01-09 13:43:38,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630239890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:43:38,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:43:38,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 13:43:38,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838722956] [2025-01-09 13:43:38,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:43:38,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 13:43:38,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:43:38,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 13:43:38,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-01-09 13:43:38,116 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 13:43:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:43:45,588 INFO L93 Difference]: Finished difference Result 162 states and 226 transitions. [2025-01-09 13:43:45,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 13:43:45,589 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 86 [2025-01-09 13:43:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:43:45,591 INFO L225 Difference]: With dead ends: 162 [2025-01-09 13:43:45,591 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 13:43:45,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=312, Invalid=948, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 13:43:45,592 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 453 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:43:45,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 358 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 13:43:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 13:43:45,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 100. [2025-01-09 13:43:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 13:43:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 148 transitions. [2025-01-09 13:43:45,616 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 148 transitions. Word has length 86 [2025-01-09 13:43:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:43:45,617 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 148 transitions. [2025-01-09 13:43:45,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 13:43:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 148 transitions. [2025-01-09 13:43:45,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 13:43:45,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:43:45,619 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:43:45,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:43:45,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:43:45,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:43:45,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1069337331, now seen corresponding path program 1 times [2025-01-09 13:43:45,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:43:45,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441090443] [2025-01-09 13:43:45,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:43:45,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:43:45,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 13:43:45,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 13:43:45,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:43:45,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:43:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 13:43:50,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:43:50,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441090443] [2025-01-09 13:43:50,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441090443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:43:50,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:43:50,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 13:43:50,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984270987] [2025-01-09 13:43:50,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:43:50,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 13:43:50,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:43:50,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 13:43:50,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:43:50,405 INFO L87 Difference]: Start difference. First operand 100 states and 148 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 13:43:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:43:51,460 INFO L93 Difference]: Finished difference Result 295 states and 422 transitions. [2025-01-09 13:43:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 13:43:51,461 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2025-01-09 13:43:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:43:51,463 INFO L225 Difference]: With dead ends: 295 [2025-01-09 13:43:51,463 INFO L226 Difference]: Without dead ends: 238 [2025-01-09 13:43:51,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2025-01-09 13:43:51,464 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 189 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 13:43:51,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 421 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 13:43:51,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-01-09 13:43:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 155. [2025-01-09 13:43:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 115 states have (on average 1.3391304347826087) internal successors, (154), 115 states have internal predecessors, (154), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 13:43:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 226 transitions. [2025-01-09 13:43:51,499 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 226 transitions. Word has length 86 [2025-01-09 13:43:51,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:43:51,499 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 226 transitions. [2025-01-09 13:43:51,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 13:43:51,499 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 226 transitions. [2025-01-09 13:43:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 13:43:51,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:43:51,505 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:43:51,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:43:51,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:43:51,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:43:51,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1104035957, now seen corresponding path program 1 times [2025-01-09 13:43:51,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:43:51,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879119106] [2025-01-09 13:43:51,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:43:51,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:43:51,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 13:43:51,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 13:43:51,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:43:51,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:43:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 13:43:51,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:43:51,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879119106] [2025-01-09 13:43:51,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879119106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:43:51,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:43:51,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:43:51,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431511187] [2025-01-09 13:43:51,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:43:51,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:43:51,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:43:51,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:43:51,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:43:51,590 INFO L87 Difference]: Start difference. First operand 155 states and 226 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 13:43:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:43:51,711 INFO L93 Difference]: Finished difference Result 200 states and 292 transitions. [2025-01-09 13:43:51,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:43:51,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2025-01-09 13:43:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:43:51,715 INFO L225 Difference]: With dead ends: 200 [2025-01-09 13:43:51,716 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 13:43:51,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:43:51,718 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 76 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:43:51,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 94 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:43:51,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 13:43:51,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-01-09 13:43:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 115 states have (on average 1.3130434782608695) internal successors, (151), 115 states have internal predecessors, (151), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 13:43:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 223 transitions. [2025-01-09 13:43:51,742 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 223 transitions. Word has length 86 [2025-01-09 13:43:51,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:43:51,743 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 223 transitions. [2025-01-09 13:43:51,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 13:43:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 223 transitions. [2025-01-09 13:43:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 13:43:51,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:43:51,744 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:43:51,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:43:51,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:43:51,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:43:51,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1749941353, now seen corresponding path program 1 times [2025-01-09 13:43:51,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:43:51,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389484468] [2025-01-09 13:43:51,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:43:51,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:43:51,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 13:43:51,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 13:43:51,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:43:51,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:43:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 13:43:54,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:43:54,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389484468] [2025-01-09 13:43:54,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389484468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:43:54,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:43:54,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 13:43:54,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982296754] [2025-01-09 13:43:54,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:43:54,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 13:43:54,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:43:54,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 13:43:54,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:43:54,634 INFO L87 Difference]: Start difference. First operand 155 states and 223 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 13:43:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:43:55,694 INFO L93 Difference]: Finished difference Result 363 states and 519 transitions. [2025-01-09 13:43:55,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 13:43:55,695 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2025-01-09 13:43:55,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:43:55,697 INFO L225 Difference]: With dead ends: 363 [2025-01-09 13:43:55,697 INFO L226 Difference]: Without dead ends: 261 [2025-01-09 13:43:55,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=278, Invalid=714, Unknown=0, NotChecked=0, Total=992 [2025-01-09 13:43:55,698 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 212 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:43:55,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 197 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 13:43:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-01-09 13:43:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 183. [2025-01-09 13:43:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 13:43:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 266 transitions. [2025-01-09 13:43:55,711 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 266 transitions. Word has length 87 [2025-01-09 13:43:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:43:55,711 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 266 transitions. [2025-01-09 13:43:55,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 13:43:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 266 transitions. [2025-01-09 13:43:55,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 13:43:55,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:43:55,712 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:43:55,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:43:55,713 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:43:55,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:43:55,713 INFO L85 PathProgramCache]: Analyzing trace with hash 47174541, now seen corresponding path program 1 times [2025-01-09 13:43:55,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:43:55,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582670899] [2025-01-09 13:43:55,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:43:55,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:43:55,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 13:43:55,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 13:43:55,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:43:55,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:43:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 13:43:59,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:43:59,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582670899] [2025-01-09 13:43:59,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582670899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:43:59,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:43:59,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 13:43:59,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703617546] [2025-01-09 13:43:59,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:43:59,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 13:43:59,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:43:59,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 13:43:59,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:43:59,347 INFO L87 Difference]: Start difference. First operand 183 states and 266 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 13:44:00,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:44:00,737 INFO L93 Difference]: Finished difference Result 316 states and 449 transitions. [2025-01-09 13:44:00,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 13:44:00,738 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2025-01-09 13:44:00,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:44:00,740 INFO L225 Difference]: With dead ends: 316 [2025-01-09 13:44:00,741 INFO L226 Difference]: Without dead ends: 251 [2025-01-09 13:44:00,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2025-01-09 13:44:00,742 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 213 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:44:00,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 248 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:44:00,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-01-09 13:44:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 179. [2025-01-09 13:44:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.330935251798561) internal successors, (185), 139 states have internal predecessors, (185), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 13:44:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 257 transitions. [2025-01-09 13:44:00,759 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 257 transitions. Word has length 87 [2025-01-09 13:44:00,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:44:00,759 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 257 transitions. [2025-01-09 13:44:00,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 13:44:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 257 transitions. [2025-01-09 13:44:00,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 13:44:00,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:44:00,760 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:44:00,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:44:00,762 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:44:00,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:44:00,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2049551219, now seen corresponding path program 1 times [2025-01-09 13:44:00,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:44:00,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667209179] [2025-01-09 13:44:00,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:44:00,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:44:00,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 13:44:00,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 13:44:00,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:44:00,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:44:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 13:44:03,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:44:03,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667209179] [2025-01-09 13:44:03,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667209179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:44:03,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:44:03,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 13:44:03,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665297581] [2025-01-09 13:44:03,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:44:03,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 13:44:03,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:44:03,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 13:44:03,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:44:03,565 INFO L87 Difference]: Start difference. First operand 179 states and 257 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 13:44:03,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:44:03,923 INFO L93 Difference]: Finished difference Result 357 states and 499 transitions. [2025-01-09 13:44:03,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:44:03,924 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2025-01-09 13:44:03,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:44:03,925 INFO L225 Difference]: With dead ends: 357 [2025-01-09 13:44:03,925 INFO L226 Difference]: Without dead ends: 223 [2025-01-09 13:44:03,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-01-09 13:44:03,926 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 148 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:44:03,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 248 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:44:03,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-01-09 13:44:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 140. [2025-01-09 13:44:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 105 states have (on average 1.2190476190476192) internal successors, (128), 106 states have internal predecessors, (128), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 13:44:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 188 transitions. [2025-01-09 13:44:03,945 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 188 transitions. Word has length 87 [2025-01-09 13:44:03,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:44:03,945 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 188 transitions. [2025-01-09 13:44:03,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 13:44:03,946 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 188 transitions. [2025-01-09 13:44:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 13:44:03,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:44:03,947 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:44:03,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 13:44:03,948 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:44:03,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:44:03,949 INFO L85 PathProgramCache]: Analyzing trace with hash -138505831, now seen corresponding path program 1 times [2025-01-09 13:44:03,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:44:03,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135816471] [2025-01-09 13:44:03,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:44:03,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:44:03,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 13:44:03,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 13:44:03,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:44:03,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:44:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 13:44:07,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:44:07,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135816471] [2025-01-09 13:44:07,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135816471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:44:07,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:44:07,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 13:44:07,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661447305] [2025-01-09 13:44:07,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:44:07,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:44:07,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:44:07,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:44:07,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:44:07,994 INFO L87 Difference]: Start difference. First operand 140 states and 188 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 13:44:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:44:08,369 INFO L93 Difference]: Finished difference Result 237 states and 316 transitions. [2025-01-09 13:44:08,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:44:08,369 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 87 [2025-01-09 13:44:08,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:44:08,376 INFO L225 Difference]: With dead ends: 237 [2025-01-09 13:44:08,376 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 13:44:08,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:44:08,377 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 102 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:44:08,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 319 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:44:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 13:44:08,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2025-01-09 13:44:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 92 states have (on average 1.2065217391304348) internal successors, (111), 93 states have internal predecessors, (111), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 13:44:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 171 transitions. [2025-01-09 13:44:08,407 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 171 transitions. Word has length 87 [2025-01-09 13:44:08,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:44:08,409 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 171 transitions. [2025-01-09 13:44:08,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 13:44:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 171 transitions. [2025-01-09 13:44:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 13:44:08,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:44:08,412 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:44:08,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 13:44:08,413 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:44:08,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:44:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash 397781280, now seen corresponding path program 1 times [2025-01-09 13:44:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:44:08,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957973705] [2025-01-09 13:44:08,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:44:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:44:08,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 13:44:08,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 13:44:08,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:44:08,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:44:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 13:44:08,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:44:08,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957973705] [2025-01-09 13:44:08,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957973705] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:44:08,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244950155] [2025-01-09 13:44:08,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:44:08,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:44:08,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:44:08,475 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-09 13:44:08,477 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-09 13:44:08,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 13:44:08,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 13:44:08,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:44:08,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:44:08,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 13:44:08,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:44:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-01-09 13:44:08,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:44:08,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244950155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:44:08,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:44:08,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 13:44:08,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851761593] [2025-01-09 13:44:08,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:44:08,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:44:08,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:44:08,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:44:08,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:44:08,646 INFO L87 Difference]: Start difference. First operand 127 states and 171 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 13:44:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:44:08,670 INFO L93 Difference]: Finished difference Result 143 states and 189 transitions. [2025-01-09 13:44:08,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:44:08,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 169 [2025-01-09 13:44:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:44:08,672 INFO L225 Difference]: With dead ends: 143 [2025-01-09 13:44:08,672 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 13:44:08,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:44:08,673 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:44:08,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 108 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:44:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 13:44:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 13:44:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 13:44:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 13:44:08,673 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 169 [2025-01-09 13:44:08,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:44:08,673 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 13:44:08,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 13:44:08,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 13:44:08,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 13:44:08,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:44:08,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 13:44:08,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:44:08,880 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:44:08,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 13:44:09,405 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:44:09,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:44:09 BoogieIcfgContainer [2025-01-09 13:44:09,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:44:09,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:44:09,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:44:09,419 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:44:09,419 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:43:20" (3/4) ... [2025-01-09 13:44:09,421 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 13:44:09,433 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 13:44:09,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 13:44:09,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 13:44:09,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 13:44:09,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 13:44:09,499 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 13:44:09,499 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 13:44:09,499 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:44:09,500 INFO L158 Benchmark]: Toolchain (without parser) took 49455.40ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 914.4MB). Free memory was 110.4MB in the beginning and 666.3MB in the end (delta: -555.9MB). Peak memory consumption was 358.1MB. Max. memory is 16.1GB. [2025-01-09 13:44:09,500 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:44:09,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.11ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 96.9MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:44:09,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.65ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 94.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:44:09,501 INFO L158 Benchmark]: Boogie Preprocessor took 32.58ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 90.6MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:44:09,501 INFO L158 Benchmark]: RCFGBuilder took 410.80ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 71.9MB in the end (delta: 18.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 13:44:09,501 INFO L158 Benchmark]: TraceAbstraction took 48707.67ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 914.4MB). Free memory was 71.2MB in the beginning and 674.3MB in the end (delta: -603.1MB). Peak memory consumption was 307.7MB. Max. memory is 16.1GB. [2025-01-09 13:44:09,501 INFO L158 Benchmark]: Witness Printer took 80.68ms. Allocated memory is still 1.1GB. Free memory was 674.3MB in the beginning and 666.3MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:44:09,502 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 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.11ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 96.9MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.65ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 94.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.58ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 90.6MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 410.80ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 71.9MB in the end (delta: 18.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 48707.67ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 914.4MB). Free memory was 71.2MB in the beginning and 674.3MB in the end (delta: -603.1MB). Peak memory consumption was 307.7MB. Max. memory is 16.1GB. * Witness Printer took 80.68ms. Allocated memory is still 1.1GB. Free memory was 674.3MB in the beginning and 666.3MB in the end (delta: 8.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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.1s, OverallIterations: 9, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1403 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1403 mSDsluCounter, 2065 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1560 mSDsCounter, 447 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2847 IncrementalHoareTripleChecker+Invalid, 3294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 447 mSolverCounterUnsat, 505 mSDtfsCounter, 2847 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 443 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=5, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 388 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 34.7s InterpolantComputationTime, 1116 NumberOfCodeBlocks, 1116 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1105 ConstructedInterpolants, 0 QuantifiedInterpolants, 16778 SizeOfPredicates, 0 NumberOfNonLiveVariables, 645 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 4629/4652 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((var_1_12 == 0) && (128 == var_1_20)) && (64 == var_1_7)) && (last_1_var_1_7 <= 64)) && (0 <= k_loop)) && (128 == last_1_var_1_20)) && (128 <= last_1_var_1_17)) && ((var_1_14 == 0) || (var_1_13 == 0))) && (0 == 0)) && (128 <= var_1_17)) || (((1 <= k_loop) && ((999999950 + var_1_8) == (((long long) ((int) var_1_9 + last_1_var_1_20) + var_1_17) + var_1_10))) && (128 <= last_1_var_1_17))) RESULT: Ultimate proved your program to be correct! [2025-01-09 13:44:09,713 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-01-09 13:44:09,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE