./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-31.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-31.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 eef3f12ba451ca840c456da7ee60eaad2b6582b827234fb7a1749b9e80613db0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:56:47,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:56:47,190 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:56:47,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:56:47,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:56:47,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:56:47,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:56:47,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:56:47,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:56:47,207 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:56:47,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:56:47,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:56:47,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:56:47,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:56:47,207 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:56:47,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:56:47,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:56:47,208 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:56:47,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:56:47,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:56:47,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:56:47,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:56:47,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:56:47,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:56:47,208 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:56:47,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:56:47,208 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:56:47,208 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:56:47,208 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:56:47,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:56:47,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:56:47,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:56:47,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:56:47,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:56:47,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:56:47,209 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:56:47,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:56:47,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:56:47,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:56:47,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:56:47,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:56:47,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:56:47,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:56:47,209 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 -> eef3f12ba451ca840c456da7ee60eaad2b6582b827234fb7a1749b9e80613db0 [2025-02-05 21:56:47,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:56:47,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:56:47,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:56:47,392 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:56:47,392 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:56:47,392 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-31.i [2025-02-05 21:56:48,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/418756804/0ec5cd42a3b54317b357e400e0a8df7d/FLAG30a514252 [2025-02-05 21:56:48,831 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:56:48,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-31.i [2025-02-05 21:56:48,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/418756804/0ec5cd42a3b54317b357e400e0a8df7d/FLAG30a514252 [2025-02-05 21:56:49,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/418756804/0ec5cd42a3b54317b357e400e0a8df7d [2025-02-05 21:56:49,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:56:49,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:56:49,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:56:49,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:56:49,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:56:49,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:56:49" (1/1) ... [2025-02-05 21:56:49,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a1a9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:49, skipping insertion in model container [2025-02-05 21:56:49,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:56:49" (1/1) ... [2025-02-05 21:56:49,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:56:49,245 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-31.i[916,929] [2025-02-05 21:56:49,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:56:49,406 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:56:49,420 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-31.i[916,929] [2025-02-05 21:56:49,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:56:49,487 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:56:49,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:49 WrapperNode [2025-02-05 21:56:49,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:56:49,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:56:49,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:56:49,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:56:49,493 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:56:49" (1/1) ... [2025-02-05 21:56:49,507 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:56:49" (1/1) ... [2025-02-05 21:56:49,584 INFO L138 Inliner]: procedures = 26, calls = 104, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 817 [2025-02-05 21:56:49,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:56:49,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:56:49,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:56:49,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:56:49,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:49" (1/1) ... [2025-02-05 21:56:49,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:49" (1/1) ... [2025-02-05 21:56:49,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:49" (1/1) ... [2025-02-05 21:56:49,647 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:56:49,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:49" (1/1) ... [2025-02-05 21:56:49,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:49" (1/1) ... [2025-02-05 21:56:49,678 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:49" (1/1) ... [2025-02-05 21:56:49,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:49" (1/1) ... [2025-02-05 21:56:49,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:49" (1/1) ... [2025-02-05 21:56:49,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:49" (1/1) ... [2025-02-05 21:56:49,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:56:49,719 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:56:49,719 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:56:49,720 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:56:49,720 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:49" (1/1) ... [2025-02-05 21:56:49,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:56:49,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:56:49,751 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:56:49,755 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:56:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:56:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:56:49,775 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:56:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:56:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:56:49,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:56:49,888 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:56:49,890 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:56:50,815 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-02-05 21:56:50,816 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:56:50,851 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:56:50,853 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 21:56:50,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:56:50 BoogieIcfgContainer [2025-02-05 21:56:50,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:56:50,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:56:50,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:56:50,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:56:50,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:56:49" (1/3) ... [2025-02-05 21:56:50,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6135ef63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:56:50, skipping insertion in model container [2025-02-05 21:56:50,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:49" (2/3) ... [2025-02-05 21:56:50,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6135ef63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:56:50, skipping insertion in model container [2025-02-05 21:56:50,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:56:50" (3/3) ... [2025-02-05 21:56:50,863 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-31.i [2025-02-05 21:56:50,875 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:56:50,878 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-31.i that has 2 procedures, 335 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:56:50,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:56:50,944 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;@77c48e2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:56:50,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:56:50,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 335 states, 241 states have (on average 1.6265560165975104) internal successors, (392), 242 states have internal predecessors, (392), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 21:56:50,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-02-05 21:56:50,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:50,978 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:50,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:50,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:50,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1154456069, now seen corresponding path program 1 times [2025-02-05 21:56:50,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961777472] [2025-02-05 21:56:50,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:50,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:51,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-02-05 21:56:51,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-02-05 21:56:51,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:51,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 16200 trivial. 0 not checked. [2025-02-05 21:56:51,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:51,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961777472] [2025-02-05 21:56:51,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961777472] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:56:51,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267614300] [2025-02-05 21:56:51,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:51,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:56:51,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:56:51,593 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:56:51,594 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:56:51,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-02-05 21:56:51,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-02-05 21:56:51,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:51,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:51,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:56:51,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:56:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 16200 trivial. 0 not checked. [2025-02-05 21:56:51,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:56:51,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267614300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:51,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:56:51,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:56:51,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256260063] [2025-02-05 21:56:51,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:51,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:56:51,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:52,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:56:52,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:56:52,008 INFO L87 Difference]: Start difference. First operand has 335 states, 241 states have (on average 1.6265560165975104) internal successors, (392), 242 states have internal predecessors, (392), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) Second operand has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (91), 2 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 2 states have call successors, (91) [2025-02-05 21:56:52,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:52,104 INFO L93 Difference]: Finished difference Result 664 states and 1234 transitions. [2025-02-05 21:56:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:56:52,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (91), 2 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 2 states have call successors, (91) Word has length 596 [2025-02-05 21:56:52,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:52,117 INFO L225 Difference]: With dead ends: 664 [2025-02-05 21:56:52,117 INFO L226 Difference]: Without dead ends: 332 [2025-02-05 21:56:52,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 597 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:56:52,127 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:52,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 543 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:56:52,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-02-05 21:56:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-02-05 21:56:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 239 states have (on average 1.5857740585774058) internal successors, (379), 239 states have internal predecessors, (379), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 21:56:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 561 transitions. [2025-02-05 21:56:52,202 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 561 transitions. Word has length 596 [2025-02-05 21:56:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:52,205 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 561 transitions. [2025-02-05 21:56:52,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (91), 2 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 2 states have call successors, (91) [2025-02-05 21:56:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 561 transitions. [2025-02-05 21:56:52,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-02-05 21:56:52,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:52,216 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:52,225 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:56:52,416 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:56:52,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:52,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:52,419 INFO L85 PathProgramCache]: Analyzing trace with hash -574399511, now seen corresponding path program 1 times [2025-02-05 21:56:52,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:52,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644836806] [2025-02-05 21:56:52,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:52,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:52,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-02-05 21:56:52,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-02-05 21:56:52,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:52,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-05 21:56:53,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:53,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644836806] [2025-02-05 21:56:53,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644836806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:53,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:53,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:53,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904843893] [2025-02-05 21:56:53,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:53,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:53,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:53,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:53,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:53,097 INFO L87 Difference]: Start difference. First operand 332 states and 561 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-05 21:56:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:53,237 INFO L93 Difference]: Finished difference Result 990 states and 1677 transitions. [2025-02-05 21:56:53,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:53,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 597 [2025-02-05 21:56:53,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:53,247 INFO L225 Difference]: With dead ends: 990 [2025-02-05 21:56:53,247 INFO L226 Difference]: Without dead ends: 661 [2025-02-05 21:56:53,248 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:56:53,249 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 395 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:53,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1307 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:53,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-02-05 21:56:53,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 659. [2025-02-05 21:56:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 474 states have (on average 1.5822784810126582) internal successors, (750), 474 states have internal predecessors, (750), 182 states have call successors, (182), 2 states have call predecessors, (182), 2 states have return successors, (182), 182 states have call predecessors, (182), 182 states have call successors, (182) [2025-02-05 21:56:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1114 transitions. [2025-02-05 21:56:53,327 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1114 transitions. Word has length 597 [2025-02-05 21:56:53,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:53,330 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 1114 transitions. [2025-02-05 21:56:53,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-05 21:56:53,330 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1114 transitions. [2025-02-05 21:56:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-02-05 21:56:53,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:53,341 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:53,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:56:53,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:53,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:53,343 INFO L85 PathProgramCache]: Analyzing trace with hash -626698900, now seen corresponding path program 1 times [2025-02-05 21:56:53,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:53,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495379007] [2025-02-05 21:56:53,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:53,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:53,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-02-05 21:56:53,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-02-05 21:56:53,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:53,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-05 21:56:53,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:53,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495379007] [2025-02-05 21:56:53,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495379007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:53,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:53,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:53,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383428789] [2025-02-05 21:56:53,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:53,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:53,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:53,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:53,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:53,653 INFO L87 Difference]: Start difference. First operand 659 states and 1114 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-05 21:56:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:53,755 INFO L93 Difference]: Finished difference Result 1743 states and 2950 transitions. [2025-02-05 21:56:53,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:53,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 599 [2025-02-05 21:56:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:53,761 INFO L225 Difference]: With dead ends: 1743 [2025-02-05 21:56:53,761 INFO L226 Difference]: Without dead ends: 1087 [2025-02-05 21:56:53,763 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:56:53,763 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 351 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:53,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1198 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2025-02-05 21:56:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1083. [2025-02-05 21:56:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 836 states have (on average 1.605263157894737) internal successors, (1342), 838 states have internal predecessors, (1342), 242 states have call successors, (242), 4 states have call predecessors, (242), 4 states have return successors, (242), 240 states have call predecessors, (242), 242 states have call successors, (242) [2025-02-05 21:56:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1826 transitions. [2025-02-05 21:56:53,845 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1826 transitions. Word has length 599 [2025-02-05 21:56:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:53,849 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1826 transitions. [2025-02-05 21:56:53,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-05 21:56:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1826 transitions. [2025-02-05 21:56:53,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-02-05 21:56:53,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:53,857 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:53,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:56:53,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:53,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:53,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1155617939, now seen corresponding path program 1 times [2025-02-05 21:56:53,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:53,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84230156] [2025-02-05 21:56:53,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:53,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:53,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-02-05 21:56:53,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-02-05 21:56:53,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:53,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-05 21:56:54,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:54,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84230156] [2025-02-05 21:56:54,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84230156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:54,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:54,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:54,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774194743] [2025-02-05 21:56:54,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:54,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:54,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:54,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:54,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:54,062 INFO L87 Difference]: Start difference. First operand 1083 states and 1826 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-05 21:56:54,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:54,160 INFO L93 Difference]: Finished difference Result 2177 states and 3662 transitions. [2025-02-05 21:56:54,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:54,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 599 [2025-02-05 21:56:54,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:54,168 INFO L225 Difference]: With dead ends: 2177 [2025-02-05 21:56:54,168 INFO L226 Difference]: Without dead ends: 1097 [2025-02-05 21:56:54,171 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:56:54,171 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 330 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:54,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1096 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2025-02-05 21:56:54,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 941. [2025-02-05 21:56:54,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 754 states have (on average 1.6153846153846154) internal successors, (1218), 754 states have internal predecessors, (1218), 182 states have call successors, (182), 4 states have call predecessors, (182), 4 states have return successors, (182), 182 states have call predecessors, (182), 182 states have call successors, (182) [2025-02-05 21:56:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1582 transitions. [2025-02-05 21:56:54,215 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1582 transitions. Word has length 599 [2025-02-05 21:56:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:54,216 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1582 transitions. [2025-02-05 21:56:54,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-05 21:56:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1582 transitions. [2025-02-05 21:56:54,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-02-05 21:56:54,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:54,220 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:54,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:56:54,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:54,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:54,221 INFO L85 PathProgramCache]: Analyzing trace with hash -703726897, now seen corresponding path program 1 times [2025-02-05 21:56:54,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:54,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106209438] [2025-02-05 21:56:54,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:54,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:54,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-02-05 21:56:54,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-02-05 21:56:54,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:54,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-05 21:56:54,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:54,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106209438] [2025-02-05 21:56:54,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106209438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:54,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:54,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:54,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663100367] [2025-02-05 21:56:54,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:54,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:54,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:54,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:54,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:54,424 INFO L87 Difference]: Start difference. First operand 941 states and 1582 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-05 21:56:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:54,524 INFO L93 Difference]: Finished difference Result 2597 states and 4382 transitions. [2025-02-05 21:56:54,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:54,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 599 [2025-02-05 21:56:54,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:54,532 INFO L225 Difference]: With dead ends: 2597 [2025-02-05 21:56:54,532 INFO L226 Difference]: Without dead ends: 1659 [2025-02-05 21:56:54,533 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:56:54,534 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 319 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:54,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1053 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:54,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2025-02-05 21:56:54,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1655. [2025-02-05 21:56:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1410 states have (on average 1.6340425531914893) internal successors, (2304), 1412 states have internal predecessors, (2304), 238 states have call successors, (238), 6 states have call predecessors, (238), 6 states have return successors, (238), 236 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-05 21:56:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2780 transitions. [2025-02-05 21:56:54,589 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2780 transitions. Word has length 599 [2025-02-05 21:56:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:54,590 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2780 transitions. [2025-02-05 21:56:54,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-05 21:56:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2780 transitions. [2025-02-05 21:56:54,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-02-05 21:56:54,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:54,612 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:54,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:56:54,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:54,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:54,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1447024303, now seen corresponding path program 1 times [2025-02-05 21:56:54,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:54,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575563979] [2025-02-05 21:56:54,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:54,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:54,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-02-05 21:56:54,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-02-05 21:56:54,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:54,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-05 21:56:54,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:54,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575563979] [2025-02-05 21:56:54,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575563979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:54,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:54,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:54,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955715374] [2025-02-05 21:56:54,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:54,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:54,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:54,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:54,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:54,791 INFO L87 Difference]: Start difference. First operand 1655 states and 2780 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-05 21:56:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:55,039 INFO L93 Difference]: Finished difference Result 4955 states and 8326 transitions. [2025-02-05 21:56:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:55,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 599 [2025-02-05 21:56:55,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:55,056 INFO L225 Difference]: With dead ends: 4955 [2025-02-05 21:56:55,056 INFO L226 Difference]: Without dead ends: 3303 [2025-02-05 21:56:55,060 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:56:55,062 INFO L435 NwaCegarLoop]: 1069 mSDtfsCounter, 549 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:55,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1601 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:55,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2025-02-05 21:56:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 1671. [2025-02-05 21:56:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1426 states have (on average 1.629733520336606) internal successors, (2324), 1428 states have internal predecessors, (2324), 238 states have call successors, (238), 6 states have call predecessors, (238), 6 states have return successors, (238), 236 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-05 21:56:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2800 transitions. [2025-02-05 21:56:55,220 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2800 transitions. Word has length 599 [2025-02-05 21:56:55,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:55,221 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2800 transitions. [2025-02-05 21:56:55,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-05 21:56:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2800 transitions. [2025-02-05 21:56:55,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-02-05 21:56:55,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:55,229 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:55,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:56:55,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:55,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:55,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1105132658, now seen corresponding path program 1 times [2025-02-05 21:56:55,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:55,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471139722] [2025-02-05 21:56:55,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:55,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:55,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-02-05 21:56:55,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-02-05 21:56:55,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:55,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-05 21:57:00,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:00,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471139722] [2025-02-05 21:57:00,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471139722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:00,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:00,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:57:00,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340093108] [2025-02-05 21:57:00,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:00,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:57:00,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:00,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:57:00,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:57:00,104 INFO L87 Difference]: Start difference. First operand 1671 states and 2800 transitions. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 3 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 3 states have call predecessors, (91), 3 states have call successors, (91) [2025-02-05 21:57:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:01,344 INFO L93 Difference]: Finished difference Result 3906 states and 6563 transitions. [2025-02-05 21:57:01,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:57:01,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 3 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 3 states have call predecessors, (91), 3 states have call successors, (91) Word has length 599 [2025-02-05 21:57:01,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:01,355 INFO L225 Difference]: With dead ends: 3906 [2025-02-05 21:57:01,355 INFO L226 Difference]: Without dead ends: 3071 [2025-02-05 21:57:01,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:57:01,358 INFO L435 NwaCegarLoop]: 1089 mSDtfsCounter, 1574 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 1970 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:01,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 1970 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 21:57:01,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2025-02-05 21:57:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 2534. [2025-02-05 21:57:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2534 states, 2210 states have (on average 1.641628959276018) internal successors, (3628), 2214 states have internal predecessors, (3628), 314 states have call successors, (314), 9 states have call predecessors, (314), 9 states have return successors, (314), 310 states have call predecessors, (314), 314 states have call successors, (314) [2025-02-05 21:57:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 4256 transitions. [2025-02-05 21:57:01,441 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 4256 transitions. Word has length 599 [2025-02-05 21:57:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:01,442 INFO L471 AbstractCegarLoop]: Abstraction has 2534 states and 4256 transitions. [2025-02-05 21:57:01,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 3 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 3 states have call predecessors, (91), 3 states have call successors, (91) [2025-02-05 21:57:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 4256 transitions. [2025-02-05 21:57:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-02-05 21:57:01,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:01,447 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:01,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:57:01,447 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:01,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:01,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1725735545, now seen corresponding path program 1 times [2025-02-05 21:57:01,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:01,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081483085] [2025-02-05 21:57:01,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:01,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:01,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-02-05 21:57:01,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-02-05 21:57:01,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:01,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-05 21:57:02,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:02,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081483085] [2025-02-05 21:57:02,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081483085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:02,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:02,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:57:02,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698473102] [2025-02-05 21:57:02,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:02,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:57:02,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:02,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:57:02,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:57:02,022 INFO L87 Difference]: Start difference. First operand 2534 states and 4256 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-05 21:57:02,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:02,492 INFO L93 Difference]: Finished difference Result 7608 states and 12786 transitions. [2025-02-05 21:57:02,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:57:02,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 599 [2025-02-05 21:57:02,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:02,517 INFO L225 Difference]: With dead ends: 7608 [2025-02-05 21:57:02,517 INFO L226 Difference]: Without dead ends: 5077 [2025-02-05 21:57:02,528 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:57:02,533 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 366 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:02,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1431 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:57:02,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5077 states. [2025-02-05 21:57:02,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5077 to 5075. [2025-02-05 21:57:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5075 states, 4428 states have (on average 1.6404697380307136) internal successors, (7264), 4436 states have internal predecessors, (7264), 628 states have call successors, (628), 18 states have call predecessors, (628), 18 states have return successors, (628), 620 states have call predecessors, (628), 628 states have call successors, (628) [2025-02-05 21:57:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5075 states to 5075 states and 8520 transitions. [2025-02-05 21:57:02,800 INFO L78 Accepts]: Start accepts. Automaton has 5075 states and 8520 transitions. Word has length 599 [2025-02-05 21:57:02,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:02,801 INFO L471 AbstractCegarLoop]: Abstraction has 5075 states and 8520 transitions. [2025-02-05 21:57:02,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-05 21:57:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 5075 states and 8520 transitions. [2025-02-05 21:57:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-02-05 21:57:02,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:02,807 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:02,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:57:02,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:02,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:02,808 INFO L85 PathProgramCache]: Analyzing trace with hash -264155546, now seen corresponding path program 1 times [2025-02-05 21:57:02,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:02,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911751615] [2025-02-05 21:57:02,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:02,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:02,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-02-05 21:57:02,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-02-05 21:57:02,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:02,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:03,416 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-02-05 21:57:03,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:03,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911751615] [2025-02-05 21:57:03,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911751615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:03,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:03,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:57:03,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028912850] [2025-02-05 21:57:03,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:03,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:57:03,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:03,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:57:03,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:57:03,418 INFO L87 Difference]: Start difference. First operand 5075 states and 8520 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-05 21:57:03,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:03,768 INFO L93 Difference]: Finished difference Result 11633 states and 19361 transitions. [2025-02-05 21:57:03,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:57:03,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 599 [2025-02-05 21:57:03,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:03,806 INFO L225 Difference]: With dead ends: 11633 [2025-02-05 21:57:03,806 INFO L226 Difference]: Without dead ends: 6561 [2025-02-05 21:57:03,821 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:57:03,822 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 619 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:03,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 1682 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:57:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6561 states. [2025-02-05 21:57:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6561 to 5603. [2025-02-05 21:57:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5603 states, 4764 states have (on average 1.617968094038623) internal successors, (7708), 4778 states have internal predecessors, (7708), 808 states have call successors, (808), 30 states have call predecessors, (808), 30 states have return successors, (808), 794 states have call predecessors, (808), 808 states have call successors, (808) [2025-02-05 21:57:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5603 states to 5603 states and 9324 transitions. [2025-02-05 21:57:04,071 INFO L78 Accepts]: Start accepts. Automaton has 5603 states and 9324 transitions. Word has length 599 [2025-02-05 21:57:04,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:04,072 INFO L471 AbstractCegarLoop]: Abstraction has 5603 states and 9324 transitions. [2025-02-05 21:57:04,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-02-05 21:57:04,075 INFO L276 IsEmpty]: Start isEmpty. Operand 5603 states and 9324 transitions. [2025-02-05 21:57:04,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-02-05 21:57:04,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:04,082 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:04,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:57:04,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:04,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:04,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1011628742, now seen corresponding path program 1 times [2025-02-05 21:57:04,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:04,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894749729] [2025-02-05 21:57:04,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:04,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:04,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-02-05 21:57:04,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-02-05 21:57:04,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:04,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat