./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20b89f8a60d2f6d2584628c0d5624c8090542a805d1f710cb23a05b88ce8a600 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:52:27,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:52:27,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:52:27,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:52:27,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:52:27,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:52:27,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:52:27,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:52:27,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:52:27,880 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:52:27,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:52:27,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:52:27,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:52:27,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:52:27,881 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:52:27,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:52:27,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:52:27,882 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:52:27,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:52:27,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:52:27,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:52:27,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:52:27,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:52:27,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:52:27,883 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:52:27,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:52:27,883 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:52:27,883 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:52:27,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:52:27,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:52:27,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:52:27,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:52:27,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:52:27,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:52:27,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:52:27,884 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:52:27,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:52:27,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:52:27,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:52:27,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:52:27,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:52:27,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:52:27,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:52:27,885 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20b89f8a60d2f6d2584628c0d5624c8090542a805d1f710cb23a05b88ce8a600 [2025-02-05 21:52:28,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:52:28,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:52:28,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:52:28,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:52:28,107 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:52:28,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i [2025-02-05 21:52:29,288 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d86e993d/cca8e930e9ac4110b13845024e50e171/FLAG93be1de5e [2025-02-05 21:52:29,568 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:52:29,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i [2025-02-05 21:52:29,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d86e993d/cca8e930e9ac4110b13845024e50e171/FLAG93be1de5e [2025-02-05 21:52:29,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d86e993d/cca8e930e9ac4110b13845024e50e171 [2025-02-05 21:52:29,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:52:29,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:52:29,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:52:29,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:52:29,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:52:29,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:52:29" (1/1) ... [2025-02-05 21:52:29,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1574222b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:29, skipping insertion in model container [2025-02-05 21:52:29,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:52:29" (1/1) ... [2025-02-05 21:52:29,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:52:30,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i[915,928] [2025-02-05 21:52:30,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:52:30,160 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:52:30,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i[915,928] [2025-02-05 21:52:30,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:52:30,223 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:52:30,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:30 WrapperNode [2025-02-05 21:52:30,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:52:30,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:52:30,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:52:30,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:52:30,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:30" (1/1) ... [2025-02-05 21:52:30,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:30" (1/1) ... [2025-02-05 21:52:30,272 INFO L138 Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2025-02-05 21:52:30,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:52:30,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:52:30,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:52:30,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:52:30,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:30" (1/1) ... [2025-02-05 21:52:30,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:30" (1/1) ... [2025-02-05 21:52:30,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:30" (1/1) ... [2025-02-05 21:52:30,308 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-02-05 21:52:30,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:30" (1/1) ... [2025-02-05 21:52:30,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:30" (1/1) ... [2025-02-05 21:52:30,321 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:30" (1/1) ... [2025-02-05 21:52:30,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:30" (1/1) ... [2025-02-05 21:52:30,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:30" (1/1) ... [2025-02-05 21:52:30,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:30" (1/1) ... [2025-02-05 21:52:30,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:52:30,333 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:52:30,333 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:52:30,333 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:52:30,333 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:30" (1/1) ... [2025-02-05 21:52:30,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:52:30,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:52:30,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:52:30,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:52:30,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:52:30,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:52:30,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:52:30,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:52:30,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:52:30,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:52:30,434 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:52:30,436 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:52:30,706 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L183: havoc property_#t~bitwise26#1;havoc property_#t~short27#1; [2025-02-05 21:52:30,733 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 21:52:30,733 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:52:30,744 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:52:30,745 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:52:30,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:52:30 BoogieIcfgContainer [2025-02-05 21:52:30,745 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:52:30,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:52:30,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:52:30,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:52:30,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:52:29" (1/3) ... [2025-02-05 21:52:30,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fab9e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:52:30, skipping insertion in model container [2025-02-05 21:52:30,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:30" (2/3) ... [2025-02-05 21:52:30,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fab9e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:52:30, skipping insertion in model container [2025-02-05 21:52:30,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:52:30" (3/3) ... [2025-02-05 21:52:30,752 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-81.i [2025-02-05 21:52:30,764 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:52:30,767 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-81.i that has 2 procedures, 108 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:52:30,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:52:30,827 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;@72492682, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:52:30,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:52:30,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 64 states have (on average 1.375) internal successors, (88), 65 states have internal predecessors, (88), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-05 21:52:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-05 21:52:30,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:52:30,842 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:52:30,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:52:30,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:52:30,847 INFO L85 PathProgramCache]: Analyzing trace with hash 197515483, now seen corresponding path program 1 times [2025-02-05 21:52:30,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:52:30,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380028803] [2025-02-05 21:52:30,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:52:30,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:52:30,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-05 21:52:30,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-05 21:52:30,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:52:30,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:52:31,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 3200 trivial. 0 not checked. [2025-02-05 21:52:31,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:52:31,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380028803] [2025-02-05 21:52:31,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380028803] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:52:31,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512782483] [2025-02-05 21:52:31,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:52:31,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:52:31,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:52:31,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:52:31,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:52:31,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-05 21:52:31,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-05 21:52:31,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:52:31,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:52:31,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:52:31,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:52:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 3200 trivial. 0 not checked. [2025-02-05 21:52:31,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:52:31,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512782483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:52:31,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:52:31,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:52:31,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515585098] [2025-02-05 21:52:31,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:52:31,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:52:31,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:52:31,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:52:31,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:52:31,446 INFO L87 Difference]: Start difference. First operand has 108 states, 64 states have (on average 1.375) internal successors, (88), 65 states have internal predecessors, (88), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2025-02-05 21:52:31,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:52:31,474 INFO L93 Difference]: Finished difference Result 210 states and 376 transitions. [2025-02-05 21:52:31,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:52:31,475 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) Word has length 251 [2025-02-05 21:52:31,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:52:31,480 INFO L225 Difference]: With dead ends: 210 [2025-02-05 21:52:31,480 INFO L226 Difference]: Without dead ends: 105 [2025-02-05 21:52:31,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 252 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-02-05 21:52:31,484 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:52:31,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:52:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-05 21:52:31,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-02-05 21:52:31,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-05 21:52:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 165 transitions. [2025-02-05 21:52:31,513 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 165 transitions. Word has length 251 [2025-02-05 21:52:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:52:31,515 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 165 transitions. [2025-02-05 21:52:31,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2025-02-05 21:52:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 165 transitions. [2025-02-05 21:52:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-05 21:52:31,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:52:31,518 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:52:31,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:52:31,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:52:31,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:52:31,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:52:31,721 INFO L85 PathProgramCache]: Analyzing trace with hash -662108550, now seen corresponding path program 1 times [2025-02-05 21:52:31,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:52:31,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269902266] [2025-02-05 21:52:31,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:52:31,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:52:31,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-05 21:52:31,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-05 21:52:31,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:52:31,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:52:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-02-05 21:52:42,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:52:42,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269902266] [2025-02-05 21:52:42,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269902266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:52:42,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:52:42,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 21:52:42,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300348731] [2025-02-05 21:52:42,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:52:42,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 21:52:42,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:52:42,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 21:52:42,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:52:42,107 INFO L87 Difference]: Start difference. First operand 105 states and 165 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:52:44,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:52:44,024 INFO L93 Difference]: Finished difference Result 292 states and 447 transitions. [2025-02-05 21:52:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 21:52:44,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 251 [2025-02-05 21:52:44,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:52:44,028 INFO L225 Difference]: With dead ends: 292 [2025-02-05 21:52:44,029 INFO L226 Difference]: Without dead ends: 190 [2025-02-05 21:52:44,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:52:44,033 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 396 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:52:44,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 668 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:52:44,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-05 21:52:44,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 118. [2025-02-05 21:52:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 75 states have internal predecessors, (103), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-05 21:52:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 185 transitions. [2025-02-05 21:52:44,054 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 185 transitions. Word has length 251 [2025-02-05 21:52:44,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:52:44,055 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 185 transitions. [2025-02-05 21:52:44,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:52:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 185 transitions. [2025-02-05 21:52:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-05 21:52:44,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:52:44,057 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:52:44,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:52:44,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:52:44,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:52:44,061 INFO L85 PathProgramCache]: Analyzing trace with hash -858622055, now seen corresponding path program 1 times [2025-02-05 21:52:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:52:44,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575136606] [2025-02-05 21:52:44,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:52:44,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:52:44,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-05 21:52:44,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-05 21:52:44,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:52:44,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:52:44,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-02-05 21:52:44,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:52:44,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575136606] [2025-02-05 21:52:44,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575136606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:52:44,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:52:44,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:52:44,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090259003] [2025-02-05 21:52:44,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:52:44,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:52:44,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:52:44,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:52:44,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:52:44,298 INFO L87 Difference]: Start difference. First operand 118 states and 185 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:52:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:52:44,369 INFO L93 Difference]: Finished difference Result 265 states and 411 transitions. [2025-02-05 21:52:44,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:52:44,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 251 [2025-02-05 21:52:44,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:52:44,372 INFO L225 Difference]: With dead ends: 265 [2025-02-05 21:52:44,374 INFO L226 Difference]: Without dead ends: 150 [2025-02-05 21:52:44,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:52:44,375 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 42 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:52:44,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 476 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:52:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-02-05 21:52:44,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2025-02-05 21:52:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 100 states have internal predecessors, (134), 45 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-05 21:52:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 224 transitions. [2025-02-05 21:52:44,395 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 224 transitions. Word has length 251 [2025-02-05 21:52:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:52:44,396 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 224 transitions. [2025-02-05 21:52:44,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:52:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 224 transitions. [2025-02-05 21:52:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-05 21:52:44,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:52:44,401 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:52:44,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:52:44,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:52:44,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:52:44,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1835907387, now seen corresponding path program 1 times [2025-02-05 21:52:44,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:52:44,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506452240] [2025-02-05 21:52:44,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:52:44,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:52:44,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-05 21:52:44,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-05 21:52:44,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:52:44,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:52:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-02-05 21:52:51,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:52:51,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506452240] [2025-02-05 21:52:51,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506452240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:52:51,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:52:51,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:52:51,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516858260] [2025-02-05 21:52:51,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:52:51,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:52:51,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:52:51,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:52:51,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:52:51,070 INFO L87 Difference]: Start difference. First operand 147 states and 224 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:52:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:52:52,447 INFO L93 Difference]: Finished difference Result 331 states and 497 transitions. [2025-02-05 21:52:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:52:52,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 251 [2025-02-05 21:52:52,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:52:52,451 INFO L225 Difference]: With dead ends: 331 [2025-02-05 21:52:52,451 INFO L226 Difference]: Without dead ends: 187 [2025-02-05 21:52:52,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:52:52,452 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 169 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:52:52,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 672 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:52:52,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-05 21:52:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 147. [2025-02-05 21:52:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 100 states have internal predecessors, (134), 45 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-05 21:52:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 224 transitions. [2025-02-05 21:52:52,462 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 224 transitions. Word has length 251 [2025-02-05 21:52:52,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:52:52,463 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 224 transitions. [2025-02-05 21:52:52,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:52:52,463 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 224 transitions. [2025-02-05 21:52:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-05 21:52:52,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:52:52,466 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:52:52,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:52:52,467 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:52:52,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:52:52,467 INFO L85 PathProgramCache]: Analyzing trace with hash -533025831, now seen corresponding path program 1 times [2025-02-05 21:52:52,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:52:52,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059278007] [2025-02-05 21:52:52,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:52:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:52:52,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-05 21:52:52,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-05 21:52:52,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:52:52,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:52:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-02-05 21:52:52,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:52:52,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059278007] [2025-02-05 21:52:52,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059278007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:52:52,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:52:52,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:52:52,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230337535] [2025-02-05 21:52:52,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:52:52,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:52:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:52:52,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:52:52,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:52:52,960 INFO L87 Difference]: Start difference. First operand 147 states and 224 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:52:53,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:52:53,420 INFO L93 Difference]: Finished difference Result 424 states and 651 transitions. [2025-02-05 21:52:53,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:52:53,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 251 [2025-02-05 21:52:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:52:53,425 INFO L225 Difference]: With dead ends: 424 [2025-02-05 21:52:53,425 INFO L226 Difference]: Without dead ends: 280 [2025-02-05 21:52:53,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:52:53,427 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 136 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:52:53,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 656 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:52:53,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-02-05 21:52:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 232. [2025-02-05 21:52:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 142 states have (on average 1.323943661971831) internal successors, (188), 143 states have internal predecessors, (188), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 21:52:53,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions. [2025-02-05 21:52:53,466 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 251 [2025-02-05 21:52:53,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:52:53,466 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 360 transitions. [2025-02-05 21:52:53,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:52:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions. [2025-02-05 21:52:53,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 21:52:53,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:52:53,470 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:52:53,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:52:53,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:52:53,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:52:53,471 INFO L85 PathProgramCache]: Analyzing trace with hash 661926613, now seen corresponding path program 1 times [2025-02-05 21:52:53,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:52:53,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346702273] [2025-02-05 21:52:53,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:52:53,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:52:53,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 21:52:53,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 21:52:53,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:52:53,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:52:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-02-05 21:52:56,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:52:56,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346702273] [2025-02-05 21:52:56,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346702273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:52:56,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:52:56,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:52:56,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151649913] [2025-02-05 21:52:56,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:52:56,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:52:56,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:52:56,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:52:56,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:52:56,725 INFO L87 Difference]: Start difference. First operand 232 states and 360 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:52:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:52:57,739 INFO L93 Difference]: Finished difference Result 576 states and 859 transitions. [2025-02-05 21:52:57,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 21:52:57,740 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 252 [2025-02-05 21:52:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:52:57,742 INFO L225 Difference]: With dead ends: 576 [2025-02-05 21:52:57,742 INFO L226 Difference]: Without dead ends: 432 [2025-02-05 21:52:57,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-02-05 21:52:57,743 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 520 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:52:57,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 853 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:52:57,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-02-05 21:52:57,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 237. [2025-02-05 21:52:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 147 states have (on average 1.3333333333333333) internal successors, (196), 148 states have internal predecessors, (196), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 21:52:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 368 transitions. [2025-02-05 21:52:57,772 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 368 transitions. Word has length 252 [2025-02-05 21:52:57,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:52:57,772 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 368 transitions. [2025-02-05 21:52:57,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:52:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 368 transitions. [2025-02-05 21:52:57,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 21:52:57,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:52:57,775 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:52:57,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:52:57,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:52:57,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:52:57,775 INFO L85 PathProgramCache]: Analyzing trace with hash 465413108, now seen corresponding path program 1 times [2025-02-05 21:52:57,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:52:57,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842598102] [2025-02-05 21:52:57,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:52:57,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:52:57,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 21:52:57,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 21:52:57,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:52:57,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-02-05 21:53:01,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:01,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842598102] [2025-02-05 21:53:01,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842598102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:01,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:01,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 21:53:01,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823441684] [2025-02-05 21:53:01,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:01,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 21:53:01,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:01,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 21:53:01,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:53:01,786 INFO L87 Difference]: Start difference. First operand 237 states and 368 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2025-02-05 21:53:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:03,529 INFO L93 Difference]: Finished difference Result 544 states and 815 transitions. [2025-02-05 21:53:03,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:53:03,529 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) Word has length 252 [2025-02-05 21:53:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:03,531 INFO L225 Difference]: With dead ends: 544 [2025-02-05 21:53:03,531 INFO L226 Difference]: Without dead ends: 400 [2025-02-05 21:53:03,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2025-02-05 21:53:03,532 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 396 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:03,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1164 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 21:53:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-02-05 21:53:03,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 245. [2025-02-05 21:53:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 155 states have (on average 1.335483870967742) internal successors, (207), 156 states have internal predecessors, (207), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 21:53:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 379 transitions. [2025-02-05 21:53:03,549 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 379 transitions. Word has length 252 [2025-02-05 21:53:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:03,549 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 379 transitions. [2025-02-05 21:53:03,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2025-02-05 21:53:03,550 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 379 transitions. [2025-02-05 21:53:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 21:53:03,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:03,552 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:53:03,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:53:03,552 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:03,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:03,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1135024746, now seen corresponding path program 1 times [2025-02-05 21:53:03,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:03,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238388972] [2025-02-05 21:53:03,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:03,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:03,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 21:53:03,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 21:53:03,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:03,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-02-05 21:53:08,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:08,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238388972] [2025-02-05 21:53:08,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238388972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:08,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:08,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 21:53:08,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901500607] [2025-02-05 21:53:08,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:08,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 21:53:08,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:08,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 21:53:08,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:53:08,022 INFO L87 Difference]: Start difference. First operand 245 states and 379 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:53:09,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:09,352 INFO L93 Difference]: Finished difference Result 539 states and 808 transitions. [2025-02-05 21:53:09,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 21:53:09,353 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 252 [2025-02-05 21:53:09,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:09,358 INFO L225 Difference]: With dead ends: 539 [2025-02-05 21:53:09,358 INFO L226 Difference]: Without dead ends: 395 [2025-02-05 21:53:09,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-02-05 21:53:09,360 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 415 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:09,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 849 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:53:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-02-05 21:53:09,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 246. [2025-02-05 21:53:09,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 156 states have (on average 1.3397435897435896) internal successors, (209), 157 states have internal predecessors, (209), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 21:53:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 381 transitions. [2025-02-05 21:53:09,381 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 381 transitions. Word has length 252 [2025-02-05 21:53:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:09,382 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 381 transitions. [2025-02-05 21:53:09,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:53:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 381 transitions. [2025-02-05 21:53:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 21:53:09,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:09,383 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:53:09,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:53:09,383 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:09,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:09,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1331538251, now seen corresponding path program 1 times [2025-02-05 21:53:09,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:09,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417261634] [2025-02-05 21:53:09,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:09,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:09,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 21:53:09,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 21:53:09,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:09,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-02-05 21:53:13,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:13,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417261634] [2025-02-05 21:53:13,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417261634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:13,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:13,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 21:53:13,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179549972] [2025-02-05 21:53:13,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:13,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 21:53:13,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:13,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 21:53:13,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:53:13,664 INFO L87 Difference]: Start difference. First operand 246 states and 381 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2025-02-05 21:53:15,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:15,205 INFO L93 Difference]: Finished difference Result 516 states and 776 transitions. [2025-02-05 21:53:15,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 21:53:15,205 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) Word has length 252 [2025-02-05 21:53:15,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:15,208 INFO L225 Difference]: With dead ends: 516 [2025-02-05 21:53:15,208 INFO L226 Difference]: Without dead ends: 372 [2025-02-05 21:53:15,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-02-05 21:53:15,210 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 387 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:15,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 837 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:53:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-02-05 21:53:15,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 245. [2025-02-05 21:53:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 155 states have (on average 1.335483870967742) internal successors, (207), 156 states have internal predecessors, (207), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 21:53:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 379 transitions. [2025-02-05 21:53:15,231 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 379 transitions. Word has length 252 [2025-02-05 21:53:15,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:15,231 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 379 transitions. [2025-02-05 21:53:15,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2025-02-05 21:53:15,232 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 379 transitions. [2025-02-05 21:53:15,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 21:53:15,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:15,233 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:53:15,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:53:15,233 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:15,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:15,233 INFO L85 PathProgramCache]: Analyzing trace with hash 156367988, now seen corresponding path program 1 times [2025-02-05 21:53:15,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:15,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957309647] [2025-02-05 21:53:15,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:15,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:15,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 21:53:15,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 21:53:15,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:15,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-02-05 21:53:19,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:19,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957309647] [2025-02-05 21:53:19,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957309647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:19,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:19,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:53:19,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897110656] [2025-02-05 21:53:19,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:19,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:53:19,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:19,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:53:19,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:53:19,315 INFO L87 Difference]: Start difference. First operand 245 states and 379 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:53:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:20,119 INFO L93 Difference]: Finished difference Result 538 states and 808 transitions. [2025-02-05 21:53:20,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:53:20,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 252 [2025-02-05 21:53:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:20,122 INFO L225 Difference]: With dead ends: 538 [2025-02-05 21:53:20,122 INFO L226 Difference]: Without dead ends: 394 [2025-02-05 21:53:20,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:53:20,123 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 235 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:20,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 789 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:53:20,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-02-05 21:53:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 252. [2025-02-05 21:53:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 162 states have (on average 1.345679012345679) internal successors, (218), 163 states have internal predecessors, (218), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 21:53:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 390 transitions. [2025-02-05 21:53:20,143 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 390 transitions. Word has length 252 [2025-02-05 21:53:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:20,143 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 390 transitions. [2025-02-05 21:53:20,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:53:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 390 transitions. [2025-02-05 21:53:20,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 21:53:20,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:20,145 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:53:20,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:53:20,145 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:20,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:20,145 INFO L85 PathProgramCache]: Analyzing trace with hash -40145517, now seen corresponding path program 1 times [2025-02-05 21:53:20,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:20,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397049264] [2025-02-05 21:53:20,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:20,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:20,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 21:53:20,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 21:53:20,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:20,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-02-05 21:53:20,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:20,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397049264] [2025-02-05 21:53:20,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397049264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:20,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:20,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:53:20,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331732967] [2025-02-05 21:53:20,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:20,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:53:20,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:20,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:53:20,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:53:20,764 INFO L87 Difference]: Start difference. First operand 252 states and 390 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:53:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:21,499 INFO L93 Difference]: Finished difference Result 501 states and 756 transitions. [2025-02-05 21:53:21,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 21:53:21,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 252 [2025-02-05 21:53:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:21,502 INFO L225 Difference]: With dead ends: 501 [2025-02-05 21:53:21,502 INFO L226 Difference]: Without dead ends: 352 [2025-02-05 21:53:21,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:53:21,504 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 276 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:21,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 627 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:53:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-05 21:53:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 253. [2025-02-05 21:53:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 163 states have (on average 1.3496932515337423) internal successors, (220), 164 states have internal predecessors, (220), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 21:53:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 392 transitions. [2025-02-05 21:53:21,525 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 392 transitions. Word has length 252 [2025-02-05 21:53:21,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:21,525 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 392 transitions. [2025-02-05 21:53:21,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:53:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 392 transitions. [2025-02-05 21:53:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 21:53:21,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:21,527 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:53:21,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:53:21,527 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:21,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:21,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1640583371, now seen corresponding path program 1 times [2025-02-05 21:53:21,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:21,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183417095] [2025-02-05 21:53:21,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:21,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:21,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 21:53:21,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 21:53:21,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:21,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-02-05 21:53:24,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:24,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183417095] [2025-02-05 21:53:24,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183417095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:24,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:24,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:53:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944572521] [2025-02-05 21:53:24,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:24,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:53:24,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:24,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:53:24,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:53:24,956 INFO L87 Difference]: Start difference. First operand 253 states and 392 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:53:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:25,332 INFO L93 Difference]: Finished difference Result 491 states and 745 transitions. [2025-02-05 21:53:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:53:25,332 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 252 [2025-02-05 21:53:25,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:25,336 INFO L225 Difference]: With dead ends: 491 [2025-02-05 21:53:25,336 INFO L226 Difference]: Without dead ends: 342 [2025-02-05 21:53:25,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:53:25,337 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 299 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:25,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 573 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:53:25,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-02-05 21:53:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 250. [2025-02-05 21:53:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 160 states have (on average 1.35) internal successors, (216), 161 states have internal predecessors, (216), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 21:53:25,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 388 transitions. [2025-02-05 21:53:25,360 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 388 transitions. Word has length 252 [2025-02-05 21:53:25,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:25,360 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 388 transitions. [2025-02-05 21:53:25,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:53:25,360 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 388 transitions. [2025-02-05 21:53:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 21:53:25,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:25,362 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:53:25,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:53:25,363 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:25,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:25,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2125488874, now seen corresponding path program 1 times [2025-02-05 21:53:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:25,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143251267] [2025-02-05 21:53:25,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:25,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:25,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 21:53:25,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 21:53:25,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:25,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-02-05 21:53:25,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:25,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143251267] [2025-02-05 21:53:25,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143251267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:25,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:25,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:53:25,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052236175] [2025-02-05 21:53:25,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:25,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:53:25,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:25,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:53:25,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:53:25,508 INFO L87 Difference]: Start difference. First operand 250 states and 388 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:53:25,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:25,593 INFO L93 Difference]: Finished difference Result 430 states and 655 transitions. [2025-02-05 21:53:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:53:25,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 252 [2025-02-05 21:53:25,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:25,596 INFO L225 Difference]: With dead ends: 430 [2025-02-05 21:53:25,596 INFO L226 Difference]: Without dead ends: 281 [2025-02-05 21:53:25,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:53:25,596 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 61 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:25,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 481 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:53:25,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-05 21:53:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 237. [2025-02-05 21:53:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 150 states have (on average 1.3466666666666667) internal successors, (202), 150 states have internal predecessors, (202), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 21:53:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 366 transitions. [2025-02-05 21:53:25,617 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 366 transitions. Word has length 252 [2025-02-05 21:53:25,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:25,617 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 366 transitions. [2025-02-05 21:53:25,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:53:25,618 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 366 transitions. [2025-02-05 21:53:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 21:53:25,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:25,619 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:53:25,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:53:25,619 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:25,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1972964917, now seen corresponding path program 1 times [2025-02-05 21:53:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:25,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244619738] [2025-02-05 21:53:25,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:25,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:25,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 21:53:25,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 21:53:25,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:25,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-02-05 21:53:31,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:31,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244619738] [2025-02-05 21:53:31,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244619738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:31,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:31,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 21:53:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870348144] [2025-02-05 21:53:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:31,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 21:53:31,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:31,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 21:53:31,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:53:31,155 INFO L87 Difference]: Start difference. First operand 237 states and 366 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-02-05 21:53:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:32,899 INFO L93 Difference]: Finished difference Result 456 states and 684 transitions. [2025-02-05 21:53:32,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 21:53:32,899 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 252 [2025-02-05 21:53:32,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:32,901 INFO L225 Difference]: With dead ends: 456 [2025-02-05 21:53:32,901 INFO L226 Difference]: Without dead ends: 322 [2025-02-05 21:53:32,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2025-02-05 21:53:32,902 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 389 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:32,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 934 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:53:32,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-02-05 21:53:32,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 241. [2025-02-05 21:53:32,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 154 states have (on average 1.344155844155844) internal successors, (207), 154 states have internal predecessors, (207), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 21:53:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 371 transitions. [2025-02-05 21:53:32,920 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 371 transitions. Word has length 252 [2025-02-05 21:53:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:32,921 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 371 transitions. [2025-02-05 21:53:32,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-02-05 21:53:32,921 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 371 transitions. [2025-02-05 21:53:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 21:53:32,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:32,922 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:53:32,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:53:32,922 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:32,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:32,922 INFO L85 PathProgramCache]: Analyzing trace with hash 176013558, now seen corresponding path program 1 times [2025-02-05 21:53:32,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:32,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460077985] [2025-02-05 21:53:32,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:32,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:32,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 21:53:32,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 21:53:32,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:32,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2025-02-05 21:53:38,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:38,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460077985] [2025-02-05 21:53:38,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460077985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:38,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:38,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 21:53:38,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068347633] [2025-02-05 21:53:38,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:38,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 21:53:38,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:38,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 21:53:38,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:53:38,526 INFO L87 Difference]: Start difference. First operand 241 states and 371 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:53:39,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:39,282 INFO L93 Difference]: Finished difference Result 423 states and 642 transitions. [2025-02-05 21:53:39,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 21:53:39,283 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 252 [2025-02-05 21:53:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:39,286 INFO L225 Difference]: With dead ends: 423 [2025-02-05 21:53:39,286 INFO L226 Difference]: Without dead ends: 289 [2025-02-05 21:53:39,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:53:39,289 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 136 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:39,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 609 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:53:39,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-05 21:53:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 239. [2025-02-05 21:53:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 152 states have internal predecessors, (205), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 21:53:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 369 transitions. [2025-02-05 21:53:39,323 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 369 transitions. Word has length 252 [2025-02-05 21:53:39,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:39,324 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 369 transitions. [2025-02-05 21:53:39,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-02-05 21:53:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 369 transitions. [2025-02-05 21:53:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-05 21:53:39,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:39,325 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:53:39,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 21:53:39,325 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:39,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:39,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1457555976, now seen corresponding path program 1 times [2025-02-05 21:53:39,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:39,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343111326] [2025-02-05 21:53:39,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:39,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:39,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-05 21:53:39,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-05 21:53:39,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:39,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat