./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 78a4cc43ce1234c075e2c73cca2f6f44edddfccbee7278c746f2db07d17136bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:51:48,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:51:48,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:51:48,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:51:48,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:51:48,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:51:48,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:51:48,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:51:48,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:51:48,155 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:51:48,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:51:48,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:51:48,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:51:48,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:51:48,156 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:51:48,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:51:48,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:51:48,156 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:51:48,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:51:48,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:51:48,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:51:48,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:51:48,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:51:48,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:51:48,157 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:51:48,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:51:48,157 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:51:48,157 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:51:48,157 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:51:48,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:51:48,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:51:48,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:51:48,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:51:48,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:51:48,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:51:48,158 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:51:48,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:51:48,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:51:48,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:51:48,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:51:48,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:51:48,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:51:48,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:51:48,159 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/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 -> 78a4cc43ce1234c075e2c73cca2f6f44edddfccbee7278c746f2db07d17136bf [2025-03-16 17:51:48,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:51:48,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:51:48,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:51:48,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:51:48,387 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:51:48,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2025-03-16 17:51:49,550 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a07ec10/e93ce772eeb7405d83b14700d992790d/FLAG9a31b9c64 [2025-03-16 17:51:49,772 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:51:49,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2025-03-16 17:51:49,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a07ec10/e93ce772eeb7405d83b14700d992790d/FLAG9a31b9c64 [2025-03-16 17:51:50,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a07ec10/e93ce772eeb7405d83b14700d992790d [2025-03-16 17:51:50,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:51:50,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:51:50,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:51:50,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:51:50,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:51:50,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:51:50" (1/1) ... [2025-03-16 17:51:50,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a9d9f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:50, skipping insertion in model container [2025-03-16 17:51:50,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:51:50" (1/1) ... [2025-03-16 17:51:50,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:51:50,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c[6448,6461] [2025-03-16 17:51:50,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:51:50,340 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:51:50,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c[6448,6461] [2025-03-16 17:51:50,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:51:50,424 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:51:50,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:50 WrapperNode [2025-03-16 17:51:50,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:51:50,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:51:50,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:51:50,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:51:50,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:50" (1/1) ... [2025-03-16 17:51:50,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:50" (1/1) ... [2025-03-16 17:51:50,460 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 637 [2025-03-16 17:51:50,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:51:50,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:51:50,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:51:50,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:51:50,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:50" (1/1) ... [2025-03-16 17:51:50,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:50" (1/1) ... [2025-03-16 17:51:50,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:50" (1/1) ... [2025-03-16 17:51:50,489 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-03-16 17:51:50,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:50" (1/1) ... [2025-03-16 17:51:50,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:50" (1/1) ... [2025-03-16 17:51:50,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:50" (1/1) ... [2025-03-16 17:51:50,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:50" (1/1) ... [2025-03-16 17:51:50,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:50" (1/1) ... [2025-03-16 17:51:50,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:50" (1/1) ... [2025-03-16 17:51:50,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:51:50,504 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:51:50,505 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:51:50,505 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:51:50,506 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:50" (1/1) ... [2025-03-16 17:51:50,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:51:50,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:51:50,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 17:51:50,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 17:51:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:51:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:51:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:51:50,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:51:50,583 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:51:50,584 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:51:51,161 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L437: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1; [2025-03-16 17:51:51,172 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2025-03-16 17:51:51,175 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:51:51,186 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:51:51,187 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:51:51,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:51:51 BoogieIcfgContainer [2025-03-16 17:51:51,187 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:51:51,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:51:51,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:51:51,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:51:51,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:51:50" (1/3) ... [2025-03-16 17:51:51,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219f19cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:51:51, skipping insertion in model container [2025-03-16 17:51:51,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:51:50" (2/3) ... [2025-03-16 17:51:51,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219f19cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:51:51, skipping insertion in model container [2025-03-16 17:51:51,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:51:51" (3/3) ... [2025-03-16 17:51:51,195 INFO L128 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2025-03-16 17:51:51,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:51:51,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gj2007.c.i.p+nlh-reducer.c that has 1 procedures, 143 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 17:51:51,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:51:51,279 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;@5cc92065, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:51:51,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:51:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 141 states have (on average 1.9787234042553192) internal successors, (279), 142 states have internal predecessors, (279), 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-03-16 17:51:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 17:51:51,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:51,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 17:51:51,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:51,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:51,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1656134457, now seen corresponding path program 1 times [2025-03-16 17:51:51,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:51,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003801233] [2025-03-16 17:51:51,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:51,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:51,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 17:51:51,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 17:51:51,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:51,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:51:51,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:51,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003801233] [2025-03-16 17:51:51,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003801233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:51,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:51,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:51:51,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603043213] [2025-03-16 17:51:51,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:51,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:51:51,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:51,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:51:51,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:51:51,630 INFO L87 Difference]: Start difference. First operand has 143 states, 141 states have (on average 1.9787234042553192) internal successors, (279), 142 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-03-16 17:51:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:52,170 INFO L93 Difference]: Finished difference Result 415 states and 817 transitions. [2025-03-16 17:51:52,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:51:52,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-03-16 17:51:52,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:52,179 INFO L225 Difference]: With dead ends: 415 [2025-03-16 17:51:52,179 INFO L226 Difference]: Without dead ends: 274 [2025-03-16 17:51:52,181 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-03-16 17:51:52,184 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 66 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:52,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 87 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 17:51:52,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-16 17:51:52,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2025-03-16 17:51:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.2564102564102564) internal successors, (343), 273 states have internal predecessors, (343), 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-03-16 17:51:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 343 transitions. [2025-03-16 17:51:52,232 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 343 transitions. Word has length 138 [2025-03-16 17:51:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:52,232 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 343 transitions. [2025-03-16 17:51:52,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-03-16 17:51:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 343 transitions. [2025-03-16 17:51:52,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 17:51:52,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:52,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 17:51:52,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:51:52,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:52,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:52,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1807626665, now seen corresponding path program 1 times [2025-03-16 17:51:52,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:52,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129670479] [2025-03-16 17:51:52,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:52,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:52,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 17:51:52,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 17:51:52,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:52,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:52,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:51:52,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:52,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129670479] [2025-03-16 17:51:52,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129670479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:52,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:52,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:51:52,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412323464] [2025-03-16 17:51:52,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:52,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:51:52,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:52,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:51:52,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:51:52,419 INFO L87 Difference]: Start difference. First operand 274 states and 343 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 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-03-16 17:51:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:52,587 INFO L93 Difference]: Finished difference Result 405 states and 474 transitions. [2025-03-16 17:51:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:51:52,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-03-16 17:51:52,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:52,589 INFO L225 Difference]: With dead ends: 405 [2025-03-16 17:51:52,589 INFO L226 Difference]: Without dead ends: 268 [2025-03-16 17:51:52,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:51:52,590 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:52,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:51:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-16 17:51:52,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-03-16 17:51:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.250936329588015) internal successors, (334), 267 states have internal predecessors, (334), 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-03-16 17:51:52,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 334 transitions. [2025-03-16 17:51:52,604 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 334 transitions. Word has length 138 [2025-03-16 17:51:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:52,604 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 334 transitions. [2025-03-16 17:51:52,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 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-03-16 17:51:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 334 transitions. [2025-03-16 17:51:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 17:51:52,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:52,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 17:51:52,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:51:52,607 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:52,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:52,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2013661593, now seen corresponding path program 1 times [2025-03-16 17:51:52,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:52,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777148904] [2025-03-16 17:51:52,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:52,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:52,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 17:51:52,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 17:51:52,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:52,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:51:52,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:52,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777148904] [2025-03-16 17:51:52,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777148904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:52,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:52,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 17:51:52,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269593706] [2025-03-16 17:51:52,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:52,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 17:51:52,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:52,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 17:51:52,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-16 17:51:52,893 INFO L87 Difference]: Start difference. First operand 268 states and 334 transitions. Second operand has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 12 states have internal predecessors, (138), 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-03-16 17:51:53,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:53,132 INFO L93 Difference]: Finished difference Result 383 states and 449 transitions. [2025-03-16 17:51:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 17:51:53,133 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 12 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-03-16 17:51:53,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:53,134 INFO L225 Difference]: With dead ends: 383 [2025-03-16 17:51:53,134 INFO L226 Difference]: Without dead ends: 252 [2025-03-16 17:51:53,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-16 17:51:53,135 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:53,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:51:53,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-16 17:51:53,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-03-16 17:51:53,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.2350597609561753) internal successors, (310), 251 states have internal predecessors, (310), 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-03-16 17:51:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 310 transitions. [2025-03-16 17:51:53,142 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 310 transitions. Word has length 138 [2025-03-16 17:51:53,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:53,142 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 310 transitions. [2025-03-16 17:51:53,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 12 states have internal predecessors, (138), 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-03-16 17:51:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 310 transitions. [2025-03-16 17:51:53,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 17:51:53,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:53,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 17:51:53,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 17:51:53,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:53,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:53,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1050951287, now seen corresponding path program 1 times [2025-03-16 17:51:53,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:53,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771459614] [2025-03-16 17:51:53,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:53,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:53,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 17:51:53,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 17:51:53,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:53,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:51:53,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:53,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771459614] [2025-03-16 17:51:53,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771459614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:53,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:53,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-16 17:51:53,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332727966] [2025-03-16 17:51:53,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:53,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 17:51:53,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:53,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 17:51:53,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2025-03-16 17:51:53,594 INFO L87 Difference]: Start difference. First operand 252 states and 310 transitions. Second operand has 21 states, 21 states have (on average 6.571428571428571) internal successors, (138), 20 states have internal predecessors, (138), 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-03-16 17:51:53,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:53,989 INFO L93 Difference]: Finished difference Result 351 states and 409 transitions. [2025-03-16 17:51:53,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-16 17:51:53,989 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.571428571428571) internal successors, (138), 20 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-03-16 17:51:53,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:53,990 INFO L225 Difference]: With dead ends: 351 [2025-03-16 17:51:53,990 INFO L226 Difference]: Without dead ends: 236 [2025-03-16 17:51:53,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2025-03-16 17:51:53,992 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:53,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 17:51:53,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-16 17:51:53,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-03-16 17:51:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.2170212765957447) internal successors, (286), 235 states have internal predecessors, (286), 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-03-16 17:51:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 286 transitions. [2025-03-16 17:51:54,001 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 286 transitions. Word has length 138 [2025-03-16 17:51:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:54,001 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 286 transitions. [2025-03-16 17:51:54,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.571428571428571) internal successors, (138), 20 states have internal predecessors, (138), 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-03-16 17:51:54,001 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 286 transitions. [2025-03-16 17:51:54,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 17:51:54,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:54,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 17:51:54,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:51:54,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:54,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:54,003 INFO L85 PathProgramCache]: Analyzing trace with hash 545302151, now seen corresponding path program 1 times [2025-03-16 17:51:54,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:54,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47177327] [2025-03-16 17:51:54,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:54,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:54,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 17:51:54,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 17:51:54,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:54,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:51:54,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:54,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47177327] [2025-03-16 17:51:54,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47177327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:54,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:54,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-03-16 17:51:54,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11769887] [2025-03-16 17:51:54,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:54,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 17:51:54,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:54,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 17:51:54,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2025-03-16 17:51:54,647 INFO L87 Difference]: Start difference. First operand 236 states and 286 transitions. Second operand has 29 states, 29 states have (on average 4.758620689655173) internal successors, (138), 28 states have internal predecessors, (138), 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-03-16 17:51:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:54,992 INFO L93 Difference]: Finished difference Result 319 states and 369 transitions. [2025-03-16 17:51:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-16 17:51:54,993 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.758620689655173) internal successors, (138), 28 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-03-16 17:51:54,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:54,994 INFO L225 Difference]: With dead ends: 319 [2025-03-16 17:51:54,994 INFO L226 Difference]: Without dead ends: 220 [2025-03-16 17:51:54,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2025-03-16 17:51:54,997 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:54,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 17:51:54,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-16 17:51:55,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-03-16 17:51:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.1963470319634704) internal successors, (262), 219 states have internal predecessors, (262), 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-03-16 17:51:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 262 transitions. [2025-03-16 17:51:55,008 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 262 transitions. Word has length 138 [2025-03-16 17:51:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:55,008 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 262 transitions. [2025-03-16 17:51:55,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.758620689655173) internal successors, (138), 28 states have internal predecessors, (138), 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-03-16 17:51:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 262 transitions. [2025-03-16 17:51:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 17:51:55,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:55,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 17:51:55,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 17:51:55,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:55,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:55,011 INFO L85 PathProgramCache]: Analyzing trace with hash 365899415, now seen corresponding path program 1 times [2025-03-16 17:51:55,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:55,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194313668] [2025-03-16 17:51:55,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:55,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:55,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 17:51:55,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 17:51:55,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:55,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:51:55,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:55,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194313668] [2025-03-16 17:51:55,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194313668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:55,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:55,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2025-03-16 17:51:55,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521464716] [2025-03-16 17:51:55,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:55,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-16 17:51:55,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:55,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-16 17:51:55,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2025-03-16 17:51:55,829 INFO L87 Difference]: Start difference. First operand 220 states and 262 transitions. Second operand has 37 states, 37 states have (on average 3.72972972972973) internal successors, (138), 36 states have internal predecessors, (138), 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-03-16 17:51:56,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:56,101 INFO L93 Difference]: Finished difference Result 287 states and 329 transitions. [2025-03-16 17:51:56,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-16 17:51:56,102 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.72972972972973) internal successors, (138), 36 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-03-16 17:51:56,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:56,103 INFO L225 Difference]: With dead ends: 287 [2025-03-16 17:51:56,103 INFO L226 Difference]: Without dead ends: 204 [2025-03-16 17:51:56,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2025-03-16 17:51:56,104 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:56,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 17:51:56,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-16 17:51:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-16 17:51:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.1724137931034482) internal successors, (238), 203 states have internal predecessors, (238), 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-03-16 17:51:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 238 transitions. [2025-03-16 17:51:56,108 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 238 transitions. Word has length 138 [2025-03-16 17:51:56,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:56,108 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 238 transitions. [2025-03-16 17:51:56,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.72972972972973) internal successors, (138), 36 states have internal predecessors, (138), 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-03-16 17:51:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 238 transitions. [2025-03-16 17:51:56,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 17:51:56,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:56,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 17:51:56,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 17:51:56,109 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:56,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:56,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2033199449, now seen corresponding path program 1 times [2025-03-16 17:51:56,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:56,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864208222] [2025-03-16 17:51:56,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:56,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:56,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 17:51:56,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 17:51:56,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:56,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:51:57,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:57,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864208222] [2025-03-16 17:51:57,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864208222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:57,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:57,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2025-03-16 17:51:57,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567737429] [2025-03-16 17:51:57,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:57,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-16 17:51:57,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:57,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-16 17:51:57,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2025-03-16 17:51:57,098 INFO L87 Difference]: Start difference. First operand 204 states and 238 transitions. Second operand has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 44 states have internal predecessors, (138), 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-03-16 17:51:57,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:57,432 INFO L93 Difference]: Finished difference Result 255 states and 289 transitions. [2025-03-16 17:51:57,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-16 17:51:57,432 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-03-16 17:51:57,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:57,433 INFO L225 Difference]: With dead ends: 255 [2025-03-16 17:51:57,433 INFO L226 Difference]: Without dead ends: 188 [2025-03-16 17:51:57,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2025-03-16 17:51:57,434 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:57,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 17:51:57,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-16 17:51:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-03-16 17:51:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.1443850267379678) internal successors, (214), 187 states have internal predecessors, (214), 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-03-16 17:51:57,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 214 transitions. [2025-03-16 17:51:57,438 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 214 transitions. Word has length 138 [2025-03-16 17:51:57,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:57,438 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 214 transitions. [2025-03-16 17:51:57,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 44 states have internal predecessors, (138), 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-03-16 17:51:57,438 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 214 transitions. [2025-03-16 17:51:57,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 17:51:57,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:57,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 17:51:57,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 17:51:57,441 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:51:57,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:57,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1539481271, now seen corresponding path program 1 times [2025-03-16 17:51:57,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:57,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18762062] [2025-03-16 17:51:57,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:57,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:57,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 17:51:57,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 17:51:57,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:57,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:51:59,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:59,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18762062] [2025-03-16 17:51:59,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18762062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:59,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:59,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2025-03-16 17:51:59,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213532998] [2025-03-16 17:51:59,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:59,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2025-03-16 17:51:59,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:59,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2025-03-16 17:51:59,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2025-03-16 17:51:59,396 INFO L87 Difference]: Start difference. First operand 188 states and 214 transitions. Second operand has 70 states, 70 states have (on average 1.9714285714285715) internal successors, (138), 69 states have internal predecessors, (138), 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-03-16 17:52:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:52:00,003 INFO L93 Difference]: Finished difference Result 499 states and 542 transitions. [2025-03-16 17:52:00,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-16 17:52:00,004 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.9714285714285715) internal successors, (138), 69 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-03-16 17:52:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:52:00,005 INFO L225 Difference]: With dead ends: 499 [2025-03-16 17:52:00,005 INFO L226 Difference]: Without dead ends: 448 [2025-03-16 17:52:00,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2025-03-16 17:52:00,007 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 273 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 17:52:00,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 16 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 17:52:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-16 17:52:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 447. [2025-03-16 17:52:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.0426008968609866) internal successors, (465), 446 states have internal predecessors, (465), 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-03-16 17:52:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 465 transitions. [2025-03-16 17:52:00,013 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 465 transitions. Word has length 138 [2025-03-16 17:52:00,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:52:00,013 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 465 transitions. [2025-03-16 17:52:00,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.9714285714285715) internal successors, (138), 69 states have internal predecessors, (138), 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-03-16 17:52:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 465 transitions. [2025-03-16 17:52:00,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-16 17:52:00,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:52:00,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 17:52:00,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 17:52:00,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:52:00,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:52:00,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1973470784, now seen corresponding path program 1 times [2025-03-16 17:52:00,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:52:00,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124123001] [2025-03-16 17:52:00,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:52:00,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:52:00,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 17:52:00,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 17:52:00,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:52:00,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:52:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:52:01,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:52:01,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124123001] [2025-03-16 17:52:01,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124123001] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:52:01,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498250076] [2025-03-16 17:52:01,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:52:01,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:52:01,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:52:01,705 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:52:01,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 17:52:01,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 17:52:01,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 17:52:01,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:52:01,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:52:01,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-16 17:52:01,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:52:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:52:01,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:52:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:52:04,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498250076] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:52:04,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:52:04,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 101 [2025-03-16 17:52:04,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696074053] [2025-03-16 17:52:04,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:52:04,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2025-03-16 17:52:04,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:52:04,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2025-03-16 17:52:04,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2025-03-16 17:52:04,731 INFO L87 Difference]: Start difference. First operand 447 states and 465 transitions. Second operand has 102 states, 102 states have (on average 2.7254901960784315) internal successors, (278), 101 states have internal predecessors, (278), 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-03-16 17:52:05,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:52:05,564 INFO L93 Difference]: Finished difference Result 514 states and 563 transitions. [2025-03-16 17:52:05,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-03-16 17:52:05,565 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 2.7254901960784315) internal successors, (278), 101 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2025-03-16 17:52:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:52:05,566 INFO L225 Difference]: With dead ends: 514 [2025-03-16 17:52:05,566 INFO L226 Difference]: Without dead ends: 511 [2025-03-16 17:52:05,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 38 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1881 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2025-03-16 17:52:05,568 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 409 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 17:52:05,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 16 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 17:52:05,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-16 17:52:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-03-16 17:52:05,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.0372549019607844) internal successors, (529), 510 states have internal predecessors, (529), 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-03-16 17:52:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 529 transitions. [2025-03-16 17:52:05,574 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 529 transitions. Word has length 140 [2025-03-16 17:52:05,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:52:05,574 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 529 transitions. [2025-03-16 17:52:05,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 2.7254901960784315) internal successors, (278), 101 states have internal predecessors, (278), 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-03-16 17:52:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 529 transitions. [2025-03-16 17:52:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-16 17:52:05,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:52:05,576 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 17:52:05,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 17:52:05,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:52:05,777 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:52:05,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:52:05,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1045802144, now seen corresponding path program 2 times [2025-03-16 17:52:05,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:52:05,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781957563] [2025-03-16 17:52:05,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:52:05,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:52:05,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 204 statements into 2 equivalence classes. [2025-03-16 17:52:05,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 204 of 204 statements. [2025-03-16 17:52:05,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:52:05,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:52:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:52:07,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:52:07,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781957563] [2025-03-16 17:52:07,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781957563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:52:07,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97129584] [2025-03-16 17:52:07,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:52:07,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:52:07,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:52:07,142 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:52:07,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 17:52:07,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 204 statements into 2 equivalence classes. [2025-03-16 17:52:07,217 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 204 of 204 statements. [2025-03-16 17:52:07,217 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:52:07,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:52:07,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-03-16 17:52:07,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:52:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:52:07,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:52:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:52:07,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97129584] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:52:07,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:52:07,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 54 [2025-03-16 17:52:07,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588343378] [2025-03-16 17:52:07,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:52:07,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-16 17:52:07,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:52:07,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-16 17:52:07,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2025-03-16 17:52:07,709 INFO L87 Difference]: Start difference. First operand 511 states and 529 transitions. Second operand has 55 states, 55 states have (on average 3.7454545454545456) internal successors, (206), 54 states have internal predecessors, (206), 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-03-16 17:52:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:52:10,348 INFO L93 Difference]: Finished difference Result 517 states and 535 transitions. [2025-03-16 17:52:10,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-16 17:52:10,348 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.7454545454545456) internal successors, (206), 54 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-03-16 17:52:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:52:10,350 INFO L225 Difference]: With dead ends: 517 [2025-03-16 17:52:10,350 INFO L226 Difference]: Without dead ends: 514 [2025-03-16 17:52:10,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 405 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2025-03-16 17:52:10,351 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 172 mSDsluCounter, 16525 mSDsCounter, 0 mSdLazyCounter, 10714 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 16850 SdHoareTripleChecker+Invalid, 10867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 10714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 17:52:10,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 16850 Invalid, 10867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 10714 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 17:52:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-16 17:52:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 513. [2025-03-16 17:52:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.037109375) internal successors, (531), 512 states have internal predecessors, (531), 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-03-16 17:52:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 531 transitions. [2025-03-16 17:52:10,356 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 531 transitions. Word has length 204 [2025-03-16 17:52:10,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:52:10,356 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 531 transitions. [2025-03-16 17:52:10,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.7454545454545456) internal successors, (206), 54 states have internal predecessors, (206), 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-03-16 17:52:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 531 transitions. [2025-03-16 17:52:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-16 17:52:10,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:52:10,358 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 17:52:10,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 17:52:10,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 17:52:10,563 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:52:10,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:52:10,563 INFO L85 PathProgramCache]: Analyzing trace with hash 7206057, now seen corresponding path program 3 times [2025-03-16 17:52:10,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:52:10,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64392970] [2025-03-16 17:52:10,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:52:10,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:52:10,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 206 statements into 35 equivalence classes. [2025-03-16 17:52:10,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) and asserted 206 of 206 statements. [2025-03-16 17:52:10,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2025-03-16 17:52:10,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:52:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:52:11,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:52:11,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64392970] [2025-03-16 17:52:11,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64392970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:52:11,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:52:11,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2025-03-16 17:52:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786623852] [2025-03-16 17:52:11,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:52:11,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-16 17:52:11,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:52:11,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-16 17:52:11,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 17:52:11,778 INFO L87 Difference]: Start difference. First operand 513 states and 531 transitions. Second operand has 52 states, 52 states have (on average 3.9615384615384617) internal successors, (206), 52 states have internal predecessors, (206), 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-03-16 17:52:12,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:52:12,355 INFO L93 Difference]: Finished difference Result 513 states and 531 transitions. [2025-03-16 17:52:12,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-16 17:52:12,356 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.9615384615384617) internal successors, (206), 52 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-03-16 17:52:12,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:52:12,356 INFO L225 Difference]: With dead ends: 513 [2025-03-16 17:52:12,356 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 17:52:12,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 17:52:12,357 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 142 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 17:52:12,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 121 Invalid, 1759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 17:52:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 17:52:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 17:52:12,357 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-03-16 17:52:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 17:52:12,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2025-03-16 17:52:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:52:12,358 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 17:52:12,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.9615384615384617) internal successors, (206), 52 states have internal predecessors, (206), 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-03-16 17:52:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 17:52:12,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 17:52:12,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 17:52:12,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 17:52:12,363 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:52:12,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 17:52:12,367 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 17:52:12,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 05:52:12 BoogieIcfgContainer [2025-03-16 17:52:12,371 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 17:52:12,371 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 17:52:12,371 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 17:52:12,372 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 17:52:12,372 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:51:51" (3/4) ... [2025-03-16 17:52:12,373 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 17:52:12,382 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-16 17:52:12,383 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 17:52:12,383 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 17:52:12,384 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 17:52:12,464 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 17:52:12,464 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 17:52:12,464 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 17:52:12,465 INFO L158 Benchmark]: Toolchain (without parser) took 22353.71ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 113.6MB in the beginning and 323.6MB in the end (delta: -210.1MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2025-03-16 17:52:12,465 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:52:12,465 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.52ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 95.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 17:52:12,465 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.09ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 92.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:52:12,466 INFO L158 Benchmark]: Boogie Preprocessor took 38.33ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:52:12,466 INFO L158 Benchmark]: IcfgBuilder took 683.37ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 44.0MB in the end (delta: 46.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 17:52:12,466 INFO L158 Benchmark]: TraceAbstraction took 21181.24ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 43.5MB in the beginning and 336.2MB in the end (delta: -292.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:52:12,467 INFO L158 Benchmark]: Witness Printer took 92.83ms. Allocated memory is still 385.9MB. Free memory was 336.2MB in the beginning and 323.6MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 17:52:12,468 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.19ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.52ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 95.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.09ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 92.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.33ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 683.37ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 44.0MB in the end (delta: 46.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21181.24ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 43.5MB in the beginning and 336.2MB in the end (delta: -292.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 92.83ms. Allocated memory is still 385.9MB. Free memory was 336.2MB in the beginning and 323.6MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. 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: 444]: 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 1 procedures, 143 locations, 279 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 11, TraceHistogramMax: 34, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1062 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1062 mSDsluCounter, 17968 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16597 mSDsCounter, 1382 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19636 IncrementalHoareTripleChecker+Invalid, 21018 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1382 mSolverCounterUnsat, 1371 mSDtfsCounter, 19636 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1075 GetRequests, 626 SyntacticMatches, 39 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1881 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=513occurred in iteration=10, InterpolantAutomatonStates: 431, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 1998 NumberOfCodeBlocks, 1998 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2327 ConstructedInterpolants, 0 QuantifiedInterpolants, 5386 SizeOfPredicates, 0 NumberOfNonLiveVariables, 882 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 1156/4426 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-16 17:52:12,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE