./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label39.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/eca-rers2012/Problem16_label39.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 c9e5fbdda66ebb475fc0f8bb519ddbac927ae9c052949a5df5d6f2e890e35299 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:14:27,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:14:27,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:14:27,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:14:27,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:14:27,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:14:27,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:14:27,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:14:27,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:14:27,941 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:14:27,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:14:27,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:14:27,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:14:27,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:14:27,941 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:14:27,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:14:27,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:14:27,941 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:14:27,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:14:27,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:14:27,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:14:27,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:14:27,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:14:27,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:14:27,943 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:14:27,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:14:27,943 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:14:27,943 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:14:27,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:14:27,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:14:27,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:14:27,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:14:27,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:14:27,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:14:27,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:14:27,944 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:14:27,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:14:27,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:14:27,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:14:27,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:14:27,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:14:27,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:14:27,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:14:27,945 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 -> c9e5fbdda66ebb475fc0f8bb519ddbac927ae9c052949a5df5d6f2e890e35299 [2025-03-16 15:14:28,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:14:28,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:14:28,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:14:28,182 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:14:28,183 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:14:28,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label39.c [2025-03-16 15:14:29,386 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c6346a3/2f122a5a755d494b92432befb50b991c/FLAG3e30098e4 [2025-03-16 15:14:29,759 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:14:29,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label39.c [2025-03-16 15:14:29,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c6346a3/2f122a5a755d494b92432befb50b991c/FLAG3e30098e4 [2025-03-16 15:14:29,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c6346a3/2f122a5a755d494b92432befb50b991c [2025-03-16 15:14:29,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:14:29,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:14:29,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:14:29,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:14:29,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:14:29,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:14:29" (1/1) ... [2025-03-16 15:14:29,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6f5a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:29, skipping insertion in model container [2025-03-16 15:14:29,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:14:29" (1/1) ... [2025-03-16 15:14:29,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:14:29,967 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/eca-rers2012/Problem16_label39.c[5211,5224] [2025-03-16 15:14:30,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:14:30,189 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:14:30,207 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/eca-rers2012/Problem16_label39.c[5211,5224] [2025-03-16 15:14:30,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:14:30,320 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:14:30,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:30 WrapperNode [2025-03-16 15:14:30,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:14:30,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:14:30,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:14:30,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:14:30,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:30" (1/1) ... [2025-03-16 15:14:30,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:30" (1/1) ... [2025-03-16 15:14:30,440 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-16 15:14:30,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:14:30,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:14:30,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:14:30,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:14:30,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:30" (1/1) ... [2025-03-16 15:14:30,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:30" (1/1) ... [2025-03-16 15:14:30,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:30" (1/1) ... [2025-03-16 15:14:30,546 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 15:14:30,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:30" (1/1) ... [2025-03-16 15:14:30,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:30" (1/1) ... [2025-03-16 15:14:30,588 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:30" (1/1) ... [2025-03-16 15:14:30,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:30" (1/1) ... [2025-03-16 15:14:30,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:30" (1/1) ... [2025-03-16 15:14:30,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:30" (1/1) ... [2025-03-16 15:14:30,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:14:30,639 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:14:30,640 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:14:30,640 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:14:30,641 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:30" (1/1) ... [2025-03-16 15:14:30,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:14:30,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:14:30,668 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 15:14:30,672 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 15:14:30,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:14:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:14:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:14:30,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:14:30,745 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:14:30,747 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:14:32,384 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-16 15:14:32,463 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-16 15:14:32,463 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:14:32,483 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:14:32,486 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:14:32,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:14:32 BoogieIcfgContainer [2025-03-16 15:14:32,487 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:14:32,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:14:32,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:14:32,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:14:32,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:14:29" (1/3) ... [2025-03-16 15:14:32,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae16e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:14:32, skipping insertion in model container [2025-03-16 15:14:32,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:30" (2/3) ... [2025-03-16 15:14:32,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae16e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:14:32, skipping insertion in model container [2025-03-16 15:14:32,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:14:32" (3/3) ... [2025-03-16 15:14:32,496 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label39.c [2025-03-16 15:14:32,509 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:14:32,510 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label39.c that has 1 procedures, 335 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:14:32,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:14:32,582 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;@66b42d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:14:32,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:14:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 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 15:14:32,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 15:14:32,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:32,594 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] [2025-03-16 15:14:32,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:32,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1453797038, now seen corresponding path program 1 times [2025-03-16 15:14:32,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:32,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795461368] [2025-03-16 15:14:32,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:32,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:32,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 15:14:32,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 15:14:32,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:32,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:32,726 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 15:14:32,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:32,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795461368] [2025-03-16 15:14:32,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795461368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:32,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:32,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:14:32,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526942379] [2025-03-16 15:14:32,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:32,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:14:32,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:32,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:14:32,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:14:32,752 INFO L87 Difference]: Start difference. First operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 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 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:14:32,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:32,799 INFO L93 Difference]: Finished difference Result 669 states and 1321 transitions. [2025-03-16 15:14:32,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:14:32,800 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-16 15:14:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:32,810 INFO L225 Difference]: With dead ends: 669 [2025-03-16 15:14:32,810 INFO L226 Difference]: Without dead ends: 332 [2025-03-16 15:14:32,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:14:32,817 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:32,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:14:32,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-16 15:14:32,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-16 15:14:32,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 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 15:14:32,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2025-03-16 15:14:32,866 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 48 [2025-03-16 15:14:32,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:32,868 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2025-03-16 15:14:32,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:14:32,868 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2025-03-16 15:14:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 15:14:32,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:32,869 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] [2025-03-16 15:14:32,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:14:32,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:32,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:32,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1128020943, now seen corresponding path program 1 times [2025-03-16 15:14:32,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:32,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885688293] [2025-03-16 15:14:32,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:32,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:32,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 15:14:32,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 15:14:32,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:32,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:33,049 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 15:14:33,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:33,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885688293] [2025-03-16 15:14:33,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885688293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:33,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:33,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:14:33,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064149941] [2025-03-16 15:14:33,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:33,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:33,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:33,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:33,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:33,052 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:14:34,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:34,264 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2025-03-16 15:14:34,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:34,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-16 15:14:34,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:34,269 INFO L225 Difference]: With dead ends: 992 [2025-03-16 15:14:34,270 INFO L226 Difference]: Without dead ends: 661 [2025-03-16 15:14:34,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:34,271 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 289 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:34,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 38 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:14:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-03-16 15:14:34,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2025-03-16 15:14:34,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.7651515151515151) internal successors, (1165), 660 states have internal predecessors, (1165), 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 15:14:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1165 transitions. [2025-03-16 15:14:34,296 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1165 transitions. Word has length 48 [2025-03-16 15:14:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:34,297 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1165 transitions. [2025-03-16 15:14:34,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:14:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1165 transitions. [2025-03-16 15:14:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 15:14:34,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:34,303 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:14:34,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:14:34,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:34,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:34,304 INFO L85 PathProgramCache]: Analyzing trace with hash -81158876, now seen corresponding path program 1 times [2025-03-16 15:14:34,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:34,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810032378] [2025-03-16 15:14:34,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:34,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:34,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 15:14:34,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 15:14:34,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:34,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:14:34,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:34,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810032378] [2025-03-16 15:14:34,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810032378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:34,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:34,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:14:34,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764604685] [2025-03-16 15:14:34,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:34,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:34,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:34,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:34,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:34,493 INFO L87 Difference]: Start difference. First operand 661 states and 1165 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 15:14:35,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:35,759 INFO L93 Difference]: Finished difference Result 1979 states and 3492 transitions. [2025-03-16 15:14:35,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:35,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 113 [2025-03-16 15:14:35,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:35,765 INFO L225 Difference]: With dead ends: 1979 [2025-03-16 15:14:35,765 INFO L226 Difference]: Without dead ends: 1319 [2025-03-16 15:14:35,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:35,767 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 344 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:35,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 76 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:14:35,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2025-03-16 15:14:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2025-03-16 15:14:35,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.6661608497723823) internal successors, (2196), 1318 states have internal predecessors, (2196), 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 15:14:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 2196 transitions. [2025-03-16 15:14:35,803 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 2196 transitions. Word has length 113 [2025-03-16 15:14:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:35,803 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 2196 transitions. [2025-03-16 15:14:35,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 15:14:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 2196 transitions. [2025-03-16 15:14:35,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 15:14:35,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:35,804 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:14:35,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:14:35,805 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:35,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:35,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1942971459, now seen corresponding path program 1 times [2025-03-16 15:14:35,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:35,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327540108] [2025-03-16 15:14:35,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:35,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:35,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 15:14:35,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 15:14:35,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:35,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:14:36,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:36,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327540108] [2025-03-16 15:14:36,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327540108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:36,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:36,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:36,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586032124] [2025-03-16 15:14:36,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:36,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:14:36,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:36,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:14:36,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:14:36,048 INFO L87 Difference]: Start difference. First operand 1319 states and 2196 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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 15:14:37,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:37,777 INFO L93 Difference]: Finished difference Result 3624 states and 5925 transitions. [2025-03-16 15:14:37,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:14:37,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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 116 [2025-03-16 15:14:37,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:37,787 INFO L225 Difference]: With dead ends: 3624 [2025-03-16 15:14:37,787 INFO L226 Difference]: Without dead ends: 2306 [2025-03-16 15:14:37,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:14:37,790 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1002 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:37,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 42 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:14:37,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-03-16 15:14:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2306. [2025-03-16 15:14:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2305 states have (on average 1.502819956616052) internal successors, (3464), 2305 states have internal predecessors, (3464), 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 15:14:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3464 transitions. [2025-03-16 15:14:37,831 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3464 transitions. Word has length 116 [2025-03-16 15:14:37,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:37,831 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 3464 transitions. [2025-03-16 15:14:37,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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 15:14:37,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3464 transitions. [2025-03-16 15:14:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 15:14:37,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:37,834 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:14:37,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:14:37,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:37,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:37,838 INFO L85 PathProgramCache]: Analyzing trace with hash -563393080, now seen corresponding path program 1 times [2025-03-16 15:14:37,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:37,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308123210] [2025-03-16 15:14:37,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:37,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:37,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 15:14:37,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 15:14:37,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:37,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-16 15:14:38,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:38,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308123210] [2025-03-16 15:14:38,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308123210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:38,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:38,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:14:38,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251923677] [2025-03-16 15:14:38,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:38,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:38,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:38,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:38,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:38,059 INFO L87 Difference]: Start difference. First operand 2306 states and 3464 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 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 15:14:38,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:38,981 INFO L93 Difference]: Finished difference Result 5598 states and 8605 transitions. [2025-03-16 15:14:38,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:38,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 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 232 [2025-03-16 15:14:38,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:38,992 INFO L225 Difference]: With dead ends: 5598 [2025-03-16 15:14:38,992 INFO L226 Difference]: Without dead ends: 3622 [2025-03-16 15:14:38,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:38,995 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 349 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:38,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 154 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:14:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2025-03-16 15:14:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3293. [2025-03-16 15:14:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3293 states, 3292 states have (on average 1.3323207776427703) internal successors, (4386), 3292 states have internal predecessors, (4386), 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 15:14:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 4386 transitions. [2025-03-16 15:14:39,042 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 4386 transitions. Word has length 232 [2025-03-16 15:14:39,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:39,043 INFO L471 AbstractCegarLoop]: Abstraction has 3293 states and 4386 transitions. [2025-03-16 15:14:39,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 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 15:14:39,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 4386 transitions. [2025-03-16 15:14:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-16 15:14:39,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:39,049 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:14:39,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:14:39,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:39,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:39,050 INFO L85 PathProgramCache]: Analyzing trace with hash 13654283, now seen corresponding path program 1 times [2025-03-16 15:14:39,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:39,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689655335] [2025-03-16 15:14:39,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:39,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:39,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-16 15:14:39,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-16 15:14:39,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:39,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2025-03-16 15:14:39,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689655335] [2025-03-16 15:14:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689655335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:39,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:39,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437146498] [2025-03-16 15:14:39,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:39,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:39,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:39,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:39,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:39,354 INFO L87 Difference]: Start difference. First operand 3293 states and 4386 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 15:14:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:40,284 INFO L93 Difference]: Finished difference Result 7572 states and 10178 transitions. [2025-03-16 15:14:40,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:40,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 468 [2025-03-16 15:14:40,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:40,294 INFO L225 Difference]: With dead ends: 7572 [2025-03-16 15:14:40,294 INFO L226 Difference]: Without dead ends: 3951 [2025-03-16 15:14:40,298 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 15:14:40,300 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 257 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:40,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 538 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:14:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2025-03-16 15:14:40,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2025-03-16 15:14:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.0979746835443038) internal successors, (4337), 3950 states have internal predecessors, (4337), 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 15:14:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4337 transitions. [2025-03-16 15:14:40,353 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4337 transitions. Word has length 468 [2025-03-16 15:14:40,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:40,353 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4337 transitions. [2025-03-16 15:14:40,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 15:14:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4337 transitions. [2025-03-16 15:14:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2025-03-16 15:14:40,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:40,385 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:40,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:14:40,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:40,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1807571558, now seen corresponding path program 1 times [2025-03-16 15:14:40,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:40,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029004668] [2025-03-16 15:14:40,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:40,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 722 statements into 1 equivalence classes. [2025-03-16 15:14:40,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 722 of 722 statements. [2025-03-16 15:14:40,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:40,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:41,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 968 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2025-03-16 15:14:41,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:41,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029004668] [2025-03-16 15:14:41,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029004668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:41,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:41,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:41,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399493039] [2025-03-16 15:14:41,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:41,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:41,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:41,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:41,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:41,009 INFO L87 Difference]: Start difference. First operand 3951 states and 4337 transitions. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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 15:14:41,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:41,770 INFO L93 Difference]: Finished difference Result 10204 states and 11202 transitions. [2025-03-16 15:14:41,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:41,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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 722 [2025-03-16 15:14:41,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:41,785 INFO L225 Difference]: With dead ends: 10204 [2025-03-16 15:14:41,785 INFO L226 Difference]: Without dead ends: 6583 [2025-03-16 15:14:41,788 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 15:14:41,789 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 219 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:41,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 426 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:14:41,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6583 states. [2025-03-16 15:14:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6583 to 5267. [2025-03-16 15:14:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5267 states, 5266 states have (on average 1.0788074439802506) internal successors, (5681), 5266 states have internal predecessors, (5681), 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 15:14:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 5681 transitions. [2025-03-16 15:14:41,853 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 5681 transitions. Word has length 722 [2025-03-16 15:14:41,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:41,854 INFO L471 AbstractCegarLoop]: Abstraction has 5267 states and 5681 transitions. [2025-03-16 15:14:41,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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 15:14:41,854 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 5681 transitions. [2025-03-16 15:14:41,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-03-16 15:14:41,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:41,868 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:41,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:14:41,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:41,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:41,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1476702551, now seen corresponding path program 1 times [2025-03-16 15:14:41,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:41,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307188548] [2025-03-16 15:14:41,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:41,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:41,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-03-16 15:14:41,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-03-16 15:14:41,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:41,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 934 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-03-16 15:14:42,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:42,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307188548] [2025-03-16 15:14:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307188548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:42,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:42,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:42,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850090393] [2025-03-16 15:14:42,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:42,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:42,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:42,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:42,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:42,490 INFO L87 Difference]: Start difference. First operand 5267 states and 5681 transitions. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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 15:14:43,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:43,162 INFO L93 Difference]: Finished difference Result 13494 states and 14671 transitions. [2025-03-16 15:14:43,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:43,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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 785 [2025-03-16 15:14:43,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:43,185 INFO L225 Difference]: With dead ends: 13494 [2025-03-16 15:14:43,187 INFO L226 Difference]: Without dead ends: 8557 [2025-03-16 15:14:43,191 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 15:14:43,191 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 171 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:43,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 430 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:14:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8557 states. [2025-03-16 15:14:43,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8557 to 7899. [2025-03-16 15:14:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7899 states, 7898 states have (on average 1.0645733096986578) internal successors, (8408), 7898 states have internal predecessors, (8408), 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 15:14:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7899 states to 7899 states and 8408 transitions. [2025-03-16 15:14:43,285 INFO L78 Accepts]: Start accepts. Automaton has 7899 states and 8408 transitions. Word has length 785 [2025-03-16 15:14:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:43,286 INFO L471 AbstractCegarLoop]: Abstraction has 7899 states and 8408 transitions. [2025-03-16 15:14:43,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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 15:14:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 7899 states and 8408 transitions. [2025-03-16 15:14:43,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 826 [2025-03-16 15:14:43,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:43,298 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:43,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:14:43,299 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:43,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1177096667, now seen corresponding path program 1 times [2025-03-16 15:14:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:43,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583485808] [2025-03-16 15:14:43,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:43,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:43,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 825 statements into 1 equivalence classes. [2025-03-16 15:14:43,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 825 of 825 statements. [2025-03-16 15:14:43,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:43,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 945 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-16 15:14:43,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:43,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583485808] [2025-03-16 15:14:43,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583485808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:43,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:43,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:43,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514681748] [2025-03-16 15:14:43,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:43,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:43,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:43,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:43,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:43,996 INFO L87 Difference]: Start difference. First operand 7899 states and 8408 transitions. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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 15:14:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:44,753 INFO L93 Difference]: Finished difference Result 17771 states and 18968 transitions. [2025-03-16 15:14:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:44,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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 825 [2025-03-16 15:14:44,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:44,774 INFO L225 Difference]: With dead ends: 17771 [2025-03-16 15:14:44,774 INFO L226 Difference]: Without dead ends: 10202 [2025-03-16 15:14:44,781 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 15:14:44,782 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 233 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:44,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 79 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:14:44,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10202 states. [2025-03-16 15:14:44,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10202 to 9544. [2025-03-16 15:14:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9544 states, 9543 states have (on average 1.0490411820182333) internal successors, (10011), 9543 states have internal predecessors, (10011), 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 15:14:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9544 states to 9544 states and 10011 transitions. [2025-03-16 15:14:44,926 INFO L78 Accepts]: Start accepts. Automaton has 9544 states and 10011 transitions. Word has length 825 [2025-03-16 15:14:44,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:44,926 INFO L471 AbstractCegarLoop]: Abstraction has 9544 states and 10011 transitions. [2025-03-16 15:14:44,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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 15:14:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 9544 states and 10011 transitions. [2025-03-16 15:14:44,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1273 [2025-03-16 15:14:44,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:44,950 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:44,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:14:44,950 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:44,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:44,954 INFO L85 PathProgramCache]: Analyzing trace with hash -344727362, now seen corresponding path program 1 times [2025-03-16 15:14:44,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:44,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450824843] [2025-03-16 15:14:44,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:44,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:45,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1272 statements into 1 equivalence classes. [2025-03-16 15:14:45,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1272 of 1272 statements. [2025-03-16 15:14:45,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:45,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2945 backedges. 1705 proven. 0 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2025-03-16 15:14:45,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:45,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450824843] [2025-03-16 15:14:45,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450824843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:45,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:45,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:45,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767394473] [2025-03-16 15:14:45,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:45,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:45,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:45,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:45,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:45,942 INFO L87 Difference]: Start difference. First operand 9544 states and 10011 transitions. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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 15:14:46,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:46,625 INFO L93 Difference]: Finished difference Result 19745 states and 20742 transitions. [2025-03-16 15:14:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:46,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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 1272 [2025-03-16 15:14:46,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:46,641 INFO L225 Difference]: With dead ends: 19745 [2025-03-16 15:14:46,641 INFO L226 Difference]: Without dead ends: 10531 [2025-03-16 15:14:46,648 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 15:14:46,649 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 224 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:46,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 437 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:14:46,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10531 states. [2025-03-16 15:14:46,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10531 to 10531. [2025-03-16 15:14:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10531 states, 10530 states have (on average 1.0451092117758785) internal successors, (11005), 10530 states have internal predecessors, (11005), 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 15:14:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10531 states to 10531 states and 11005 transitions. [2025-03-16 15:14:46,731 INFO L78 Accepts]: Start accepts. Automaton has 10531 states and 11005 transitions. Word has length 1272 [2025-03-16 15:14:46,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:46,732 INFO L471 AbstractCegarLoop]: Abstraction has 10531 states and 11005 transitions. [2025-03-16 15:14:46,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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 15:14:46,732 INFO L276 IsEmpty]: Start isEmpty. Operand 10531 states and 11005 transitions. [2025-03-16 15:14:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1291 [2025-03-16 15:14:46,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:46,748 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:46,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:14:46,748 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:46,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:46,749 INFO L85 PathProgramCache]: Analyzing trace with hash 243531279, now seen corresponding path program 1 times [2025-03-16 15:14:46,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:46,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121546090] [2025-03-16 15:14:46,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:46,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:46,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1290 statements into 1 equivalence classes. [2025-03-16 15:14:46,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1290 of 1290 statements. [2025-03-16 15:14:46,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:46,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2975 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 2647 trivial. 0 not checked. [2025-03-16 15:14:47,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:47,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121546090] [2025-03-16 15:14:47,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121546090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:47,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:47,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 15:14:47,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659429002] [2025-03-16 15:14:47,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:47,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:14:47,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:47,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:14:47,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:14:47,754 INFO L87 Difference]: Start difference. First operand 10531 states and 11005 transitions. Second operand has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 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 15:14:48,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:48,498 INFO L93 Difference]: Finished difference Result 20462 states and 21393 transitions. [2025-03-16 15:14:48,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 15:14:48,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 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 1290 [2025-03-16 15:14:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:48,517 INFO L225 Difference]: With dead ends: 20462 [2025-03-16 15:14:48,518 INFO L226 Difference]: Without dead ends: 10202 [2025-03-16 15:14:48,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:14:48,528 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 22 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:48,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 461 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:14:48,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10202 states. [2025-03-16 15:14:48,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10202 to 10202. [2025-03-16 15:14:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10202 states, 10201 states have (on average 1.0443093814331927) internal successors, (10653), 10201 states have internal predecessors, (10653), 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 15:14:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10202 states to 10202 states and 10653 transitions. [2025-03-16 15:14:48,613 INFO L78 Accepts]: Start accepts. Automaton has 10202 states and 10653 transitions. Word has length 1290 [2025-03-16 15:14:48,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:48,614 INFO L471 AbstractCegarLoop]: Abstraction has 10202 states and 10653 transitions. [2025-03-16 15:14:48,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 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 15:14:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 10202 states and 10653 transitions. [2025-03-16 15:14:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1468 [2025-03-16 15:14:48,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:48,630 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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 15:14:48,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:14:48,631 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:48,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:48,631 INFO L85 PathProgramCache]: Analyzing trace with hash -587071417, now seen corresponding path program 1 times [2025-03-16 15:14:48,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:48,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262385323] [2025-03-16 15:14:48,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:48,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:48,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1467 statements into 1 equivalence classes. [2025-03-16 15:14:48,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1467 of 1467 statements. [2025-03-16 15:14:48,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:48,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3727 backedges. 2675 proven. 0 refuted. 0 times theorem prover too weak. 1052 trivial. 0 not checked. [2025-03-16 15:14:49,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:49,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262385323] [2025-03-16 15:14:49,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262385323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:49,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:49,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:14:49,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703456879] [2025-03-16 15:14:49,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:49,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:14:49,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:49,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:14:49,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:14:49,918 INFO L87 Difference]: Start difference. First operand 10202 states and 10653 transitions. Second operand has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 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 15:14:50,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:50,784 INFO L93 Difference]: Finished difference Result 20082 states and 20982 transitions. [2025-03-16 15:14:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:14:50,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 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 1467 [2025-03-16 15:14:50,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:50,798 INFO L225 Difference]: With dead ends: 20082 [2025-03-16 15:14:50,798 INFO L226 Difference]: Without dead ends: 10210 [2025-03-16 15:14:50,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:14:50,806 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 217 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:50,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 438 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:14:50,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10210 states. [2025-03-16 15:14:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10210 to 10202. [2025-03-16 15:14:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10202 states, 10201 states have (on average 1.0439172630134301) internal successors, (10649), 10201 states have internal predecessors, (10649), 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 15:14:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10202 states to 10202 states and 10649 transitions. [2025-03-16 15:14:50,940 INFO L78 Accepts]: Start accepts. Automaton has 10202 states and 10649 transitions. Word has length 1467 [2025-03-16 15:14:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:50,941 INFO L471 AbstractCegarLoop]: Abstraction has 10202 states and 10649 transitions. [2025-03-16 15:14:50,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 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 15:14:50,942 INFO L276 IsEmpty]: Start isEmpty. Operand 10202 states and 10649 transitions. [2025-03-16 15:14:50,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1543 [2025-03-16 15:14:50,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:50,973 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:50,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:14:50,973 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:50,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:50,974 INFO L85 PathProgramCache]: Analyzing trace with hash -294398636, now seen corresponding path program 1 times [2025-03-16 15:14:50,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:50,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911344602] [2025-03-16 15:14:50,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:50,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:51,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1542 statements into 1 equivalence classes. [2025-03-16 15:14:51,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1542 of 1542 statements. [2025-03-16 15:14:51,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:51,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4121 backedges. 1590 proven. 1203 refuted. 0 times theorem prover too weak. 1328 trivial. 0 not checked. [2025-03-16 15:14:52,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:52,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911344602] [2025-03-16 15:14:52,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911344602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:14:52,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712861116] [2025-03-16 15:14:52,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:52,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:14:52,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:14:52,505 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 15:14:52,509 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 15:14:52,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1542 statements into 1 equivalence classes. [2025-03-16 15:14:52,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1542 of 1542 statements. [2025-03-16 15:14:52,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:52,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:52,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 1779 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:14:52,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:14:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4121 backedges. 2376 proven. 0 refuted. 0 times theorem prover too weak. 1745 trivial. 0 not checked. [2025-03-16 15:14:53,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:14:53,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712861116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:53,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:14:53,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:14:53,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080313004] [2025-03-16 15:14:53,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:53,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:53,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:53,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:53,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:14:53,712 INFO L87 Difference]: Start difference. First operand 10202 states and 10649 transitions. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 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 15:14:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:54,334 INFO L93 Difference]: Finished difference Result 20072 states and 20965 transitions. [2025-03-16 15:14:54,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:54,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 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 1542 [2025-03-16 15:14:54,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:54,336 INFO L225 Difference]: With dead ends: 20072 [2025-03-16 15:14:54,336 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:14:54,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1546 GetRequests, 1542 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:14:54,344 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 33 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:54,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 372 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:14:54,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:14:54,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:14:54,345 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 15:14:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:14:54,345 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1542 [2025-03-16 15:14:54,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:54,345 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:14:54,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 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 15:14:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:14:54,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:14:54,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:14:54,355 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 15:14:54,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 15:14:54,551 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:14:54,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:14:54,781 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:14:54,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:14:54 BoogieIcfgContainer [2025-03-16 15:14:54,791 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:14:54,792 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:14:54,792 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:14:54,792 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:14:54,793 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:14:32" (3/4) ... [2025-03-16 15:14:54,794 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:14:54,819 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-16 15:14:54,821 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:14:54,822 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:14:54,823 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:14:54,949 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:14:54,949 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:14:54,949 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:14:54,950 INFO L158 Benchmark]: Toolchain (without parser) took 25156.44ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 118.3MB in the beginning and 390.0MB in the end (delta: -271.7MB). Peak memory consumption was 655.3MB. Max. memory is 16.1GB. [2025-03-16 15:14:54,950 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:14:54,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.17ms. Allocated memory is still 167.8MB. Free memory was 118.3MB in the beginning and 60.7MB in the end (delta: 57.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-16 15:14:54,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.81ms. Allocated memory is still 167.8MB. Free memory was 60.7MB in the beginning and 37.7MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 15:14:54,950 INFO L158 Benchmark]: Boogie Preprocessor took 197.38ms. Allocated memory is still 167.8MB. Free memory was 37.7MB in the beginning and 78.8MB in the end (delta: -41.1MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2025-03-16 15:14:54,951 INFO L158 Benchmark]: IcfgBuilder took 1847.94ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 78.8MB in the beginning and 273.4MB in the end (delta: -194.6MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2025-03-16 15:14:54,951 INFO L158 Benchmark]: TraceAbstraction took 22302.33ms. Allocated memory was 402.7MB in the beginning and 1.1GB in the end (delta: 687.9MB). Free memory was 272.1MB in the beginning and 411.0MB in the end (delta: -138.9MB). Peak memory consumption was 543.1MB. Max. memory is 16.1GB. [2025-03-16 15:14:54,951 INFO L158 Benchmark]: Witness Printer took 157.26ms. Allocated memory is still 1.1GB. Free memory was 411.0MB in the beginning and 390.0MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 15:14:54,952 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.14ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.17ms. Allocated memory is still 167.8MB. Free memory was 118.3MB in the beginning and 60.7MB in the end (delta: 57.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.81ms. Allocated memory is still 167.8MB. Free memory was 60.7MB in the beginning and 37.7MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 197.38ms. Allocated memory is still 167.8MB. Free memory was 37.7MB in the beginning and 78.8MB in the end (delta: -41.1MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1847.94ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 78.8MB in the beginning and 273.4MB in the end (delta: -194.6MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22302.33ms. Allocated memory was 402.7MB in the beginning and 1.1GB in the end (delta: 687.9MB). Free memory was 272.1MB in the beginning and 411.0MB in the end (delta: -138.9MB). Peak memory consumption was 543.1MB. Max. memory is 16.1GB. * Witness Printer took 157.26ms. Allocated memory is still 1.1GB. Free memory was 411.0MB in the beginning and 390.0MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. 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: 164]: 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, 335 locations, 661 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.0s, OverallIterations: 13, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3360 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3360 mSDsluCounter, 4090 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 1977 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11587 IncrementalHoareTripleChecker+Invalid, 13564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1977 mSolverCounterUnsat, 4001 mSDtfsCounter, 11587 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1585 GetRequests, 1563 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10531occurred in iteration=10, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 2969 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 10470 NumberOfCodeBlocks, 10470 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 10456 ConstructedInterpolants, 0 QuantifiedInterpolants, 24002 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1779 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 21796/22999 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1783]: Location Invariant Derived location invariant: (((((((a12 == 6) && (a16 <= 11)) || ((a16 != 10) && (a15 <= 3))) || (((a12 <= 5) && (a16 <= 11)) && (4 <= a15))) || ((0 <= ((long long) 87 + a18)) && (a15 <= 3))) || ((a12 == 8) && (a15 == 3))) || ((a16 != 10) && (a16 <= 11))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:14:54,968 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