./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-2.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-1loop_file-2.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 cb5120da282da0939ac8a01aef351f705e3e5f743c1237b3353ccb3b22ece68c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:15:32,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:15:32,992 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:15:32,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:15:32,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:15:33,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:15:33,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:15:33,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:15:33,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:15:33,023 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:15:33,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:15:33,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:15:33,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:15:33,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:15:33,024 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:15:33,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:15:33,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:15:33,025 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:15:33,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:15:33,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:15:33,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:15:33,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:15:33,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:15:33,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:15:33,025 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:15:33,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:15:33,025 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:15:33,025 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:15:33,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:15:33,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:15:33,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:15:33,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:15:33,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:15:33,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:15:33,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:15:33,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:15:33,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:15:33,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:15:33,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:15:33,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:15:33,027 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:15:33,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:15:33,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:15:33,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:15:33,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:15:33,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:15:33,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:15:33,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:15:33,027 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 -> cb5120da282da0939ac8a01aef351f705e3e5f743c1237b3353ccb3b22ece68c [2025-01-09 13:15:33,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:15:33,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:15:33,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:15:33,257 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:15:33,258 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:15:33,258 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-1loop_file-2.i [2025-01-09 13:15:34,407 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/510df9fe5/cdd000563fc24aa39bf6ab7eb0acfbd1/FLAGe9d7b7fd1 [2025-01-09 13:15:34,672 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:15:34,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-2.i [2025-01-09 13:15:34,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/510df9fe5/cdd000563fc24aa39bf6ab7eb0acfbd1/FLAGe9d7b7fd1 [2025-01-09 13:15:34,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/510df9fe5/cdd000563fc24aa39bf6ab7eb0acfbd1 [2025-01-09 13:15:34,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:15:34,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:15:34,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:15:34,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:15:34,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:15:34,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:15:34" (1/1) ... [2025-01-09 13:15:34,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18e5863a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:34, skipping insertion in model container [2025-01-09 13:15:34,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:15:34" (1/1) ... [2025-01-09 13:15:35,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:15:35,106 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-1loop_file-2.i[914,927] [2025-01-09 13:15:35,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:15:35,154 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:15:35,162 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-1loop_file-2.i[914,927] [2025-01-09 13:15:35,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:15:35,196 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:15:35,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:35 WrapperNode [2025-01-09 13:15:35,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:15:35,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:15:35,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:15:35,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:15:35,204 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:15:35" (1/1) ... [2025-01-09 13:15:35,209 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:15:35" (1/1) ... [2025-01-09 13:15:35,232 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2025-01-09 13:15:35,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:15:35,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:15:35,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:15:35,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:15:35,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:35" (1/1) ... [2025-01-09 13:15:35,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:35" (1/1) ... [2025-01-09 13:15:35,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:35" (1/1) ... [2025-01-09 13:15:35,258 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:15:35,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:35" (1/1) ... [2025-01-09 13:15:35,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:35" (1/1) ... [2025-01-09 13:15:35,266 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:35" (1/1) ... [2025-01-09 13:15:35,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:35" (1/1) ... [2025-01-09 13:15:35,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:35" (1/1) ... [2025-01-09 13:15:35,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:35" (1/1) ... [2025-01-09 13:15:35,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:35" (1/1) ... [2025-01-09 13:15:35,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:15:35,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:15:35,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:15:35,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:15:35,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:35" (1/1) ... [2025-01-09 13:15:35,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:15:35,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:15:35,309 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:15:35,313 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:15:35,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:15:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:15:35,335 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:15:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:15:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:15:35,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:15:35,394 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:15:35,396 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:15:35,594 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-09 13:15:35,594 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:15:35,605 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:15:35,605 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:15:35,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:15:35 BoogieIcfgContainer [2025-01-09 13:15:35,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:15:35,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:15:35,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:15:35,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:15:35,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:15:34" (1/3) ... [2025-01-09 13:15:35,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113bf236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:15:35, skipping insertion in model container [2025-01-09 13:15:35,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:35" (2/3) ... [2025-01-09 13:15:35,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113bf236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:15:35, skipping insertion in model container [2025-01-09 13:15:35,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:15:35" (3/3) ... [2025-01-09 13:15:35,613 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-2.i [2025-01-09 13:15:35,624 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:15:35,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-2.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:15:35,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:15:35,684 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;@439feb9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:15:35,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:15:35,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 13:15:35,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 13:15:35,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:35,694 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:35,694 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:35,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:35,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1859794447, now seen corresponding path program 1 times [2025-01-09 13:15:35,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:35,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782454295] [2025-01-09 13:15:35,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:35,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:35,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 13:15:35,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 13:15:35,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:35,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-09 13:15:35,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:35,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782454295] [2025-01-09 13:15:35,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782454295] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:15:35,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779050454] [2025-01-09 13:15:35,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:35,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:15:35,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:15:35,899 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:15:35,901 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:15:35,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 13:15:35,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 13:15:35,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:35,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:35,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:15:35,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:15:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-09 13:15:36,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:15:36,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779050454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:36,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:15:36,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:15:36,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552424679] [2025-01-09 13:15:36,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:36,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:15:36,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:36,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:15:36,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:15:36,033 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 13:15:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:36,046 INFO L93 Difference]: Finished difference Result 73 states and 111 transitions. [2025-01-09 13:15:36,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:15:36,050 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2025-01-09 13:15:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:36,054 INFO L225 Difference]: With dead ends: 73 [2025-01-09 13:15:36,054 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 13:15:36,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:15:36,059 INFO L435 NwaCegarLoop]: 51 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, 51 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:15:36,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:15:36,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 13:15:36,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-09 13:15:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 13:15:36,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2025-01-09 13:15:36,088 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 58 [2025-01-09 13:15:36,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:36,089 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2025-01-09 13:15:36,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 13:15:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2025-01-09 13:15:36,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 13:15:36,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:36,090 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:36,098 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:15:36,292 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:15:36,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:36,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:36,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1785092593, now seen corresponding path program 1 times [2025-01-09 13:15:36,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:36,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342405777] [2025-01-09 13:15:36,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:36,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:36,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 13:15:36,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 13:15:36,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:36,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 13:15:38,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:38,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342405777] [2025-01-09 13:15:38,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342405777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:38,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:38,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 13:15:38,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120093589] [2025-01-09 13:15:38,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:38,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 13:15:38,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:38,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 13:15:38,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:15:38,817 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 13:15:39,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:39,805 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2025-01-09 13:15:39,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 13:15:39,806 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 58 [2025-01-09 13:15:39,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:39,807 INFO L225 Difference]: With dead ends: 70 [2025-01-09 13:15:39,807 INFO L226 Difference]: Without dead ends: 68 [2025-01-09 13:15:39,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:15:39,808 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 71 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:39,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 208 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:15:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-09 13:15:39,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 42. [2025-01-09 13:15:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 13:15:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2025-01-09 13:15:39,817 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 58 [2025-01-09 13:15:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:39,818 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2025-01-09 13:15:39,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 13:15:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2025-01-09 13:15:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 13:15:39,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:39,821 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:39,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:15:39,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:39,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:39,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1105034223, now seen corresponding path program 1 times [2025-01-09 13:15:39,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:39,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223622104] [2025-01-09 13:15:39,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:39,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:39,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 13:15:39,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 13:15:39,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:39,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 13:15:40,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:40,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223622104] [2025-01-09 13:15:40,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223622104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:40,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:40,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:15:40,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144421620] [2025-01-09 13:15:40,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:40,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:15:40,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:40,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:15:40,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:15:40,106 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 13:15:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:40,266 INFO L93 Difference]: Finished difference Result 124 states and 170 transitions. [2025-01-09 13:15:40,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:15:40,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2025-01-09 13:15:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:40,268 INFO L225 Difference]: With dead ends: 124 [2025-01-09 13:15:40,268 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 13:15:40,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:15:40,269 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 78 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:40,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 275 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:15:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 13:15:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2025-01-09 13:15:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 53 states have internal predecessors, (68), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:15:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2025-01-09 13:15:40,281 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 58 [2025-01-09 13:15:40,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:40,281 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2025-01-09 13:15:40,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 13:15:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2025-01-09 13:15:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 13:15:40,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:40,282 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:40,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:15:40,282 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:40,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:40,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1356556581, now seen corresponding path program 1 times [2025-01-09 13:15:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:40,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576374204] [2025-01-09 13:15:40,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:40,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:40,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 13:15:40,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 13:15:40,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:40,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 13:15:52,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:52,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576374204] [2025-01-09 13:15:52,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576374204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:52,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:52,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 13:15:52,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298196242] [2025-01-09 13:15:52,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:52,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 13:15:52,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:52,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 13:15:52,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:15:52,529 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 13:15:56,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 13:15:57,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 13:15:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:58,085 INFO L93 Difference]: Finished difference Result 134 states and 183 transitions. [2025-01-09 13:15:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 13:15:58,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 59 [2025-01-09 13:15:58,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:58,087 INFO L225 Difference]: With dead ends: 134 [2025-01-09 13:15:58,087 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 13:15:58,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:15:58,088 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 57 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:58,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 166 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2025-01-09 13:15:58,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 13:15:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2025-01-09 13:15:58,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 56 states have internal predecessors, (72), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:15:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2025-01-09 13:15:58,096 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 104 transitions. Word has length 59 [2025-01-09 13:15:58,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:58,096 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 104 transitions. [2025-01-09 13:15:58,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 13:15:58,096 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2025-01-09 13:15:58,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 13:15:58,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:58,097 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:58,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:15:58,098 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:58,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:58,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1163403353, now seen corresponding path program 1 times [2025-01-09 13:15:58,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:58,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449709151] [2025-01-09 13:15:58,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:58,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:58,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 13:15:58,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 13:15:58,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:58,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 13:15:58,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:58,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449709151] [2025-01-09 13:15:58,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449709151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:58,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:58,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:15:58,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701030400] [2025-01-09 13:15:58,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:58,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:15:58,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:58,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:15:58,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:15:58,130 INFO L87 Difference]: Start difference. First operand 75 states and 104 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 13:15:58,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:58,147 INFO L93 Difference]: Finished difference Result 185 states and 254 transitions. [2025-01-09 13:15:58,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:15:58,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 59 [2025-01-09 13:15:58,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:58,148 INFO L225 Difference]: With dead ends: 185 [2025-01-09 13:15:58,148 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 13:15:58,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:15:58,149 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 29 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:58,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 108 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:15:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 13:15:58,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2025-01-09 13:15:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 78 states have internal predecessors, (92), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:15:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 148 transitions. [2025-01-09 13:15:58,172 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 148 transitions. Word has length 59 [2025-01-09 13:15:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:58,172 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 148 transitions. [2025-01-09 13:15:58,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 13:15:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 148 transitions. [2025-01-09 13:15:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 13:15:58,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:58,173 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:58,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:15:58,173 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:58,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:58,173 INFO L85 PathProgramCache]: Analyzing trace with hash 113380791, now seen corresponding path program 1 times [2025-01-09 13:15:58,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:58,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743654132] [2025-01-09 13:15:58,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:58,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:58,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 13:15:58,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 13:15:58,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:58,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:58,312 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 13:15:58,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:58,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743654132] [2025-01-09 13:15:58,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743654132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:58,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:58,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:15:58,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140706565] [2025-01-09 13:15:58,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:58,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:15:58,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:58,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:15:58,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:15:58,315 INFO L87 Difference]: Start difference. First operand 109 states and 148 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 13:15:58,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:58,469 INFO L93 Difference]: Finished difference Result 277 states and 371 transitions. [2025-01-09 13:15:58,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:15:58,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 59 [2025-01-09 13:15:58,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:58,472 INFO L225 Difference]: With dead ends: 277 [2025-01-09 13:15:58,472 INFO L226 Difference]: Without dead ends: 181 [2025-01-09 13:15:58,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:15:58,475 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 61 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:58,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 190 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:15:58,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-09 13:15:58,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 165. [2025-01-09 13:15:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 120 states have (on average 1.2166666666666666) internal successors, (146), 121 states have internal predecessors, (146), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 13:15:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2025-01-09 13:15:58,500 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 59 [2025-01-09 13:15:58,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:58,500 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2025-01-09 13:15:58,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 13:15:58,500 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2025-01-09 13:15:58,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 13:15:58,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:58,501 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:58,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:15:58,503 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:58,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:58,504 INFO L85 PathProgramCache]: Analyzing trace with hash 963529571, now seen corresponding path program 1 times [2025-01-09 13:15:58,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:58,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166392612] [2025-01-09 13:15:58,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:58,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:58,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 13:15:58,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 13:15:58,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:58,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 13:15:58,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:58,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166392612] [2025-01-09 13:15:58,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166392612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:58,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:58,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:15:58,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800553123] [2025-01-09 13:15:58,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:58,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:15:58,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:58,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:15:58,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:15:58,930 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 13:15:59,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:59,051 INFO L93 Difference]: Finished difference Result 265 states and 350 transitions. [2025-01-09 13:15:59,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:15:59,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 59 [2025-01-09 13:15:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:59,053 INFO L225 Difference]: With dead ends: 265 [2025-01-09 13:15:59,053 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 13:15:59,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:15:59,054 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 46 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:59,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 215 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:15:59,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 13:15:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 163. [2025-01-09 13:15:59,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 119 states have internal predecessors, (142), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 13:15:59,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 218 transitions. [2025-01-09 13:15:59,083 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 218 transitions. Word has length 59 [2025-01-09 13:15:59,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:59,083 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 218 transitions. [2025-01-09 13:15:59,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 13:15:59,083 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 218 transitions. [2025-01-09 13:15:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 13:15:59,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:59,084 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:59,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 13:15:59,084 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:59,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:59,084 INFO L85 PathProgramCache]: Analyzing trace with hash -729431579, now seen corresponding path program 1 times [2025-01-09 13:15:59,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:59,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986000331] [2025-01-09 13:15:59,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:59,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:59,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 13:15:59,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 13:15:59,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:59,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 13:15:59,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986000331] [2025-01-09 13:15:59,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986000331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:59,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:59,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:15:59,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317392096] [2025-01-09 13:15:59,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:59,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:15:59,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:59,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:15:59,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:15:59,168 INFO L87 Difference]: Start difference. First operand 163 states and 218 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 13:15:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:59,230 INFO L93 Difference]: Finished difference Result 274 states and 363 transitions. [2025-01-09 13:15:59,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:15:59,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 60 [2025-01-09 13:15:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:59,232 INFO L225 Difference]: With dead ends: 274 [2025-01-09 13:15:59,232 INFO L226 Difference]: Without dead ends: 179 [2025-01-09 13:15:59,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:15:59,232 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 48 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:59,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 148 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:15:59,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-09 13:15:59,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 165. [2025-01-09 13:15:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 120 states have (on average 1.2) internal successors, (144), 121 states have internal predecessors, (144), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 13:15:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2025-01-09 13:15:59,252 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 60 [2025-01-09 13:15:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:59,252 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2025-01-09 13:15:59,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 13:15:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2025-01-09 13:15:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 13:15:59,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:59,253 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:59,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 13:15:59,253 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:59,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:59,253 INFO L85 PathProgramCache]: Analyzing trace with hash -727584537, now seen corresponding path program 1 times [2025-01-09 13:15:59,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:59,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035565425] [2025-01-09 13:15:59,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:59,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:59,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 13:15:59,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 13:15:59,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:59,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:16:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 13:16:13,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:16:13,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035565425] [2025-01-09 13:16:13,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035565425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:16:13,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:16:13,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 13:16:13,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165680854] [2025-01-09 13:16:13,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:16:13,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 13:16:13,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:16:13,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 13:16:13,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:16:13,700 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 13:16:15,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:16:15,928 INFO L93 Difference]: Finished difference Result 256 states and 326 transitions. [2025-01-09 13:16:15,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 13:16:15,928 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2025-01-09 13:16:15,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:16:15,930 INFO L225 Difference]: With dead ends: 256 [2025-01-09 13:16:15,930 INFO L226 Difference]: Without dead ends: 254 [2025-01-09 13:16:15,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2025-01-09 13:16:15,931 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 269 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:16:15,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 254 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:16:15,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-01-09 13:16:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2025-01-09 13:16:15,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 150 states have (on average 1.2) internal successors, (180), 151 states have internal predecessors, (180), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 13:16:15,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 272 transitions. [2025-01-09 13:16:15,946 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 272 transitions. Word has length 60 [2025-01-09 13:16:15,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:16:15,946 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 272 transitions. [2025-01-09 13:16:15,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 13:16:15,946 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 272 transitions. [2025-01-09 13:16:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 13:16:15,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:16:15,947 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:15,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 13:16:15,947 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:16:15,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:16:15,948 INFO L85 PathProgramCache]: Analyzing trace with hash -284679041, now seen corresponding path program 1 times [2025-01-09 13:16:15,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:16:15,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186420911] [2025-01-09 13:16:15,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:16:15,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:16:15,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 13:16:15,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 13:16:15,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:15,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:16:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 13:16:16,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:16:16,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186420911] [2025-01-09 13:16:16,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186420911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:16:16,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:16:16,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:16:16,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130484678] [2025-01-09 13:16:16,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:16:16,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:16:16,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:16:16,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:16:16,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:16:16,730 INFO L87 Difference]: Start difference. First operand 204 states and 272 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 13:16:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:16:17,093 INFO L93 Difference]: Finished difference Result 241 states and 310 transitions. [2025-01-09 13:16:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:16:17,097 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2025-01-09 13:16:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:16:17,098 INFO L225 Difference]: With dead ends: 241 [2025-01-09 13:16:17,098 INFO L226 Difference]: Without dead ends: 239 [2025-01-09 13:16:17,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-01-09 13:16:17,099 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 86 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:16:17,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 240 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:16:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-09 13:16:17,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 173. [2025-01-09 13:16:17,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.1953125) internal successors, (153), 129 states have internal predecessors, (153), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 13:16:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 229 transitions. [2025-01-09 13:16:17,119 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 229 transitions. Word has length 61 [2025-01-09 13:16:17,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:16:17,119 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 229 transitions. [2025-01-09 13:16:17,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 13:16:17,120 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 229 transitions. [2025-01-09 13:16:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 13:16:17,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:16:17,120 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:17,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 13:16:17,120 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:16:17,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:16:17,121 INFO L85 PathProgramCache]: Analyzing trace with hash -26513603, now seen corresponding path program 1 times [2025-01-09 13:16:17,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:16:17,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944665041] [2025-01-09 13:16:17,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:16:17,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:16:17,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 13:16:17,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 13:16:17,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:17,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:16:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 13:16:18,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:16:18,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944665041] [2025-01-09 13:16:18,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944665041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:16:18,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:16:18,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:16:18,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086975172] [2025-01-09 13:16:18,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:16:18,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:16:18,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:16:18,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:16:18,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:16:18,204 INFO L87 Difference]: Start difference. First operand 173 states and 229 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 13:16:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:16:18,532 INFO L93 Difference]: Finished difference Result 187 states and 243 transitions. [2025-01-09 13:16:18,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 13:16:18,532 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2025-01-09 13:16:18,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:16:18,533 INFO L225 Difference]: With dead ends: 187 [2025-01-09 13:16:18,533 INFO L226 Difference]: Without dead ends: 185 [2025-01-09 13:16:18,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-01-09 13:16:18,534 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 66 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:16:18,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 221 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:16:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-09 13:16:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171. [2025-01-09 13:16:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 127 states have internal predecessors, (150), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 13:16:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 226 transitions. [2025-01-09 13:16:18,544 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 226 transitions. Word has length 61 [2025-01-09 13:16:18,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:16:18,544 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 226 transitions. [2025-01-09 13:16:18,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 13:16:18,545 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 226 transitions. [2025-01-09 13:16:18,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 13:16:18,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:16:18,545 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 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] [2025-01-09 13:16:18,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 13:16:18,546 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:16:18,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:16:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1094193886, now seen corresponding path program 1 times [2025-01-09 13:16:18,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:16:18,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810444478] [2025-01-09 13:16:18,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:16:18,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:16:18,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 13:16:18,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 13:16:18,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:18,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:16:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 13:16:18,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:16:18,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810444478] [2025-01-09 13:16:18,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810444478] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:16:18,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539723434] [2025-01-09 13:16:18,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:16:18,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:16:18,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:16:18,593 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:16:18,596 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:16:18,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 13:16:18,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 13:16:18,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:18,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:16:18,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 13:16:18,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:16:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-01-09 13:16:18,721 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:16:18,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539723434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:16:18,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:16:18,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 13:16:18,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419398744] [2025-01-09 13:16:18,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:16:18,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:16:18,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:16:18,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:16:18,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:16:18,723 INFO L87 Difference]: Start difference. First operand 171 states and 226 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 13:16:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:16:18,746 INFO L93 Difference]: Finished difference Result 194 states and 252 transitions. [2025-01-09 13:16:18,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:16:18,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2025-01-09 13:16:18,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:16:18,747 INFO L225 Difference]: With dead ends: 194 [2025-01-09 13:16:18,747 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 13:16:18,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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:16:18,748 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:16:18,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 86 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:16:18,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 13:16:18,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 13:16:18,749 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:16:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 13:16:18,750 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2025-01-09 13:16:18,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:16:18,750 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 13:16:18,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 13:16:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 13:16:18,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 13:16:18,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:16:18,764 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:16:18,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:16:18,958 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:16:18,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 13:16:20,326 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:16:20,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:16:20 BoogieIcfgContainer [2025-01-09 13:16:20,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:16:20,346 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:16:20,346 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:16:20,346 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:16:20,347 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:15:35" (3/4) ... [2025-01-09 13:16:20,348 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 13:16:20,353 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 13:16:20,357 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 13:16:20,357 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 13:16:20,357 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 13:16:20,357 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 13:16:20,420 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 13:16:20,421 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 13:16:20,422 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:16:20,422 INFO L158 Benchmark]: Toolchain (without parser) took 45430.07ms. Allocated memory was 167.8MB in the beginning and 855.6MB in the end (delta: 687.9MB). Free memory was 132.1MB in the beginning and 420.7MB in the end (delta: -288.6MB). Peak memory consumption was 400.0MB. Max. memory is 16.1GB. [2025-01-09 13:16:20,423 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:16:20,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.42ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 119.4MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:16:20,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.76ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 116.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:16:20,424 INFO L158 Benchmark]: Boogie Preprocessor took 47.01ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 113.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:16:20,424 INFO L158 Benchmark]: RCFGBuilder took 325.69ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 97.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:16:20,424 INFO L158 Benchmark]: TraceAbstraction took 44738.54ms. Allocated memory was 167.8MB in the beginning and 855.6MB in the end (delta: 687.9MB). Free memory was 96.9MB in the beginning and 428.9MB in the end (delta: -331.9MB). Peak memory consumption was 477.1MB. Max. memory is 16.1GB. [2025-01-09 13:16:20,424 INFO L158 Benchmark]: Witness Printer took 75.38ms. Allocated memory is still 855.6MB. Free memory was 428.9MB in the beginning and 420.7MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:16:20,425 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 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.42ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 119.4MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.76ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 116.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.01ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 113.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 325.69ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 97.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 44738.54ms. Allocated memory was 167.8MB in the beginning and 855.6MB in the end (delta: 687.9MB). Free memory was 96.9MB in the beginning and 428.9MB in the end (delta: -331.9MB). Peak memory consumption was 477.1MB. Max. memory is 16.1GB. * Witness Printer took 75.38ms. Allocated memory is still 855.6MB. Free memory was 428.9MB in the beginning and 420.7MB 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.3s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 818 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 818 mSDsluCounter, 2162 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1562 mSDsCounter, 233 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1155 IncrementalHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 233 mSolverCounterUnsat, 600 mSDtfsCounter, 1155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=9, InterpolantAutomatonStates: 81, 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, 12 MinimizatonAttempts, 262 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 31.9s InterpolantComputationTime, 936 NumberOfCodeBlocks, 936 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 922 ConstructedInterpolants, 0 QuantifiedInterpolants, 6991 SizeOfPredicates, 0 NumberOfNonLiveVariables, 425 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2333/2348 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: 87]: Loop Invariant Derived loop invariant: (((((((((last_1_var_1_10 == 1) && (var_1_10 == 1)) && (var_1_1 == 10)) && (0 <= k_loop)) && (var_1_8 == 128)) && (0 == 0)) && (128 == last_1_var_1_8)) || ((((var_1_12 == var_1_5) && (1 <= k_loop)) && (var_1_9 == 0)) && (var_1_7 == var_1_11))) || ((((((((var_1_12 == var_1_5) && (last_1_var_1_10 == 1)) && (0 <= var_1_11)) && (1 <= k_loop)) && (var_1_10 == 1)) && (var_1_11 == var_1_7)) && (var_1_11 <= 65535)) && ((((((var_1_5 < (var_1_7 + 1)) || (var_1_1 == var_1_5)) && ((var_1_7 < var_1_5) || (var_1_7 == var_1_1))) || (var_1_7 < var_1_6)) && ((((var_1_6 < var_1_5) || (var_1_6 == var_1_1)) && ((var_1_5 < (var_1_6 + 1)) || (var_1_1 == var_1_5))) || (var_1_6 < (var_1_7 + 1)))) || (((long long) var_1_12 * var_1_11) < var_1_11)))) RESULT: Ultimate proved your program to be correct! [2025-01-09 13:16:20,508 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE