./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-42.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-500_file-42.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 747883b17e6817a37cce043de685bd7a3db8df180c0d456a62fc3a4b558b3195 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:57:52,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:57:52,422 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:57:52,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:57:52,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:57:52,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:57:52,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:57:52,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:57:52,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:57:52,441 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:57:52,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:57:52,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:57:52,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:57:52,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:57:52,442 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:57:52,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:57:52,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:57:52,442 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:57:52,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:57:52,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:57:52,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:57:52,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:57:52,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:57:52,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:57:52,443 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:57:52,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:57:52,443 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:57:52,443 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:57:52,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:57:52,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:57:52,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:57:52,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:57:52,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:57:52,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:57:52,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:57:52,444 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:57:52,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:57:52,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:57:52,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:57:52,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:57:52,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:57:52,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:57:52,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:57:52,445 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 -> 747883b17e6817a37cce043de685bd7a3db8df180c0d456a62fc3a4b558b3195 [2025-02-05 21:57:52,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:57:52,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:57:52,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:57:52,632 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:57:52,632 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:57:52,632 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-500_file-42.i [2025-02-05 21:57:53,739 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f9f464e9/5ae7d7a96a1c48e68605b88f5f64c612/FLAGcf47fd279 [2025-02-05 21:57:54,048 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:57:54,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-42.i [2025-02-05 21:57:54,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f9f464e9/5ae7d7a96a1c48e68605b88f5f64c612/FLAGcf47fd279 [2025-02-05 21:57:54,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f9f464e9/5ae7d7a96a1c48e68605b88f5f64c612 [2025-02-05 21:57:54,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:57:54,333 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:57:54,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:57:54,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:57:54,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:57:54,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:57:54" (1/1) ... [2025-02-05 21:57:54,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2035306c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:54, skipping insertion in model container [2025-02-05 21:57:54,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:57:54" (1/1) ... [2025-02-05 21:57:54,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:57:54,462 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-500_file-42.i[916,929] [2025-02-05 21:57:54,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:57:54,649 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:57:54,660 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-500_file-42.i[916,929] [2025-02-05 21:57:54,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:57:54,741 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:57:54,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:54 WrapperNode [2025-02-05 21:57:54,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:57:54,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:57:54,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:57:54,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:57:54,748 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:57:54" (1/1) ... [2025-02-05 21:57:54,771 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:57:54" (1/1) ... [2025-02-05 21:57:54,830 INFO L138 Inliner]: procedures = 26, calls = 119, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 892 [2025-02-05 21:57:54,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:57:54,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:57:54,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:57:54,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:57:54,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:54" (1/1) ... [2025-02-05 21:57:54,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:54" (1/1) ... [2025-02-05 21:57:54,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:54" (1/1) ... [2025-02-05 21:57:54,896 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:57:54,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:54" (1/1) ... [2025-02-05 21:57:54,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:54" (1/1) ... [2025-02-05 21:57:54,927 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:54" (1/1) ... [2025-02-05 21:57:54,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:54" (1/1) ... [2025-02-05 21:57:54,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:54" (1/1) ... [2025-02-05 21:57:54,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:54" (1/1) ... [2025-02-05 21:57:54,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:57:54,962 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:57:54,963 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:57:54,963 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:57:54,963 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:54" (1/1) ... [2025-02-05 21:57:54,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:57:54,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:57:54,988 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:57:54,992 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:57:55,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:57:55,007 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:57:55,007 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:57:55,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:57:55,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:57:55,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:57:55,128 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:57:55,129 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:57:56,225 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-02-05 21:57:56,225 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:57:56,256 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:57:56,256 INFO L337 CfgBuilder]: Removed 5 assume(true) statements. [2025-02-05 21:57:56,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:57:56 BoogieIcfgContainer [2025-02-05 21:57:56,257 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:57:56,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:57:56,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:57:56,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:57:56,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:57:54" (1/3) ... [2025-02-05 21:57:56,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35009fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:57:56, skipping insertion in model container [2025-02-05 21:57:56,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:54" (2/3) ... [2025-02-05 21:57:56,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35009fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:57:56, skipping insertion in model container [2025-02-05 21:57:56,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:57:56" (3/3) ... [2025-02-05 21:57:56,262 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-42.i [2025-02-05 21:57:56,271 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:57:56,273 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-42.i that has 2 procedures, 366 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:57:56,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:57:56,317 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;@a9913a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:57:56,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:57:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 366 states, 257 states have (on average 1.5992217898832686) internal successors, (411), 258 states have internal predecessors, (411), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-05 21:57:56,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-02-05 21:57:56,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:56,341 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:56,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:56,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:56,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1381135772, now seen corresponding path program 1 times [2025-02-05 21:57:56,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:56,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80517463] [2025-02-05 21:57:56,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:56,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:56,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-02-05 21:57:56,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-02-05 21:57:56,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:56,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 22050 trivial. 0 not checked. [2025-02-05 21:57:56,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:56,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80517463] [2025-02-05 21:57:56,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80517463] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:57:56,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934421582] [2025-02-05 21:57:56,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:56,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:57:56,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:57:56,912 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:57:56,913 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:57:57,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-02-05 21:57:57,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-02-05 21:57:57,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:57,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:57,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 1574 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:57:57,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:57:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 22050 trivial. 0 not checked. [2025-02-05 21:57:57,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:57:57,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934421582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:57,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:57:57,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:57:57,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639660611] [2025-02-05 21:57:57,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:57,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:57:57,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:57,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:57:57,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:57:57,369 INFO L87 Difference]: Start difference. First operand has 366 states, 257 states have (on average 1.5992217898832686) internal successors, (411), 258 states have internal predecessors, (411), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) Second operand has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (106), 2 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 2 states have call successors, (106) [2025-02-05 21:57:57,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:57,440 INFO L93 Difference]: Finished difference Result 721 states and 1339 transitions. [2025-02-05 21:57:57,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:57:57,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (106), 2 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 2 states have call successors, (106) Word has length 685 [2025-02-05 21:57:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:57,452 INFO L225 Difference]: With dead ends: 721 [2025-02-05 21:57:57,452 INFO L226 Difference]: Without dead ends: 358 [2025-02-05 21:57:57,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 686 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:57:57,459 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:57,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 587 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:57:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-05 21:57:57,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-02-05 21:57:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 250 states have (on average 1.576) internal successors, (394), 250 states have internal predecessors, (394), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-05 21:57:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 606 transitions. [2025-02-05 21:57:57,535 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 606 transitions. Word has length 685 [2025-02-05 21:57:57,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:57,537 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 606 transitions. [2025-02-05 21:57:57,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (106), 2 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 2 states have call successors, (106) [2025-02-05 21:57:57,538 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 606 transitions. [2025-02-05 21:57:57,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2025-02-05 21:57:57,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:57,553 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:57,562 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:57:57,758 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:57:57,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:57,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:57,760 INFO L85 PathProgramCache]: Analyzing trace with hash 864403879, now seen corresponding path program 1 times [2025-02-05 21:57:57,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:57,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797537782] [2025-02-05 21:57:57,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:57,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:57,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 686 statements into 1 equivalence classes. [2025-02-05 21:57:57,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 686 of 686 statements. [2025-02-05 21:57:57,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:57,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:57:58,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:58,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797537782] [2025-02-05 21:57:58,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797537782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:58,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:58,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:57:58,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608481362] [2025-02-05 21:57:58,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:58,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:57:58,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:58,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:57:58,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:58,460 INFO L87 Difference]: Start difference. First operand 358 states and 606 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:57:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:58,575 INFO L93 Difference]: Finished difference Result 921 states and 1568 transitions. [2025-02-05 21:57:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:57:58,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 686 [2025-02-05 21:57:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:58,585 INFO L225 Difference]: With dead ends: 921 [2025-02-05 21:57:58,585 INFO L226 Difference]: Without dead ends: 566 [2025-02-05 21:57:58,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:58,587 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 315 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:58,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1201 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:57:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-02-05 21:57:58,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 563. [2025-02-05 21:57:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 436 states have (on average 1.6330275229357798) internal successors, (712), 437 states have internal predecessors, (712), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 123 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-05 21:57:58,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 960 transitions. [2025-02-05 21:57:58,650 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 960 transitions. Word has length 686 [2025-02-05 21:57:58,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:58,651 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 960 transitions. [2025-02-05 21:57:58,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:57:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 960 transitions. [2025-02-05 21:57:58,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2025-02-05 21:57:58,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:58,665 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:58,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:57:58,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:58,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:58,671 INFO L85 PathProgramCache]: Analyzing trace with hash -318943418, now seen corresponding path program 1 times [2025-02-05 21:57:58,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:58,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586664928] [2025-02-05 21:57:58,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:58,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:58,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 686 statements into 1 equivalence classes. [2025-02-05 21:57:58,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 686 of 686 statements. [2025-02-05 21:57:58,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:58,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:57:58,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:58,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586664928] [2025-02-05 21:57:58,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586664928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:58,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:58,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:57:58,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723871117] [2025-02-05 21:57:58,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:58,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:57:58,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:58,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:57:58,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:58,962 INFO L87 Difference]: Start difference. First operand 563 states and 960 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:57:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:59,093 INFO L93 Difference]: Finished difference Result 1673 states and 2854 transitions. [2025-02-05 21:57:59,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:57:59,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 686 [2025-02-05 21:57:59,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:59,101 INFO L225 Difference]: With dead ends: 1673 [2025-02-05 21:57:59,101 INFO L226 Difference]: Without dead ends: 1113 [2025-02-05 21:57:59,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:59,103 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 568 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:59,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1530 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:57:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-02-05 21:57:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1111. [2025-02-05 21:57:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 858 states have (on average 1.6142191142191142) internal successors, (1385), 860 states have internal predecessors, (1385), 248 states have call successors, (248), 4 states have call predecessors, (248), 4 states have return successors, (248), 246 states have call predecessors, (248), 248 states have call successors, (248) [2025-02-05 21:57:59,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1881 transitions. [2025-02-05 21:57:59,193 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1881 transitions. Word has length 686 [2025-02-05 21:57:59,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:59,194 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1881 transitions. [2025-02-05 21:57:59,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:57:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1881 transitions. [2025-02-05 21:57:59,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-02-05 21:57:59,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:59,202 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:59,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:57:59,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:59,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:59,203 INFO L85 PathProgramCache]: Analyzing trace with hash -297469519, now seen corresponding path program 1 times [2025-02-05 21:57:59,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:59,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576665166] [2025-02-05 21:57:59,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:59,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:59,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-02-05 21:57:59,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-02-05 21:57:59,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:59,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:57:59,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:59,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576665166] [2025-02-05 21:57:59,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576665166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:59,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:59,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:57:59,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757666490] [2025-02-05 21:57:59,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:59,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:57:59,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:59,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:57:59,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:57:59,771 INFO L87 Difference]: Start difference. First operand 1111 states and 1881 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:00,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:00,302 INFO L93 Difference]: Finished difference Result 3715 states and 6278 transitions. [2025-02-05 21:58:00,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:58:00,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 687 [2025-02-05 21:58:00,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:00,315 INFO L225 Difference]: With dead ends: 3715 [2025-02-05 21:58:00,315 INFO L226 Difference]: Without dead ends: 2607 [2025-02-05 21:58:00,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:58:00,319 INFO L435 NwaCegarLoop]: 1019 mSDtfsCounter, 1083 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:00,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 2001 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:58:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2025-02-05 21:58:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 1311. [2025-02-05 21:58:00,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1058 states have (on average 1.6446124763705103) internal successors, (1740), 1060 states have internal predecessors, (1740), 248 states have call successors, (248), 4 states have call predecessors, (248), 4 states have return successors, (248), 246 states have call predecessors, (248), 248 states have call successors, (248) [2025-02-05 21:58:00,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 2236 transitions. [2025-02-05 21:58:00,429 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 2236 transitions. Word has length 687 [2025-02-05 21:58:00,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:00,429 INFO L471 AbstractCegarLoop]: Abstraction has 1311 states and 2236 transitions. [2025-02-05 21:58:00,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 2236 transitions. [2025-02-05 21:58:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-02-05 21:58:00,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:00,434 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:00,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:58:00,434 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:00,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:00,435 INFO L85 PathProgramCache]: Analyzing trace with hash -836445713, now seen corresponding path program 1 times [2025-02-05 21:58:00,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:00,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923867873] [2025-02-05 21:58:00,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:00,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:00,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-02-05 21:58:00,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-02-05 21:58:00,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:00,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:58:00,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:00,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923867873] [2025-02-05 21:58:00,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923867873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:00,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:00,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:58:00,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166525834] [2025-02-05 21:58:00,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:00,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:58:00,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:00,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:58:00,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:00,752 INFO L87 Difference]: Start difference. First operand 1311 states and 2236 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:00,885 INFO L93 Difference]: Finished difference Result 3785 states and 6454 transitions. [2025-02-05 21:58:00,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:58:00,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 687 [2025-02-05 21:58:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:00,896 INFO L225 Difference]: With dead ends: 3785 [2025-02-05 21:58:00,896 INFO L226 Difference]: Without dead ends: 2477 [2025-02-05 21:58:00,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:00,899 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 391 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:00,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1339 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:58:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2025-02-05 21:58:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2287. [2025-02-05 21:58:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2287 states, 1782 states have (on average 1.621212121212121) internal successors, (2889), 1786 states have internal predecessors, (2889), 496 states have call successors, (496), 8 states have call predecessors, (496), 8 states have return successors, (496), 492 states have call predecessors, (496), 496 states have call successors, (496) [2025-02-05 21:58:01,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 3881 transitions. [2025-02-05 21:58:01,068 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 3881 transitions. Word has length 687 [2025-02-05 21:58:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:01,069 INFO L471 AbstractCegarLoop]: Abstraction has 2287 states and 3881 transitions. [2025-02-05 21:58:01,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:01,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 3881 transitions. [2025-02-05 21:58:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-02-05 21:58:01,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:01,074 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:01,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:58:01,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:01,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash 146141904, now seen corresponding path program 1 times [2025-02-05 21:58:01,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:01,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852131362] [2025-02-05 21:58:01,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:01,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:01,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-02-05 21:58:01,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-02-05 21:58:01,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:01,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:58:01,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:01,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852131362] [2025-02-05 21:58:01,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852131362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:01,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:01,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:58:01,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75454528] [2025-02-05 21:58:01,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:01,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:58:01,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:01,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:58:01,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:01,494 INFO L87 Difference]: Start difference. First operand 2287 states and 3881 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:01,629 INFO L93 Difference]: Finished difference Result 5801 states and 9914 transitions. [2025-02-05 21:58:01,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:58:01,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 687 [2025-02-05 21:58:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:01,645 INFO L225 Difference]: With dead ends: 5801 [2025-02-05 21:58:01,645 INFO L226 Difference]: Without dead ends: 3517 [2025-02-05 21:58:01,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:01,651 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 601 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:01,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1166 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:58:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2025-02-05 21:58:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 2287. [2025-02-05 21:58:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2287 states, 1782 states have (on average 1.6189674523007855) internal successors, (2885), 1786 states have internal predecessors, (2885), 496 states have call successors, (496), 8 states have call predecessors, (496), 8 states have return successors, (496), 492 states have call predecessors, (496), 496 states have call successors, (496) [2025-02-05 21:58:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 3877 transitions. [2025-02-05 21:58:01,854 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 3877 transitions. Word has length 687 [2025-02-05 21:58:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:01,855 INFO L471 AbstractCegarLoop]: Abstraction has 2287 states and 3877 transitions. [2025-02-05 21:58:01,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 3877 transitions. [2025-02-05 21:58:01,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-02-05 21:58:01,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:01,863 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:01,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:58:01,864 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:01,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:01,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1891914385, now seen corresponding path program 1 times [2025-02-05 21:58:01,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:01,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841925716] [2025-02-05 21:58:01,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:01,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:01,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-02-05 21:58:01,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-02-05 21:58:01,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:01,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:58:02,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:02,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841925716] [2025-02-05 21:58:02,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841925716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:02,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:02,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:58:02,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426455077] [2025-02-05 21:58:02,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:02,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:58:02,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:02,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:58:02,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:58:02,357 INFO L87 Difference]: Start difference. First operand 2287 states and 3877 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:02,767 INFO L93 Difference]: Finished difference Result 5837 states and 9915 transitions. [2025-02-05 21:58:02,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:58:02,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 687 [2025-02-05 21:58:02,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:02,786 INFO L225 Difference]: With dead ends: 5837 [2025-02-05 21:58:02,786 INFO L226 Difference]: Without dead ends: 3553 [2025-02-05 21:58:02,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:58:02,793 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 634 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:02,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 1743 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:58:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3553 states. [2025-02-05 21:58:03,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3553 to 3399. [2025-02-05 21:58:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3399 states, 2787 states have (on average 1.6462145676354503) internal successors, (4588), 2791 states have internal predecessors, (4588), 602 states have call successors, (602), 9 states have call predecessors, (602), 9 states have return successors, (602), 598 states have call predecessors, (602), 602 states have call successors, (602) [2025-02-05 21:58:03,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 5792 transitions. [2025-02-05 21:58:03,029 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 5792 transitions. Word has length 687 [2025-02-05 21:58:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:03,030 INFO L471 AbstractCegarLoop]: Abstraction has 3399 states and 5792 transitions. [2025-02-05 21:58:03,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 5792 transitions. [2025-02-05 21:58:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-02-05 21:58:03,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:03,035 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:03,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:58:03,035 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:03,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:03,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1029056588, now seen corresponding path program 1 times [2025-02-05 21:58:03,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:03,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141605681] [2025-02-05 21:58:03,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:03,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:03,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-02-05 21:58:03,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-02-05 21:58:03,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:03,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:58:03,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:03,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141605681] [2025-02-05 21:58:03,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141605681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:03,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:03,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:58:03,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254373542] [2025-02-05 21:58:03,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:03,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:58:03,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:03,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:58:03,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:58:03,623 INFO L87 Difference]: Start difference. First operand 3399 states and 5792 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:05,587 INFO L93 Difference]: Finished difference Result 17439 states and 29579 transitions. [2025-02-05 21:58:05,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:58:05,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 688 [2025-02-05 21:58:05,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:05,659 INFO L225 Difference]: With dead ends: 17439 [2025-02-05 21:58:05,659 INFO L226 Difference]: Without dead ends: 14441 [2025-02-05 21:58:05,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:58:05,674 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 2011 mSDsluCounter, 4168 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 5054 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:05,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 5054 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 21:58:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14441 states. [2025-02-05 21:58:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14441 to 10789. [2025-02-05 21:58:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10789 states, 9185 states have (on average 1.6528034839412085) internal successors, (15181), 9209 states have internal predecessors, (15181), 1570 states have call successors, (1570), 33 states have call predecessors, (1570), 33 states have return successors, (1570), 1546 states have call predecessors, (1570), 1570 states have call successors, (1570) [2025-02-05 21:58:06,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10789 states to 10789 states and 18321 transitions. [2025-02-05 21:58:06,293 INFO L78 Accepts]: Start accepts. Automaton has 10789 states and 18321 transitions. Word has length 688 [2025-02-05 21:58:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:06,294 INFO L471 AbstractCegarLoop]: Abstraction has 10789 states and 18321 transitions. [2025-02-05 21:58:06,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 10789 states and 18321 transitions. [2025-02-05 21:58:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-02-05 21:58:06,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:06,301 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:06,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:58:06,302 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:06,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:06,303 INFO L85 PathProgramCache]: Analyzing trace with hash -259886573, now seen corresponding path program 1 times [2025-02-05 21:58:06,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:06,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715895283] [2025-02-05 21:58:06,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:06,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:06,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-02-05 21:58:06,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-02-05 21:58:06,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:06,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:58:06,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:06,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715895283] [2025-02-05 21:58:06,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715895283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:06,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:06,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:58:06,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901394812] [2025-02-05 21:58:06,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:06,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:58:06,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:06,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:58:06,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:58:06,982 INFO L87 Difference]: Start difference. First operand 10789 states and 18321 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:08,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:08,004 INFO L93 Difference]: Finished difference Result 28003 states and 47248 transitions. [2025-02-05 21:58:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:58:08,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 688 [2025-02-05 21:58:08,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:08,078 INFO L225 Difference]: With dead ends: 28003 [2025-02-05 21:58:08,079 INFO L226 Difference]: Without dead ends: 20069 [2025-02-05 21:58:08,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:58:08,109 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 664 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:08,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 2169 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:58:08,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20069 states. [2025-02-05 21:58:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20069 to 18721. [2025-02-05 21:58:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18721 states, 15621 states have (on average 1.6405479802829523) internal successors, (25627), 15669 states have internal predecessors, (25627), 3034 states have call successors, (3034), 65 states have call predecessors, (3034), 65 states have return successors, (3034), 2986 states have call predecessors, (3034), 3034 states have call successors, (3034) [2025-02-05 21:58:09,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18721 states to 18721 states and 31695 transitions. [2025-02-05 21:58:09,456 INFO L78 Accepts]: Start accepts. Automaton has 18721 states and 31695 transitions. Word has length 688 [2025-02-05 21:58:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:09,457 INFO L471 AbstractCegarLoop]: Abstraction has 18721 states and 31695 transitions. [2025-02-05 21:58:09,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:09,458 INFO L276 IsEmpty]: Start isEmpty. Operand 18721 states and 31695 transitions. [2025-02-05 21:58:09,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-02-05 21:58:09,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:09,466 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:09,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:58:09,467 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:09,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:09,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1247665236, now seen corresponding path program 1 times [2025-02-05 21:58:09,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:09,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363210794] [2025-02-05 21:58:09,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:09,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:09,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-02-05 21:58:09,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-02-05 21:58:09,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:09,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:58:10,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:10,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363210794] [2025-02-05 21:58:10,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363210794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:10,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:10,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:58:10,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209634860] [2025-02-05 21:58:10,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:10,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:58:10,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:10,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:58:10,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:10,008 INFO L87 Difference]: Start difference. First operand 18721 states and 31695 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:10,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:10,444 INFO L93 Difference]: Finished difference Result 34587 states and 58476 transitions. [2025-02-05 21:58:10,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:58:10,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 688 [2025-02-05 21:58:10,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:10,510 INFO L225 Difference]: With dead ends: 34587 [2025-02-05 21:58:10,510 INFO L226 Difference]: Without dead ends: 18721 [2025-02-05 21:58:10,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:10,555 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 0 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:10,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1158 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:58:10,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18721 states. [2025-02-05 21:58:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18721 to 18721. [2025-02-05 21:58:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18721 states, 15621 states have (on average 1.6364509314384483) internal successors, (25563), 15669 states have internal predecessors, (25563), 3034 states have call successors, (3034), 65 states have call predecessors, (3034), 65 states have return successors, (3034), 2986 states have call predecessors, (3034), 3034 states have call successors, (3034) [2025-02-05 21:58:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18721 states to 18721 states and 31631 transitions. [2025-02-05 21:58:11,600 INFO L78 Accepts]: Start accepts. Automaton has 18721 states and 31631 transitions. Word has length 688 [2025-02-05 21:58:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:11,601 INFO L471 AbstractCegarLoop]: Abstraction has 18721 states and 31631 transitions. [2025-02-05 21:58:11,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 18721 states and 31631 transitions. [2025-02-05 21:58:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-02-05 21:58:11,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:11,613 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:11,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:58:11,613 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:11,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:11,614 INFO L85 PathProgramCache]: Analyzing trace with hash -559789227, now seen corresponding path program 1 times [2025-02-05 21:58:11,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:11,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428676738] [2025-02-05 21:58:11,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:11,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:11,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-02-05 21:58:11,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-02-05 21:58:11,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:11,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:58:12,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:12,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428676738] [2025-02-05 21:58:12,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428676738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:12,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:12,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:58:12,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313515920] [2025-02-05 21:58:12,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:12,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:58:12,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:12,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:58:12,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:58:12,457 INFO L87 Difference]: Start difference. First operand 18721 states and 31631 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:15,485 INFO L93 Difference]: Finished difference Result 85059 states and 141995 transitions. [2025-02-05 21:58:15,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:58:15,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 688 [2025-02-05 21:58:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:15,697 INFO L225 Difference]: With dead ends: 85059 [2025-02-05 21:58:15,697 INFO L226 Difference]: Without dead ends: 67993 [2025-02-05 21:58:15,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:58:15,752 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 1596 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 2971 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:15,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 2971 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 21:58:15,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67993 states. [2025-02-05 21:58:19,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67993 to 46843. [2025-02-05 21:58:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46843 states, 38734 states have (on average 1.6171322352455206) internal successors, (62638), 38894 states have internal predecessors, (62638), 7914 states have call successors, (7914), 194 states have call predecessors, (7914), 194 states have return successors, (7914), 7754 states have call predecessors, (7914), 7914 states have call successors, (7914) [2025-02-05 21:58:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46843 states to 46843 states and 78466 transitions. [2025-02-05 21:58:19,641 INFO L78 Accepts]: Start accepts. Automaton has 46843 states and 78466 transitions. Word has length 688 [2025-02-05 21:58:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:19,642 INFO L471 AbstractCegarLoop]: Abstraction has 46843 states and 78466 transitions. [2025-02-05 21:58:19,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 46843 states and 78466 transitions. [2025-02-05 21:58:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-02-05 21:58:19,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:19,658 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:19,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:58:19,659 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:19,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash 573401366, now seen corresponding path program 1 times [2025-02-05 21:58:19,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:19,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909838614] [2025-02-05 21:58:19,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:19,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-02-05 21:58:19,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-02-05 21:58:19,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:19,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:58:21,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:21,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909838614] [2025-02-05 21:58:21,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909838614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:21,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:21,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:58:21,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015637094] [2025-02-05 21:58:21,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:21,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:58:21,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:21,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:58:21,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:58:21,112 INFO L87 Difference]: Start difference. First operand 46843 states and 78466 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:29,138 INFO L93 Difference]: Finished difference Result 198298 states and 328430 transitions. [2025-02-05 21:58:29,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 21:58:29,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 688 [2025-02-05 21:58:29,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:29,677 INFO L225 Difference]: With dead ends: 198298 [2025-02-05 21:58:29,677 INFO L226 Difference]: Without dead ends: 157285 [2025-02-05 21:58:29,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:58:29,833 INFO L435 NwaCegarLoop]: 1099 mSDtfsCounter, 3042 mSDsluCounter, 2922 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 917 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3042 SdHoareTripleChecker+Valid, 4021 SdHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 917 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:29,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3042 Valid, 4021 Invalid, 2199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [917 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 21:58:29,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157285 states. [2025-02-05 21:58:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157285 to 47355. [2025-02-05 21:58:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47355 states, 40206 states have (on average 1.6405511615181814) internal successors, (65960), 40334 states have internal predecessors, (65960), 6970 states have call successors, (6970), 178 states have call predecessors, (6970), 178 states have return successors, (6970), 6842 states have call predecessors, (6970), 6970 states have call successors, (6970) [2025-02-05 21:58:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47355 states to 47355 states and 79900 transitions. [2025-02-05 21:58:35,514 INFO L78 Accepts]: Start accepts. Automaton has 47355 states and 79900 transitions. Word has length 688 [2025-02-05 21:58:35,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:35,515 INFO L471 AbstractCegarLoop]: Abstraction has 47355 states and 79900 transitions. [2025-02-05 21:58:35,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-02-05 21:58:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 47355 states and 79900 transitions. [2025-02-05 21:58:35,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-02-05 21:58:35,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:35,530 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:35,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:58:35,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:35,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:35,531 INFO L85 PathProgramCache]: Analyzing trace with hash 44482327, now seen corresponding path program 1 times [2025-02-05 21:58:35,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:35,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826733457] [2025-02-05 21:58:35,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:35,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:35,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-02-05 21:58:35,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-02-05 21:58:36,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:36,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-02-05 21:58:38,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:38,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826733457] [2025-02-05 21:58:38,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826733457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:38,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:38,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 21:58:38,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787892292] [2025-02-05 21:58:38,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:38,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 21:58:38,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:38,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 21:58:38,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:58:38,567 INFO L87 Difference]: Start difference. First operand 47355 states and 79900 transitions. Second operand has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 3 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 3 states have call predecessors, (106), 3 states have call successors, (106)