./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.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_25-while_file-39.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 f5eff424b13e274e9264f217cb93b9f92431d9f38ae53b99fcf8d948b0cbf8ce --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:29:31,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:29:31,857 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:29:31,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:29:31,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:29:31,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:29:31,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:29:31,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:29:31,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:29:31,888 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:29:31,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:29:31,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:29:31,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:29:31,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:29:31,889 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:29:31,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:29:31,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:29:31,890 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:29:31,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:29:31,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:29:31,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:29:31,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:29:31,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:29:31,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:29:31,891 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:29:31,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:29:31,891 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:29:31,891 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:29:31,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:29:31,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:29:31,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:29:31,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:29:31,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:29:31,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:29:31,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:29:31,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:29:31,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:29:31,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:29:31,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:29:31,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:29:31,893 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:29:31,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:29:31,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:29:31,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:29:31,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:29:31,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:29:31,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:29:31,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:29:31,893 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 -> f5eff424b13e274e9264f217cb93b9f92431d9f38ae53b99fcf8d948b0cbf8ce [2025-01-09 13:29:32,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:29:32,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:29:32,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:29:32,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:29:32,128 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:29:32,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i [2025-01-09 13:29:33,294 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06cda7a95/9195162d5b2d424287cb4582fd32e98d/FLAGb75572903 [2025-01-09 13:29:33,536 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:29:33,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i [2025-01-09 13:29:33,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06cda7a95/9195162d5b2d424287cb4582fd32e98d/FLAGb75572903 [2025-01-09 13:29:33,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06cda7a95/9195162d5b2d424287cb4582fd32e98d [2025-01-09 13:29:33,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:29:33,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:29:33,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:29:33,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:29:33,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:29:33,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:29:33" (1/1) ... [2025-01-09 13:29:33,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@913ff31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:29:33, skipping insertion in model container [2025-01-09 13:29:33,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:29:33" (1/1) ... [2025-01-09 13:29:33,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:29:33,679 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_25-while_file-39.i[915,928] [2025-01-09 13:29:33,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:29:33,726 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:29:33,734 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_25-while_file-39.i[915,928] [2025-01-09 13:29:33,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:29:33,771 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:29:33,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:29:33 WrapperNode [2025-01-09 13:29:33,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:29:33,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:29:33,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:29:33,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:29:33,779 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:29:33" (1/1) ... [2025-01-09 13:29:33,786 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:29:33" (1/1) ... [2025-01-09 13:29:33,812 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2025-01-09 13:29:33,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:29:33,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:29:33,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:29:33,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:29:33,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:29:33" (1/1) ... [2025-01-09 13:29:33,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:29:33" (1/1) ... [2025-01-09 13:29:33,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:29:33" (1/1) ... [2025-01-09 13:29:33,843 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:29:33,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:29:33" (1/1) ... [2025-01-09 13:29:33,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:29:33" (1/1) ... [2025-01-09 13:29:33,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:29:33" (1/1) ... [2025-01-09 13:29:33,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:29:33" (1/1) ... [2025-01-09 13:29:33,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:29:33" (1/1) ... [2025-01-09 13:29:33,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:29:33" (1/1) ... [2025-01-09 13:29:33,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:29:33" (1/1) ... [2025-01-09 13:29:33,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:29:33,861 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:29:33,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:29:33,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:29:33,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:29:33" (1/1) ... [2025-01-09 13:29:33,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:29:33,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:29:33,890 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:29:33,896 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:29:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:29:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:29:33,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:29:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:29:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:29:33,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:29:33,957 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:29:33,959 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:29:34,167 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 13:29:34,168 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:29:34,176 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:29:34,177 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:29:34,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:29:34 BoogieIcfgContainer [2025-01-09 13:29:34,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:29:34,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:29:34,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:29:34,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:29:34,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:29:33" (1/3) ... [2025-01-09 13:29:34,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb1912f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:29:34, skipping insertion in model container [2025-01-09 13:29:34,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:29:33" (2/3) ... [2025-01-09 13:29:34,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb1912f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:29:34, skipping insertion in model container [2025-01-09 13:29:34,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:29:34" (3/3) ... [2025-01-09 13:29:34,187 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-39.i [2025-01-09 13:29:34,196 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:29:34,198 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-39.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:29:34,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:29:34,244 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;@3d2e5cea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:29:34,244 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:29:34,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 13:29:34,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 13:29:34,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:29:34,252 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:34,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:29:34,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:29:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash -340287804, now seen corresponding path program 1 times [2025-01-09 13:29:34,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:29:34,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237998813] [2025-01-09 13:29:34,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:29:34,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:29:34,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 13:29:34,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 13:29:34,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:29:34,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:29:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-01-09 13:29:34,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:29:34,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237998813] [2025-01-09 13:29:34,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237998813] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:29:34,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217523571] [2025-01-09 13:29:34,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:29:34,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:29:34,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:29:34,428 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:29:34,430 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:29:34,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 13:29:34,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 13:29:34,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:29:34,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:29:34,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:29:34,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:29:34,568 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-01-09 13:29:34,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:29:34,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217523571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:29:34,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:29:34,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:29:34,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972576939] [2025-01-09 13:29:34,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:29:34,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:29:34,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:29:34,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:29:34,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:29:34,590 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 13:29:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:29:34,608 INFO L93 Difference]: Finished difference Result 86 states and 138 transitions. [2025-01-09 13:29:34,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:29:34,609 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2025-01-09 13:29:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:29:34,613 INFO L225 Difference]: With dead ends: 86 [2025-01-09 13:29:34,613 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 13:29:34,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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:29:34,619 INFO L435 NwaCegarLoop]: 60 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, 60 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:29:34,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:29:34,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 13:29:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-09 13:29:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 13:29:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2025-01-09 13:29:34,644 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 87 [2025-01-09 13:29:34,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:29:34,644 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2025-01-09 13:29:34,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 13:29:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2025-01-09 13:29:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 13:29:34,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:29:34,646 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:34,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 13:29:34,847 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:29:34,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:29:34,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:29:34,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1252288906, now seen corresponding path program 1 times [2025-01-09 13:29:34,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:29:34,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914146485] [2025-01-09 13:29:34,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:29:34,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:29:34,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 13:29:34,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 13:29:34,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:29:34,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:29:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:29:36,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:29:36,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914146485] [2025-01-09 13:29:36,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914146485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:29:36,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:29:36,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:29:36,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932140194] [2025-01-09 13:29:36,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:29:36,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:29:36,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:29:36,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:29:36,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:29:36,351 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 13:29:36,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:29:36,741 INFO L93 Difference]: Finished difference Result 153 states and 218 transitions. [2025-01-09 13:29:36,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:29:36,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2025-01-09 13:29:36,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:29:36,743 INFO L225 Difference]: With dead ends: 153 [2025-01-09 13:29:36,744 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 13:29:36,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:29:36,746 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 88 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:29:36,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 252 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:29:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 13:29:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 81. [2025-01-09 13:29:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 13:29:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-01-09 13:29:36,771 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 87 [2025-01-09 13:29:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:29:36,772 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-01-09 13:29:36,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 13:29:36,772 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-01-09 13:29:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 13:29:36,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:29:36,773 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:36,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:29:36,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:29:36,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:29:36,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1944909256, now seen corresponding path program 1 times [2025-01-09 13:29:36,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:29:36,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481128191] [2025-01-09 13:29:36,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:29:36,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:29:36,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 13:29:36,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 13:29:36,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:29:36,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:29:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:29:36,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:29:36,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481128191] [2025-01-09 13:29:36,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481128191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:29:36,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:29:36,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:29:36,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418337586] [2025-01-09 13:29:36,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:29:36,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:29:36,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:29:36,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:29:36,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:29:36,944 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:29:37,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:29:37,097 INFO L93 Difference]: Finished difference Result 205 states and 288 transitions. [2025-01-09 13:29:37,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:29:37,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2025-01-09 13:29:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:29:37,100 INFO L225 Difference]: With dead ends: 205 [2025-01-09 13:29:37,101 INFO L226 Difference]: Without dead ends: 127 [2025-01-09 13:29:37,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:29:37,102 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 45 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:29:37,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 169 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:29:37,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-09 13:29:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2025-01-09 13:29:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 75 states have internal predecessors, (89), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 13:29:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 167 transitions. [2025-01-09 13:29:37,124 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 167 transitions. Word has length 88 [2025-01-09 13:29:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:29:37,124 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 167 transitions. [2025-01-09 13:29:37,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:29:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 167 transitions. [2025-01-09 13:29:37,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 13:29:37,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:29:37,125 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:37,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:29:37,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:29:37,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:29:37,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1396434463, now seen corresponding path program 1 times [2025-01-09 13:29:37,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:29:37,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201612818] [2025-01-09 13:29:37,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:29:37,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:29:37,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 13:29:37,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 13:29:37,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:29:37,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:30:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:30:07,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:30:07,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201612818] [2025-01-09 13:30:07,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201612818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:30:07,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:30:07,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 13:30:07,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919933131] [2025-01-09 13:30:07,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:30:07,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 13:30:07,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:30:07,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 13:30:07,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:30:07,457 INFO L87 Difference]: Start difference. First operand 118 states and 167 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:30:07,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:30:07,713 INFO L93 Difference]: Finished difference Result 153 states and 209 transitions. [2025-01-09 13:30:07,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 13:30:07,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2025-01-09 13:30:07,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:30:07,716 INFO L225 Difference]: With dead ends: 153 [2025-01-09 13:30:07,716 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 13:30:07,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:30:07,716 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:30:07,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 294 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:30:07,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 13:30:07,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 134. [2025-01-09 13:30:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.2087912087912087) internal successors, (110), 91 states have internal predecessors, (110), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 13:30:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 188 transitions. [2025-01-09 13:30:07,742 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 188 transitions. Word has length 88 [2025-01-09 13:30:07,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:30:07,742 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 188 transitions. [2025-01-09 13:30:07,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:30:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 188 transitions. [2025-01-09 13:30:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 13:30:07,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:30:07,746 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:07,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:30:07,746 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:30:07,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:30:07,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1398281505, now seen corresponding path program 1 times [2025-01-09 13:30:07,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:30:07,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950427132] [2025-01-09 13:30:07,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:30:07,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:30:07,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 13:30:07,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 13:30:07,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:30:07,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:30:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:30:08,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:30:08,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950427132] [2025-01-09 13:30:08,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950427132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:30:08,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:30:08,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 13:30:08,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532921610] [2025-01-09 13:30:08,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:30:08,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 13:30:08,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:30:08,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 13:30:08,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:30:08,381 INFO L87 Difference]: Start difference. First operand 134 states and 188 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:30:08,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:30:08,542 INFO L93 Difference]: Finished difference Result 152 states and 210 transitions. [2025-01-09 13:30:08,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 13:30:08,542 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2025-01-09 13:30:08,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:30:08,544 INFO L225 Difference]: With dead ends: 152 [2025-01-09 13:30:08,545 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 13:30:08,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:30:08,546 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 20 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:30:08,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 188 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:30:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 13:30:08,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 134. [2025-01-09 13:30:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 91 states have internal predecessors, (109), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 13:30:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2025-01-09 13:30:08,572 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 88 [2025-01-09 13:30:08,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:30:08,572 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2025-01-09 13:30:08,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:30:08,572 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2025-01-09 13:30:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 13:30:08,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:30:08,574 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 1, 1, 1] [2025-01-09 13:30:08,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:30:08,574 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:30:08,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:30:08,574 INFO L85 PathProgramCache]: Analyzing trace with hash -795030338, now seen corresponding path program 1 times [2025-01-09 13:30:08,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:30:08,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138776449] [2025-01-09 13:30:08,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:30:08,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:30:08,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 13:30:08,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 13:30:08,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:30:08,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:30:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2025-01-09 13:30:09,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:30:09,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138776449] [2025-01-09 13:30:09,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138776449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:30:09,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:30:09,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 13:30:09,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248803954] [2025-01-09 13:30:09,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:30:09,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:30:09,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:30:09,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:30:09,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:30:09,244 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:30:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:30:09,402 INFO L93 Difference]: Finished difference Result 156 states and 213 transitions. [2025-01-09 13:30:09,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 13:30:09,403 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 174 [2025-01-09 13:30:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:30:09,404 INFO L225 Difference]: With dead ends: 156 [2025-01-09 13:30:09,404 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 13:30:09,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:30:09,405 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 37 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:30:09,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 385 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:30:09,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 13:30:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 134. [2025-01-09 13:30:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 91 states have internal predecessors, (109), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 13:30:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2025-01-09 13:30:09,431 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 174 [2025-01-09 13:30:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:30:09,431 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2025-01-09 13:30:09,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:30:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2025-01-09 13:30:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 13:30:09,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:30:09,432 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 1, 1, 1, 1, 1] [2025-01-09 13:30:09,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:30:09,433 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:30:09,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:30:09,433 INFO L85 PathProgramCache]: Analyzing trace with hash -793183296, now seen corresponding path program 1 times [2025-01-09 13:30:09,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:30:09,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939501467] [2025-01-09 13:30:09,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:30:09,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:30:09,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 13:30:09,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 13:30:09,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:30:09,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:30:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2025-01-09 13:30:10,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:30:10,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939501467] [2025-01-09 13:30:10,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939501467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:30:10,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:30:10,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 13:30:10,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18975316] [2025-01-09 13:30:10,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:30:10,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:30:10,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:30:10,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:30:10,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:30:10,048 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:30:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:30:10,205 INFO L93 Difference]: Finished difference Result 150 states and 206 transitions. [2025-01-09 13:30:10,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 13:30:10,205 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 174 [2025-01-09 13:30:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:30:10,206 INFO L225 Difference]: With dead ends: 150 [2025-01-09 13:30:10,206 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 13:30:10,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:30:10,207 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 20 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:30:10,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 321 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:30:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 13:30:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 13:30:10,208 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:30:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 13:30:10,208 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2025-01-09 13:30:10,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:30:10,208 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 13:30:10,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:30:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 13:30:10,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 13:30:10,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:30:10,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 13:30:10,212 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:30:10,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 13:30:10,340 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:30:10,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:30:10 BoogieIcfgContainer [2025-01-09 13:30:10,347 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:30:10,348 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:30:10,348 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:30:10,348 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:30:10,348 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:29:34" (3/4) ... [2025-01-09 13:30:10,349 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 13:30:10,353 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 13:30:10,356 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 13:30:10,356 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 13:30:10,356 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 13:30:10,356 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 13:30:10,419 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 13:30:10,420 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 13:30:10,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:30:10,421 INFO L158 Benchmark]: Toolchain (without parser) took 36864.03ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 122.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2025-01-09 13:30:10,421 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:30:10,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.53ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 109.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:30:10,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.34ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 106.6MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:30:10,424 INFO L158 Benchmark]: Boogie Preprocessor took 44.86ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 103.4MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:30:10,424 INFO L158 Benchmark]: RCFGBuilder took 316.53ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 88.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:30:10,424 INFO L158 Benchmark]: TraceAbstraction took 36168.18ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 87.2MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 845.4MB. Max. memory is 16.1GB. [2025-01-09 13:30:10,425 INFO L158 Benchmark]: Witness Printer took 72.41ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:30:10,426 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.53ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 109.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.34ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 106.6MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.86ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 103.4MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 316.53ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 88.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 36168.18ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 87.2MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 845.4MB. Max. memory is 16.1GB. * Witness Printer took 72.41ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB 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, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.0s, OverallIterations: 7, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 228 mSDsluCounter, 1669 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1225 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 597 IncrementalHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 444 mSDtfsCounter, 597 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=4, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 94 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 33.8s InterpolantComputationTime, 873 NumberOfCodeBlocks, 873 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 865 ConstructedInterpolants, 0 QuantifiedInterpolants, 3659 SizeOfPredicates, 0 NumberOfNonLiveVariables, 213 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 4512/4536 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 RESULT: Ultimate proved your program to be correct! [2025-01-09 13:30:10,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE