./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-11.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-11.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 47bbd7236274baed537e0bb85bffcf0820cc528026bb65d5e6c5429266d51874 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:54:40,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:54:40,553 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:54:40,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:54:40,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:54:40,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:54:40,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:54:40,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:54:40,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:54:40,583 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:54:40,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:54:40,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:54:40,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:54:40,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:54:40,584 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:54:40,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:54:40,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:54:40,585 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:54:40,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:54:40,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:54:40,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:54:40,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:54:40,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:54:40,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:54:40,585 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:54:40,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:54:40,585 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:54:40,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:54:40,586 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:54:40,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:54:40,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:54:40,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:54:40,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:54:40,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:54:40,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:54:40,586 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:54:40,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:54:40,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:54:40,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:54:40,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:54:40,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:54:40,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:54:40,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:54:40,586 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 -> 47bbd7236274baed537e0bb85bffcf0820cc528026bb65d5e6c5429266d51874 [2025-02-05 21:54:40,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:54:40,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:54:40,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:54:40,890 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:54:40,891 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:54:40,892 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-11.i [2025-02-05 21:54:41,993 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a32ac5a8/c54839021d9e4799adcd78c6bb9d2af3/FLAGed6107351 [2025-02-05 21:54:42,315 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:54:42,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-11.i [2025-02-05 21:54:42,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a32ac5a8/c54839021d9e4799adcd78c6bb9d2af3/FLAGed6107351 [2025-02-05 21:54:42,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a32ac5a8/c54839021d9e4799adcd78c6bb9d2af3 [2025-02-05 21:54:42,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:54:42,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:54:42,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:54:42,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:54:42,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:54:42,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:54:42" (1/1) ... [2025-02-05 21:54:42,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@589f9d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:42, skipping insertion in model container [2025-02-05 21:54:42,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:54:42" (1/1) ... [2025-02-05 21:54:42,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:54:42,716 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-11.i[916,929] [2025-02-05 21:54:42,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:54:42,856 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:54:42,869 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-11.i[916,929] [2025-02-05 21:54:42,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:54:42,962 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:54:42,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:42 WrapperNode [2025-02-05 21:54:42,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:54:42,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:54:42,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:54:42,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:54:42,970 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:54:42" (1/1) ... [2025-02-05 21:54:42,989 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:54:42" (1/1) ... [2025-02-05 21:54:43,052 INFO L138 Inliner]: procedures = 26, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 840 [2025-02-05 21:54:43,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:54:43,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:54:43,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:54:43,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:54:43,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:42" (1/1) ... [2025-02-05 21:54:43,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:42" (1/1) ... [2025-02-05 21:54:43,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:42" (1/1) ... [2025-02-05 21:54:43,109 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:54:43,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:42" (1/1) ... [2025-02-05 21:54:43,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:42" (1/1) ... [2025-02-05 21:54:43,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:42" (1/1) ... [2025-02-05 21:54:43,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:42" (1/1) ... [2025-02-05 21:54:43,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:42" (1/1) ... [2025-02-05 21:54:43,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:42" (1/1) ... [2025-02-05 21:54:43,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:54:43,162 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:54:43,162 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:54:43,162 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:54:43,164 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:42" (1/1) ... [2025-02-05 21:54:43,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:54:43,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:54:43,195 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:54:43,197 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:54:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:54:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:54:43,216 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:54:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:54:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:54:43,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:54:43,349 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:54:43,350 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:54:44,337 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-05 21:54:44,337 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:54:44,367 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:54:44,368 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:54:44,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:54:44 BoogieIcfgContainer [2025-02-05 21:54:44,368 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:54:44,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:54:44,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:54:44,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:54:44,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:54:42" (1/3) ... [2025-02-05 21:54:44,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ab19d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:54:44, skipping insertion in model container [2025-02-05 21:54:44,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:54:42" (2/3) ... [2025-02-05 21:54:44,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ab19d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:54:44, skipping insertion in model container [2025-02-05 21:54:44,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:54:44" (3/3) ... [2025-02-05 21:54:44,379 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-11.i [2025-02-05 21:54:44,390 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:54:44,392 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-11.i that has 2 procedures, 357 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:54:44,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:54:44,449 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;@2ca85b4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:54:44,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:54:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 357 states, 238 states have (on average 1.5756302521008403) internal successors, (375), 239 states have internal predecessors, (375), 116 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2025-02-05 21:54:44,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2025-02-05 21:54:44,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:44,496 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:44,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:44,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:44,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1528477130, now seen corresponding path program 1 times [2025-02-05 21:54:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:44,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458492447] [2025-02-05 21:54:44,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:44,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:44,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 726 statements into 1 equivalence classes. [2025-02-05 21:54:44,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 726 of 726 statements. [2025-02-05 21:54:44,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:44,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 26450 trivial. 0 not checked. [2025-02-05 21:54:45,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:45,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458492447] [2025-02-05 21:54:45,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458492447] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:54:45,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662066179] [2025-02-05 21:54:45,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:45,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:54:45,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:54:45,121 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:54:45,123 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:54:45,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 726 statements into 1 equivalence classes. [2025-02-05 21:54:45,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 726 of 726 statements. [2025-02-05 21:54:45,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:45,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:45,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:54:45,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:54:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 26450 trivial. 0 not checked. [2025-02-05 21:54:45,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:54:45,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662066179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:45,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:54:45,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:54:45,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462927615] [2025-02-05 21:54:45,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:45,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:54:45,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:45,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:54:45,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:54:45,572 INFO L87 Difference]: Start difference. First operand has 357 states, 238 states have (on average 1.5756302521008403) internal successors, (375), 239 states have internal predecessors, (375), 116 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) Second operand has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 2 states have call successors, (116), 2 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 2 states have call successors, (116) [2025-02-05 21:54:45,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:45,647 INFO L93 Difference]: Finished difference Result 708 states and 1325 transitions. [2025-02-05 21:54:45,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:54:45,649 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 2 states have call successors, (116), 2 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 2 states have call successors, (116) Word has length 726 [2025-02-05 21:54:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:45,659 INFO L225 Difference]: With dead ends: 708 [2025-02-05 21:54:45,659 INFO L226 Difference]: Without dead ends: 354 [2025-02-05 21:54:45,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 727 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:54:45,668 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:45,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 587 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:54:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-02-05 21:54:45,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-02-05 21:54:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 236 states have (on average 1.555084745762712) internal successors, (367), 236 states have internal predecessors, (367), 116 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2025-02-05 21:54:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 599 transitions. [2025-02-05 21:54:45,739 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 599 transitions. Word has length 726 [2025-02-05 21:54:45,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:45,739 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 599 transitions. [2025-02-05 21:54:45,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 2 states have call successors, (116), 2 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 2 states have call successors, (116) [2025-02-05 21:54:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 599 transitions. [2025-02-05 21:54:45,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2025-02-05 21:54:45,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:45,756 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:45,767 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:54:45,961 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:54:45,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:45,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:45,963 INFO L85 PathProgramCache]: Analyzing trace with hash 79493160, now seen corresponding path program 1 times [2025-02-05 21:54:45,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:45,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117016950] [2025-02-05 21:54:45,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:45,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:46,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 726 statements into 1 equivalence classes. [2025-02-05 21:54:46,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 726 of 726 statements. [2025-02-05 21:54:46,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:46,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:54:46,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:46,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117016950] [2025-02-05 21:54:46,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117016950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:46,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:46,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:54:46,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253648312] [2025-02-05 21:54:46,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:46,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:54:46,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:46,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:54:46,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:54:46,673 INFO L87 Difference]: Start difference. First operand 354 states and 599 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:54:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:46,797 INFO L93 Difference]: Finished difference Result 910 states and 1546 transitions. [2025-02-05 21:54:46,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:54:46,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 726 [2025-02-05 21:54:46,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:46,808 INFO L225 Difference]: With dead ends: 910 [2025-02-05 21:54:46,808 INFO L226 Difference]: Without dead ends: 559 [2025-02-05 21:54:46,810 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:54:46,811 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 374 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:46,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1313 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:54:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-02-05 21:54:46,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 556. [2025-02-05 21:54:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 399 states have (on average 1.5964912280701755) internal successors, (637), 400 states have internal predecessors, (637), 154 states have call successors, (154), 2 states have call predecessors, (154), 2 states have return successors, (154), 153 states have call predecessors, (154), 154 states have call successors, (154) [2025-02-05 21:54:46,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 945 transitions. [2025-02-05 21:54:46,878 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 945 transitions. Word has length 726 [2025-02-05 21:54:46,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:46,881 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 945 transitions. [2025-02-05 21:54:46,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:54:46,882 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 945 transitions. [2025-02-05 21:54:46,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2025-02-05 21:54:46,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:46,901 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:46,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:54:46,901 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:46,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:46,902 INFO L85 PathProgramCache]: Analyzing trace with hash -876028119, now seen corresponding path program 1 times [2025-02-05 21:54:46,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:46,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873100516] [2025-02-05 21:54:46,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:46,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:46,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 726 statements into 1 equivalence classes. [2025-02-05 21:54:47,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 726 of 726 statements. [2025-02-05 21:54:47,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:47,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:54:47,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:47,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873100516] [2025-02-05 21:54:47,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873100516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:47,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:47,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:54:47,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045218805] [2025-02-05 21:54:47,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:47,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:54:47,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:47,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:54:47,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:54:47,303 INFO L87 Difference]: Start difference. First operand 556 states and 945 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:54:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:47,410 INFO L93 Difference]: Finished difference Result 1439 states and 2427 transitions. [2025-02-05 21:54:47,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:54:47,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 726 [2025-02-05 21:54:47,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:47,423 INFO L225 Difference]: With dead ends: 1439 [2025-02-05 21:54:47,423 INFO L226 Difference]: Without dead ends: 886 [2025-02-05 21:54:47,425 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:54:47,425 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 326 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:47,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1154 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:54:47,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-02-05 21:54:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 883. [2025-02-05 21:54:47,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 604 states have (on average 1.544701986754967) internal successors, (933), 607 states have internal predecessors, (933), 274 states have call successors, (274), 4 states have call predecessors, (274), 4 states have return successors, (274), 271 states have call predecessors, (274), 274 states have call successors, (274) [2025-02-05 21:54:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1481 transitions. [2025-02-05 21:54:47,525 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1481 transitions. Word has length 726 [2025-02-05 21:54:47,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:47,527 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1481 transitions. [2025-02-05 21:54:47,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:54:47,527 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1481 transitions. [2025-02-05 21:54:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2025-02-05 21:54:47,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:47,533 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:47,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:54:47,533 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:47,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:47,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1798711702, now seen corresponding path program 1 times [2025-02-05 21:54:47,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:47,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794172839] [2025-02-05 21:54:47,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:47,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:47,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 726 statements into 1 equivalence classes. [2025-02-05 21:54:47,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 726 of 726 statements. [2025-02-05 21:54:47,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:47,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:54:47,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:47,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794172839] [2025-02-05 21:54:47,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794172839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:47,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:47,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:54:47,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913791964] [2025-02-05 21:54:47,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:47,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:54:47,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:47,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:54:47,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:54:47,924 INFO L87 Difference]: Start difference. First operand 883 states and 1481 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:54:48,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:48,025 INFO L93 Difference]: Finished difference Result 1775 states and 2968 transitions. [2025-02-05 21:54:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:54:48,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 726 [2025-02-05 21:54:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:48,032 INFO L225 Difference]: With dead ends: 1775 [2025-02-05 21:54:48,032 INFO L226 Difference]: Without dead ends: 895 [2025-02-05 21:54:48,035 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:54:48,036 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 300 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:48,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1255 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:54:48,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-02-05 21:54:48,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 701. [2025-02-05 21:54:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 498 states have (on average 1.5823293172690762) internal successors, (788), 499 states have internal predecessors, (788), 198 states have call successors, (198), 4 states have call predecessors, (198), 4 states have return successors, (198), 197 states have call predecessors, (198), 198 states have call successors, (198) [2025-02-05 21:54:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1184 transitions. [2025-02-05 21:54:48,078 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1184 transitions. Word has length 726 [2025-02-05 21:54:48,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:48,079 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 1184 transitions. [2025-02-05 21:54:48,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:54:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1184 transitions. [2025-02-05 21:54:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2025-02-05 21:54:48,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:48,085 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:48,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:54:48,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:48,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:48,086 INFO L85 PathProgramCache]: Analyzing trace with hash 419046251, now seen corresponding path program 1 times [2025-02-05 21:54:48,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:48,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636767400] [2025-02-05 21:54:48,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:48,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:48,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 726 statements into 1 equivalence classes. [2025-02-05 21:54:48,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 726 of 726 statements. [2025-02-05 21:54:48,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:48,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:54:48,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:48,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636767400] [2025-02-05 21:54:48,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636767400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:48,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:48,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:54:48,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669834023] [2025-02-05 21:54:48,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:48,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:54:48,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:48,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:54:48,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:54:48,639 INFO L87 Difference]: Start difference. First operand 701 states and 1184 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:54:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:49,111 INFO L93 Difference]: Finished difference Result 1869 states and 3168 transitions. [2025-02-05 21:54:49,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:54:49,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 726 [2025-02-05 21:54:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:49,123 INFO L225 Difference]: With dead ends: 1869 [2025-02-05 21:54:49,124 INFO L226 Difference]: Without dead ends: 1171 [2025-02-05 21:54:49,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:54:49,127 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 1031 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:49,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 1541 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:54:49,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2025-02-05 21:54:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1135. [2025-02-05 21:54:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 894 states have (on average 1.6442953020134228) internal successors, (1470), 897 states have internal predecessors, (1470), 232 states have call successors, (232), 8 states have call predecessors, (232), 8 states have return successors, (232), 229 states have call predecessors, (232), 232 states have call successors, (232) [2025-02-05 21:54:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1934 transitions. [2025-02-05 21:54:49,205 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1934 transitions. Word has length 726 [2025-02-05 21:54:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:49,206 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1934 transitions. [2025-02-05 21:54:49,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:54:49,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1934 transitions. [2025-02-05 21:54:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2025-02-05 21:54:49,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:49,213 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:49,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:54:49,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:49,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:49,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1006320497, now seen corresponding path program 1 times [2025-02-05 21:54:49,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:49,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209462802] [2025-02-05 21:54:49,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:49,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:49,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-02-05 21:54:49,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-02-05 21:54:49,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:49,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:54:49,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:49,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209462802] [2025-02-05 21:54:49,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209462802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:49,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:49,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:54:49,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402125518] [2025-02-05 21:54:49,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:49,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:54:49,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:49,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:54:49,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:54:49,770 INFO L87 Difference]: Start difference. First operand 1135 states and 1934 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:54:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:49,893 INFO L93 Difference]: Finished difference Result 3399 states and 5796 transitions. [2025-02-05 21:54:49,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:54:49,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 727 [2025-02-05 21:54:49,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:49,906 INFO L225 Difference]: With dead ends: 3399 [2025-02-05 21:54:49,907 INFO L226 Difference]: Without dead ends: 2267 [2025-02-05 21:54:49,911 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:54:49,912 INFO L435 NwaCegarLoop]: 1093 mSDtfsCounter, 583 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:49,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1675 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:54:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2025-02-05 21:54:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1259. [2025-02-05 21:54:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1018 states have (on average 1.6601178781925343) internal successors, (1690), 1021 states have internal predecessors, (1690), 232 states have call successors, (232), 8 states have call predecessors, (232), 8 states have return successors, (232), 229 states have call predecessors, (232), 232 states have call successors, (232) [2025-02-05 21:54:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 2154 transitions. [2025-02-05 21:54:50,011 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 2154 transitions. Word has length 727 [2025-02-05 21:54:50,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:50,014 INFO L471 AbstractCegarLoop]: Abstraction has 1259 states and 2154 transitions. [2025-02-05 21:54:50,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:54:50,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2154 transitions. [2025-02-05 21:54:50,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2025-02-05 21:54:50,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:50,020 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:50,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:54:50,020 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:50,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:50,021 INFO L85 PathProgramCache]: Analyzing trace with hash 939313744, now seen corresponding path program 1 times [2025-02-05 21:54:50,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:50,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2692022] [2025-02-05 21:54:50,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:50,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:50,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-02-05 21:54:50,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-02-05 21:54:50,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:50,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:54:50,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:50,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2692022] [2025-02-05 21:54:50,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2692022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:50,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:50,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:54:50,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488673724] [2025-02-05 21:54:50,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:50,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:54:50,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:50,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:54:50,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:54:50,483 INFO L87 Difference]: Start difference. First operand 1259 states and 2154 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:54:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:50,606 INFO L93 Difference]: Finished difference Result 3771 states and 6456 transitions. [2025-02-05 21:54:50,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:54:50,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 727 [2025-02-05 21:54:50,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:50,621 INFO L225 Difference]: With dead ends: 3771 [2025-02-05 21:54:50,621 INFO L226 Difference]: Without dead ends: 2515 [2025-02-05 21:54:50,625 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:54:50,626 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 352 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:50,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1167 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:54:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2025-02-05 21:54:50,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2513. [2025-02-05 21:54:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2032 states have (on average 1.6594488188976377) internal successors, (3372), 2038 states have internal predecessors, (3372), 464 states have call successors, (464), 16 states have call predecessors, (464), 16 states have return successors, (464), 458 states have call predecessors, (464), 464 states have call successors, (464) [2025-02-05 21:54:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 4300 transitions. [2025-02-05 21:54:50,766 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 4300 transitions. Word has length 727 [2025-02-05 21:54:50,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:50,767 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 4300 transitions. [2025-02-05 21:54:50,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:54:50,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 4300 transitions. [2025-02-05 21:54:50,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2025-02-05 21:54:50,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:50,773 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:50,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:54:50,774 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:50,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:50,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1936386097, now seen corresponding path program 1 times [2025-02-05 21:54:50,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:50,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994327216] [2025-02-05 21:54:50,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:50,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:50,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-02-05 21:54:50,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-02-05 21:54:50,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:50,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:54:51,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:51,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994327216] [2025-02-05 21:54:51,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994327216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:51,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:51,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:54:51,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89523031] [2025-02-05 21:54:51,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:51,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:54:51,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:51,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:54:51,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:54:51,926 INFO L87 Difference]: Start difference. First operand 2513 states and 4300 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:54:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:52,062 INFO L93 Difference]: Finished difference Result 5105 states and 8710 transitions. [2025-02-05 21:54:52,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:54:52,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 727 [2025-02-05 21:54:52,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:52,082 INFO L225 Difference]: With dead ends: 5105 [2025-02-05 21:54:52,082 INFO L226 Difference]: Without dead ends: 2595 [2025-02-05 21:54:52,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:54:52,089 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 42 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:52,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1167 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:54:52,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2025-02-05 21:54:52,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2545. [2025-02-05 21:54:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2064 states have (on average 1.6569767441860466) internal successors, (3420), 2070 states have internal predecessors, (3420), 464 states have call successors, (464), 16 states have call predecessors, (464), 16 states have return successors, (464), 458 states have call predecessors, (464), 464 states have call successors, (464) [2025-02-05 21:54:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4348 transitions. [2025-02-05 21:54:52,235 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4348 transitions. Word has length 727 [2025-02-05 21:54:52,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:52,236 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 4348 transitions. [2025-02-05 21:54:52,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:54:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4348 transitions. [2025-02-05 21:54:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2025-02-05 21:54:52,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:52,242 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:52,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:54:52,243 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:52,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:52,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1937309618, now seen corresponding path program 1 times [2025-02-05 21:54:52,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:52,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824933406] [2025-02-05 21:54:52,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:52,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:52,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-02-05 21:54:52,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-02-05 21:54:52,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:52,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:54:52,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:52,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824933406] [2025-02-05 21:54:52,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824933406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:52,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:52,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:54:52,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974260533] [2025-02-05 21:54:52,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:52,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:54:52,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:52,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:54:52,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:54:52,953 INFO L87 Difference]: Start difference. First operand 2545 states and 4348 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:54:53,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:53,795 INFO L93 Difference]: Finished difference Result 6306 states and 10774 transitions. [2025-02-05 21:54:53,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:54:53,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 727 [2025-02-05 21:54:53,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:53,815 INFO L225 Difference]: With dead ends: 6306 [2025-02-05 21:54:53,815 INFO L226 Difference]: Without dead ends: 3764 [2025-02-05 21:54:53,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:54:53,824 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 576 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:53,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 2086 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:54:53,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2025-02-05 21:54:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3602. [2025-02-05 21:54:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3602 states, 3000 states have (on average 1.6706666666666667) internal successors, (5012), 3006 states have internal predecessors, (5012), 580 states have call successors, (580), 21 states have call predecessors, (580), 21 states have return successors, (580), 574 states have call predecessors, (580), 580 states have call successors, (580) [2025-02-05 21:54:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3602 states to 3602 states and 6172 transitions. [2025-02-05 21:54:54,072 INFO L78 Accepts]: Start accepts. Automaton has 3602 states and 6172 transitions. Word has length 727 [2025-02-05 21:54:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:54,073 INFO L471 AbstractCegarLoop]: Abstraction has 3602 states and 6172 transitions. [2025-02-05 21:54:54,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:54:54,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3602 states and 6172 transitions. [2025-02-05 21:54:54,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-02-05 21:54:54,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:54,089 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:54,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:54:54,090 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:54,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:54,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2120483602, now seen corresponding path program 1 times [2025-02-05 21:54:54,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:54,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054056542] [2025-02-05 21:54:54,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:54,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:54,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-02-05 21:54:54,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-02-05 21:54:54,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:54,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:54:56,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:56,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054056542] [2025-02-05 21:54:56,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054056542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:56,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:56,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:54:56,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537056346] [2025-02-05 21:54:56,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:56,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:54:56,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:56,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:54:56,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:54:56,299 INFO L87 Difference]: Start difference. First operand 3602 states and 6172 transitions. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:55:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:00,320 INFO L93 Difference]: Finished difference Result 16436 states and 28153 transitions. [2025-02-05 21:55:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 21:55:00,321 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 728 [2025-02-05 21:55:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:00,385 INFO L225 Difference]: With dead ends: 16436 [2025-02-05 21:55:00,386 INFO L226 Difference]: Without dead ends: 13234 [2025-02-05 21:55:00,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2025-02-05 21:55:00,400 INFO L435 NwaCegarLoop]: 1719 mSDtfsCounter, 5129 mSDsluCounter, 8109 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 799 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5129 SdHoareTripleChecker+Valid, 9828 SdHoareTripleChecker+Invalid, 2359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 799 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:00,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5129 Valid, 9828 Invalid, 2359 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [799 Valid, 1560 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 21:55:00,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13234 states. [2025-02-05 21:55:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13234 to 4536. [2025-02-05 21:55:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4536 states, 3590 states have (on average 1.622284122562674) internal successors, (5824), 3594 states have internal predecessors, (5824), 908 states have call successors, (908), 37 states have call predecessors, (908), 37 states have return successors, (908), 904 states have call predecessors, (908), 908 states have call successors, (908) [2025-02-05 21:55:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 7640 transitions. [2025-02-05 21:55:00,831 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 7640 transitions. Word has length 728 [2025-02-05 21:55:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:00,832 INFO L471 AbstractCegarLoop]: Abstraction has 4536 states and 7640 transitions. [2025-02-05 21:55:00,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:55:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 7640 transitions. [2025-02-05 21:55:00,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-02-05 21:55:00,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:00,838 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:00,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:55:00,839 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:00,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash -77402892, now seen corresponding path program 1 times [2025-02-05 21:55:00,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:00,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578744267] [2025-02-05 21:55:00,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:00,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-02-05 21:55:01,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-02-05 21:55:01,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:01,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:55:01,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:01,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578744267] [2025-02-05 21:55:01,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578744267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:01,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:01,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:55:01,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893352761] [2025-02-05 21:55:01,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:01,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:55:01,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:01,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:55:01,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:55:01,480 INFO L87 Difference]: Start difference. First operand 4536 states and 7640 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:55:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:02,174 INFO L93 Difference]: Finished difference Result 12194 states and 19967 transitions. [2025-02-05 21:55:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:55:02,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 728 [2025-02-05 21:55:02,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:02,205 INFO L225 Difference]: With dead ends: 12194 [2025-02-05 21:55:02,205 INFO L226 Difference]: Without dead ends: 8548 [2025-02-05 21:55:02,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:55:02,218 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 559 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:02,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 2063 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:55:02,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8548 states. [2025-02-05 21:55:02,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8548 to 7020. [2025-02-05 21:55:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7020 states, 5378 states have (on average 1.5582000743770918) internal successors, (8380), 5390 states have internal predecessors, (8380), 1572 states have call successors, (1572), 69 states have call predecessors, (1572), 69 states have return successors, (1572), 1560 states have call predecessors, (1572), 1572 states have call successors, (1572) [2025-02-05 21:55:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7020 states to 7020 states and 11524 transitions. [2025-02-05 21:55:02,724 INFO L78 Accepts]: Start accepts. Automaton has 7020 states and 11524 transitions. Word has length 728 [2025-02-05 21:55:02,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:02,725 INFO L471 AbstractCegarLoop]: Abstraction has 7020 states and 11524 transitions. [2025-02-05 21:55:02,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:55:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 7020 states and 11524 transitions. [2025-02-05 21:55:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-02-05 21:55:02,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:02,731 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:02,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:55:02,732 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:02,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:02,732 INFO L85 PathProgramCache]: Analyzing trace with hash 133948021, now seen corresponding path program 1 times [2025-02-05 21:55:02,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:02,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145780930] [2025-02-05 21:55:02,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:02,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:02,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-02-05 21:55:02,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-02-05 21:55:02,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:02,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:55:04,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:04,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145780930] [2025-02-05 21:55:04,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145780930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:04,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:04,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 21:55:04,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600208178] [2025-02-05 21:55:04,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:04,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 21:55:04,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:04,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 21:55:04,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:55:04,904 INFO L87 Difference]: Start difference. First operand 7020 states and 11524 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:55:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:12,868 INFO L93 Difference]: Finished difference Result 55907 states and 92137 transitions. [2025-02-05 21:55:12,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-05 21:55:12,869 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 728 [2025-02-05 21:55:12,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:13,027 INFO L225 Difference]: With dead ends: 55907 [2025-02-05 21:55:13,027 INFO L226 Difference]: Without dead ends: 49653 [2025-02-05 21:55:13,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=295, Invalid=761, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 21:55:13,053 INFO L435 NwaCegarLoop]: 2098 mSDtfsCounter, 6345 mSDsluCounter, 11058 mSDsCounter, 0 mSdLazyCounter, 3269 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6345 SdHoareTripleChecker+Valid, 13156 SdHoareTripleChecker+Invalid, 4138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 3269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:13,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6345 Valid, 13156 Invalid, 4138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [869 Valid, 3269 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-05 21:55:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49653 states. [2025-02-05 21:55:14,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49653 to 7175. [2025-02-05 21:55:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7175 states, 5533 states have (on average 1.5635279233688777) internal successors, (8651), 5545 states have internal predecessors, (8651), 1572 states have call successors, (1572), 69 states have call predecessors, (1572), 69 states have return successors, (1572), 1560 states have call predecessors, (1572), 1572 states have call successors, (1572) [2025-02-05 21:55:14,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7175 states to 7175 states and 11795 transitions. [2025-02-05 21:55:14,379 INFO L78 Accepts]: Start accepts. Automaton has 7175 states and 11795 transitions. Word has length 728 [2025-02-05 21:55:14,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:14,380 INFO L471 AbstractCegarLoop]: Abstraction has 7175 states and 11795 transitions. [2025-02-05 21:55:14,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:55:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 11795 transitions. [2025-02-05 21:55:14,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-02-05 21:55:14,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:14,387 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:14,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:55:14,387 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:14,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:14,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1536565548, now seen corresponding path program 1 times [2025-02-05 21:55:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:14,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158381398] [2025-02-05 21:55:14,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:14,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:14,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-02-05 21:55:14,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-02-05 21:55:14,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:14,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:43,595 WARN L286 SmtUtils]: Spent 10.88s on a formula simplification. DAG size of input: 38 DAG size of output: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-05 21:55:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:55:43,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:43,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158381398] [2025-02-05 21:55:43,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158381398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:43,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:43,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 21:55:43,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496201303] [2025-02-05 21:55:43,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:43,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 21:55:43,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:43,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 21:55:43,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:55:43,923 INFO L87 Difference]: Start difference. First operand 7175 states and 11795 transitions. Second operand has 13 states, 13 states have (on average 11.615384615384615) internal successors, (151), 13 states have internal predecessors, (151), 2 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) [2025-02-05 21:55:51,966 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-05 21:56:01,432 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)