./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_operatoramount_amount250_file-67.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 6953ac45278a08a3cd7aa6bba766924b380e26c77e34faa3b5c408a0e5b4f283 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:26:53,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:26:53,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:26:53,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:26:53,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:26:53,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:26:53,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:26:53,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:26:53,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:26:53,843 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:26:53,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:26:53,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:26:53,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:26:53,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:26:53,844 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:26:53,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:26:53,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:26:53,844 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:26:53,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:26:53,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:26:53,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:26:53,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:26:53,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:26:53,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:26:53,845 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:26:53,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:26:53,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:26:53,845 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:26:53,846 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:26:53,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:26:53,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:26:53,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:26:53,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:26:53,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:26:53,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:26:53,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:26:53,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:26:53,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:26:53,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:26:53,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:26:53,847 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:26:53,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:26:53,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:26:53,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:26:53,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:26:53,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:26:53,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:26:53,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:26:53,848 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 -> 6953ac45278a08a3cd7aa6bba766924b380e26c77e34faa3b5c408a0e5b4f283 [2025-01-09 14:26:54,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:26:54,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:26:54,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:26:54,081 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:26:54,081 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:26:54,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-67.i [2025-01-09 14:26:55,260 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eca73feed/17cf21cd327a472e978348ef67caadbc/FLAGee34b044e [2025-01-09 14:26:55,566 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:26:55,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-67.i [2025-01-09 14:26:55,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eca73feed/17cf21cd327a472e978348ef67caadbc/FLAGee34b044e [2025-01-09 14:26:55,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eca73feed/17cf21cd327a472e978348ef67caadbc [2025-01-09 14:26:55,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:26:55,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:26:55,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:26:55,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:26:55,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:26:55,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:26:55" (1/1) ... [2025-01-09 14:26:55,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:55, skipping insertion in model container [2025-01-09 14:26:55,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:26:55" (1/1) ... [2025-01-09 14:26:55,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:26:55,961 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_operatoramount_amount250_file-67.i[916,929] [2025-01-09 14:26:56,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:26:56,064 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:26:56,080 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_operatoramount_amount250_file-67.i[916,929] [2025-01-09 14:26:56,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:26:56,140 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:26:56,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:56 WrapperNode [2025-01-09 14:26:56,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:26:56,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:26:56,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:26:56,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:26:56,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:56" (1/1) ... [2025-01-09 14:26:56,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:56" (1/1) ... [2025-01-09 14:26:56,194 INFO L138 Inliner]: procedures = 26, calls = 65, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 540 [2025-01-09 14:26:56,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:26:56,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:26:56,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:26:56,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:26:56,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:56" (1/1) ... [2025-01-09 14:26:56,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:56" (1/1) ... [2025-01-09 14:26:56,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:56" (1/1) ... [2025-01-09 14:26:56,229 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-01-09 14:26:56,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:56" (1/1) ... [2025-01-09 14:26:56,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:56" (1/1) ... [2025-01-09 14:26:56,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:56" (1/1) ... [2025-01-09 14:26:56,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:56" (1/1) ... [2025-01-09 14:26:56,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:56" (1/1) ... [2025-01-09 14:26:56,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:56" (1/1) ... [2025-01-09 14:26:56,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:56" (1/1) ... [2025-01-09 14:26:56,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:26:56,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:26:56,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:26:56,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:26:56,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:56" (1/1) ... [2025-01-09 14:26:56,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:26:56,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:56,304 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-01-09 14:26:56,306 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-01-09 14:26:56,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:26:56,325 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:26:56,325 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:26:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:26:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:26:56,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:26:56,427 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:26:56,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:26:57,135 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-01-09 14:26:57,136 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:26:57,148 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:26:57,150 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:26:57,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:26:57 BoogieIcfgContainer [2025-01-09 14:26:57,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:26:57,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:26:57,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:26:57,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:26:57,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:26:55" (1/3) ... [2025-01-09 14:26:57,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d011bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:26:57, skipping insertion in model container [2025-01-09 14:26:57,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:56" (2/3) ... [2025-01-09 14:26:57,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d011bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:26:57, skipping insertion in model container [2025-01-09 14:26:57,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:26:57" (3/3) ... [2025-01-09 14:26:57,157 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-67.i [2025-01-09 14:26:57,172 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:26:57,175 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-67.i that has 2 procedures, 214 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:26:57,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:26:57,230 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;@7f00b591, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:26:57,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:26:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 214 states, 159 states have (on average 1.490566037735849) internal successors, (237), 160 states have internal predecessors, (237), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 14:26:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-01-09 14:26:57,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:57,252 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:57,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:57,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:57,257 INFO L85 PathProgramCache]: Analyzing trace with hash 236094970, now seen corresponding path program 1 times [2025-01-09 14:26:57,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:57,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037338134] [2025-01-09 14:26:57,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:57,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:57,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 14:26:57,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 14:26:57,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:57,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2025-01-09 14:26:57,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:57,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037338134] [2025-01-09 14:26:57,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037338134] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:57,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187187997] [2025-01-09 14:26:57,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:57,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:57,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:57,713 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-01-09 14:26:57,715 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-01-09 14:26:57,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 14:26:57,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 14:26:57,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:57,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:57,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:26:57,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2025-01-09 14:26:58,002 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:26:58,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187187997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:58,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:26:58,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:26:58,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974180024] [2025-01-09 14:26:58,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:58,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:26:58,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:58,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:26:58,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:26:58,049 INFO L87 Difference]: Start difference. First operand has 214 states, 159 states have (on average 1.490566037735849) internal successors, (237), 160 states have internal predecessors, (237), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2025-01-09 14:26:58,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:58,099 INFO L93 Difference]: Finished difference Result 418 states and 723 transitions. [2025-01-09 14:26:58,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:26:58,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) Word has length 350 [2025-01-09 14:26:58,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:58,111 INFO L225 Difference]: With dead ends: 418 [2025-01-09 14:26:58,111 INFO L226 Difference]: Without dead ends: 207 [2025-01-09 14:26:58,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 351 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-01-09 14:26:58,116 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:58,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:58,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-01-09 14:26:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-01-09 14:26:58,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 153 states have (on average 1.457516339869281) internal successors, (223), 153 states have internal predecessors, (223), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 14:26:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 327 transitions. [2025-01-09 14:26:58,160 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 327 transitions. Word has length 350 [2025-01-09 14:26:58,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:58,160 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 327 transitions. [2025-01-09 14:26:58,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2025-01-09 14:26:58,160 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 327 transitions. [2025-01-09 14:26:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-01-09 14:26:58,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:58,167 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:58,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:26:58,367 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-01-09 14:26:58,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:58,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:58,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1534796768, now seen corresponding path program 1 times [2025-01-09 14:26:58,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:58,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988784919] [2025-01-09 14:26:58,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:58,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:58,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 14:26:58,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 14:26:58,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:58,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 45 proven. 108 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-01-09 14:26:59,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:59,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988784919] [2025-01-09 14:26:59,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988784919] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:59,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890365283] [2025-01-09 14:26:59,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:59,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:59,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:59,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:26:59,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:26:59,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 14:26:59,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 14:26:59,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:59,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:59,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 14:26:59,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:26:59,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:26:59,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890365283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:59,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:26:59,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 14:26:59,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61327269] [2025-01-09 14:26:59,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:59,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:26:59,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:59,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:26:59,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:26:59,571 INFO L87 Difference]: Start difference. First operand 207 states and 327 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:26:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:59,624 INFO L93 Difference]: Finished difference Result 521 states and 824 transitions. [2025-01-09 14:26:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:26:59,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 350 [2025-01-09 14:26:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:59,629 INFO L225 Difference]: With dead ends: 521 [2025-01-09 14:26:59,631 INFO L226 Difference]: Without dead ends: 317 [2025-01-09 14:26:59,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:26:59,633 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 167 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:59,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 641 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:59,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-01-09 14:26:59,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 221. [2025-01-09 14:26:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 167 states have (on average 1.467065868263473) internal successors, (245), 167 states have internal predecessors, (245), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 14:26:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 349 transitions. [2025-01-09 14:26:59,658 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 349 transitions. Word has length 350 [2025-01-09 14:26:59,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:59,661 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 349 transitions. [2025-01-09 14:26:59,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:26:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 349 transitions. [2025-01-09 14:26:59,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-01-09 14:26:59,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:59,667 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:59,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:26:59,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:59,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:59,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:59,869 INFO L85 PathProgramCache]: Analyzing trace with hash 393475934, now seen corresponding path program 1 times [2025-01-09 14:26:59,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:59,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338887034] [2025-01-09 14:26:59,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:59,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:59,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 14:26:59,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 14:26:59,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:59,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 45 proven. 108 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-01-09 14:27:00,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:00,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338887034] [2025-01-09 14:27:00,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338887034] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:00,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244049003] [2025-01-09 14:27:00,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:00,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:00,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:00,464 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:27:00,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:27:00,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 14:27:00,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 14:27:00,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:00,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:00,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 14:27:00,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:27:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:27:00,739 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:27:00,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244049003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:00,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:27:00,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 14:27:00,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442390375] [2025-01-09 14:27:00,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:00,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:27:00,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:00,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:27:00,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:27:00,741 INFO L87 Difference]: Start difference. First operand 221 states and 349 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:00,813 INFO L93 Difference]: Finished difference Result 655 states and 1037 transitions. [2025-01-09 14:27:00,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:27:00,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 350 [2025-01-09 14:27:00,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:00,817 INFO L225 Difference]: With dead ends: 655 [2025-01-09 14:27:00,817 INFO L226 Difference]: Without dead ends: 437 [2025-01-09 14:27:00,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:27:00,821 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 320 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:00,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 843 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:27:00,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-01-09 14:27:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 435. [2025-01-09 14:27:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 328 states have (on average 1.4634146341463414) internal successors, (480), 328 states have internal predecessors, (480), 104 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2025-01-09 14:27:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 688 transitions. [2025-01-09 14:27:00,877 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 688 transitions. Word has length 350 [2025-01-09 14:27:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:00,877 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 688 transitions. [2025-01-09 14:27:00,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 688 transitions. [2025-01-09 14:27:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-01-09 14:27:00,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:00,881 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:00,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:27:01,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:01,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:01,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:01,082 INFO L85 PathProgramCache]: Analyzing trace with hash 270671233, now seen corresponding path program 1 times [2025-01-09 14:27:01,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:01,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680754355] [2025-01-09 14:27:01,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:01,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:01,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-01-09 14:27:01,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-01-09 14:27:01,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:01,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 45 proven. 108 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-01-09 14:27:01,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:01,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680754355] [2025-01-09 14:27:01,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680754355] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:01,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122209172] [2025-01-09 14:27:01,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:01,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:01,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:01,589 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:27:01,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:27:01,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-01-09 14:27:01,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-01-09 14:27:01,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:01,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:01,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:27:01,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:27:02,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:27:02,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:27:02,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122209172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:02,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:27:02,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-01-09 14:27:02,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166465415] [2025-01-09 14:27:02,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:02,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:27:02,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:02,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:27:02,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:27:02,708 INFO L87 Difference]: Start difference. First operand 435 states and 688 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:03,115 INFO L93 Difference]: Finished difference Result 1443 states and 2279 transitions. [2025-01-09 14:27:03,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:27:03,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 351 [2025-01-09 14:27:03,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:03,121 INFO L225 Difference]: With dead ends: 1443 [2025-01-09 14:27:03,121 INFO L226 Difference]: Without dead ends: 1011 [2025-01-09 14:27:03,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:27:03,123 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 403 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:03,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1271 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:27:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-01-09 14:27:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 865. [2025-01-09 14:27:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 652 states have (on average 1.460122699386503) internal successors, (952), 652 states have internal predecessors, (952), 208 states have call successors, (208), 4 states have call predecessors, (208), 4 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2025-01-09 14:27:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1368 transitions. [2025-01-09 14:27:03,214 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1368 transitions. Word has length 351 [2025-01-09 14:27:03,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:03,215 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1368 transitions. [2025-01-09 14:27:03,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:03,215 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1368 transitions. [2025-01-09 14:27:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-01-09 14:27:03,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:03,219 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:03,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:27:03,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:03,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:03,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:03,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2095161009, now seen corresponding path program 1 times [2025-01-09 14:27:03,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:03,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752557314] [2025-01-09 14:27:03,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:03,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:03,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-09 14:27:03,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-09 14:27:03,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:03,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:27:03,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:03,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752557314] [2025-01-09 14:27:03,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752557314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:03,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:03,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:27:03,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644259410] [2025-01-09 14:27:03,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:03,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:27:03,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:03,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:27:03,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:27:03,723 INFO L87 Difference]: Start difference. First operand 865 states and 1368 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:03,835 INFO L93 Difference]: Finished difference Result 2305 states and 3638 transitions. [2025-01-09 14:27:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:27:03,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 352 [2025-01-09 14:27:03,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:03,843 INFO L225 Difference]: With dead ends: 2305 [2025-01-09 14:27:03,844 INFO L226 Difference]: Without dead ends: 1443 [2025-01-09 14:27:03,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:27:03,847 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 222 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:03,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1246 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:27:03,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2025-01-09 14:27:03,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1437. [2025-01-09 14:27:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1088 states have (on average 1.4540441176470589) internal successors, (1582), 1092 states have internal predecessors, (1582), 340 states have call successors, (340), 8 states have call predecessors, (340), 8 states have return successors, (340), 336 states have call predecessors, (340), 340 states have call successors, (340) [2025-01-09 14:27:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2262 transitions. [2025-01-09 14:27:03,968 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2262 transitions. Word has length 352 [2025-01-09 14:27:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:03,969 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2262 transitions. [2025-01-09 14:27:03,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2262 transitions. [2025-01-09 14:27:03,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-01-09 14:27:03,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:03,974 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:03,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:27:03,975 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:03,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash 148822289, now seen corresponding path program 1 times [2025-01-09 14:27:03,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:03,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658994997] [2025-01-09 14:27:03,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:03,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:03,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-09 14:27:04,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-09 14:27:04,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:04,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:27:05,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:05,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658994997] [2025-01-09 14:27:05,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658994997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:05,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:05,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:27:05,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229913587] [2025-01-09 14:27:05,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:05,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:27:05,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:05,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:27:05,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:27:05,009 INFO L87 Difference]: Start difference. First operand 1437 states and 2262 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:06,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:06,766 INFO L93 Difference]: Finished difference Result 7052 states and 10976 transitions. [2025-01-09 14:27:06,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:27:06,767 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 352 [2025-01-09 14:27:06,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:06,801 INFO L225 Difference]: With dead ends: 7052 [2025-01-09 14:27:06,801 INFO L226 Difference]: Without dead ends: 5618 [2025-01-09 14:27:06,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:27:06,807 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 900 mSDsluCounter, 3096 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 3527 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:06,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 3527 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 14:27:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5618 states. [2025-01-09 14:27:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5618 to 3397. [2025-01-09 14:27:07,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 2700 states have (on average 1.4977777777777779) internal successors, (4044), 2708 states have internal predecessors, (4044), 680 states have call successors, (680), 16 states have call predecessors, (680), 16 states have return successors, (680), 672 states have call predecessors, (680), 680 states have call successors, (680) [2025-01-09 14:27:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 5404 transitions. [2025-01-09 14:27:07,058 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 5404 transitions. Word has length 352 [2025-01-09 14:27:07,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:07,059 INFO L471 AbstractCegarLoop]: Abstraction has 3397 states and 5404 transitions. [2025-01-09 14:27:07,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 5404 transitions. [2025-01-09 14:27:07,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-01-09 14:27:07,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:07,067 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:07,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:27:07,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:07,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:07,068 INFO L85 PathProgramCache]: Analyzing trace with hash -353707387, now seen corresponding path program 1 times [2025-01-09 14:27:07,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:07,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511349814] [2025-01-09 14:27:07,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:07,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:07,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-01-09 14:27:07,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-01-09 14:27:07,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:07,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:27:07,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:07,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511349814] [2025-01-09 14:27:07,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511349814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:07,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:07,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:27:07,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481048835] [2025-01-09 14:27:07,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:07,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:27:07,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:07,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:27:07,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:27:07,423 INFO L87 Difference]: Start difference. First operand 3397 states and 5404 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:08,271 INFO L93 Difference]: Finished difference Result 10381 states and 16452 transitions. [2025-01-09 14:27:08,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:27:08,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 353 [2025-01-09 14:27:08,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:08,313 INFO L225 Difference]: With dead ends: 10381 [2025-01-09 14:27:08,314 INFO L226 Difference]: Without dead ends: 6987 [2025-01-09 14:27:08,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:27:08,323 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 748 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:08,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1252 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:27:08,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6987 states. [2025-01-09 14:27:08,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6987 to 5005. [2025-01-09 14:27:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5005 states, 3960 states have (on average 1.490909090909091) internal successors, (5904), 3972 states have internal predecessors, (5904), 1020 states have call successors, (1020), 24 states have call predecessors, (1020), 24 states have return successors, (1020), 1008 states have call predecessors, (1020), 1020 states have call successors, (1020) [2025-01-09 14:27:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5005 states to 5005 states and 7944 transitions. [2025-01-09 14:27:08,742 INFO L78 Accepts]: Start accepts. Automaton has 5005 states and 7944 transitions. Word has length 353 [2025-01-09 14:27:08,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:08,743 INFO L471 AbstractCegarLoop]: Abstraction has 5005 states and 7944 transitions. [2025-01-09 14:27:08,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand 5005 states and 7944 transitions. [2025-01-09 14:27:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-01-09 14:27:08,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:08,748 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:08,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:27:08,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:08,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:08,749 INFO L85 PathProgramCache]: Analyzing trace with hash -213158777, now seen corresponding path program 1 times [2025-01-09 14:27:08,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:08,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621935439] [2025-01-09 14:27:08,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:08,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:08,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-01-09 14:27:09,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-01-09 14:27:09,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:09,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:27:09,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:09,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621935439] [2025-01-09 14:27:09,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621935439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:09,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:09,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:27:09,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503593602] [2025-01-09 14:27:09,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:09,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:27:09,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:09,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:27:09,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:27:09,284 INFO L87 Difference]: Start difference. First operand 5005 states and 7944 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:10,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:10,049 INFO L93 Difference]: Finished difference Result 14617 states and 23190 transitions. [2025-01-09 14:27:10,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:27:10,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 353 [2025-01-09 14:27:10,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:10,128 INFO L225 Difference]: With dead ends: 14617 [2025-01-09 14:27:10,129 INFO L226 Difference]: Without dead ends: 9615 [2025-01-09 14:27:10,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:27:10,140 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 311 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:10,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1433 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:27:10,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9615 states. [2025-01-09 14:27:10,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9615 to 9613. [2025-01-09 14:27:10,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9613 states, 7524 states have (on average 1.4790005316321106) internal successors, (11128), 7548 states have internal predecessors, (11128), 2040 states have call successors, (2040), 48 states have call predecessors, (2040), 48 states have return successors, (2040), 2016 states have call predecessors, (2040), 2040 states have call successors, (2040) [2025-01-09 14:27:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9613 states to 9613 states and 15208 transitions. [2025-01-09 14:27:10,856 INFO L78 Accepts]: Start accepts. Automaton has 9613 states and 15208 transitions. Word has length 353 [2025-01-09 14:27:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:10,857 INFO L471 AbstractCegarLoop]: Abstraction has 9613 states and 15208 transitions. [2025-01-09 14:27:10,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:10,858 INFO L276 IsEmpty]: Start isEmpty. Operand 9613 states and 15208 transitions. [2025-01-09 14:27:10,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-01-09 14:27:10,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:10,867 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:10,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:27:10,868 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:10,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:10,868 INFO L85 PathProgramCache]: Analyzing trace with hash -460203876, now seen corresponding path program 1 times [2025-01-09 14:27:10,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:10,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326279864] [2025-01-09 14:27:10,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:10,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:10,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-01-09 14:27:10,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-01-09 14:27:10,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:10,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:27:11,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:11,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326279864] [2025-01-09 14:27:11,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326279864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:11,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:11,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:27:11,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377050797] [2025-01-09 14:27:11,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:11,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:27:11,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:11,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:27:11,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:27:11,796 INFO L87 Difference]: Start difference. First operand 9613 states and 15208 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:13,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:13,285 INFO L93 Difference]: Finished difference Result 17076 states and 26788 transitions. [2025-01-09 14:27:13,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:27:13,286 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 353 [2025-01-09 14:27:13,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:13,341 INFO L225 Difference]: With dead ends: 17076 [2025-01-09 14:27:13,341 INFO L226 Difference]: Without dead ends: 14266 [2025-01-09 14:27:13,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:27:13,356 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 1333 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:13,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 2737 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:27:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14266 states. [2025-01-09 14:27:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14266 to 9989. [2025-01-09 14:27:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9989 states, 7900 states have (on average 1.4858227848101266) internal successors, (11738), 7924 states have internal predecessors, (11738), 2040 states have call successors, (2040), 48 states have call predecessors, (2040), 48 states have return successors, (2040), 2016 states have call predecessors, (2040), 2040 states have call successors, (2040) [2025-01-09 14:27:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9989 states to 9989 states and 15818 transitions. [2025-01-09 14:27:14,002 INFO L78 Accepts]: Start accepts. Automaton has 9989 states and 15818 transitions. Word has length 353 [2025-01-09 14:27:14,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:14,004 INFO L471 AbstractCegarLoop]: Abstraction has 9989 states and 15818 transitions. [2025-01-09 14:27:14,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:14,005 INFO L276 IsEmpty]: Start isEmpty. Operand 9989 states and 15818 transitions. [2025-01-09 14:27:14,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-01-09 14:27:14,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:14,013 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:14,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:27:14,014 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:14,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:14,014 INFO L85 PathProgramCache]: Analyzing trace with hash -28939176, now seen corresponding path program 1 times [2025-01-09 14:27:14,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:14,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835618848] [2025-01-09 14:27:14,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:14,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:14,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-01-09 14:27:14,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-01-09 14:27:14,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:14,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:27:14,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:14,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835618848] [2025-01-09 14:27:14,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835618848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:14,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:14,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:27:14,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295704241] [2025-01-09 14:27:14,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:14,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:27:14,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:14,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:27:14,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:27:14,645 INFO L87 Difference]: Start difference. First operand 9989 states and 15818 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:15,732 INFO L93 Difference]: Finished difference Result 25980 states and 40912 transitions. [2025-01-09 14:27:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:27:15,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 354 [2025-01-09 14:27:15,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:15,781 INFO L225 Difference]: With dead ends: 25980 [2025-01-09 14:27:15,782 INFO L226 Difference]: Without dead ends: 15994 [2025-01-09 14:27:15,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:27:15,808 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 481 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:15,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1584 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:27:15,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15994 states. [2025-01-09 14:27:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15994 to 10132. [2025-01-09 14:27:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10132 states, 7989 states have (on average 1.4835398673175617) internal successors, (11852), 8013 states have internal predecessors, (11852), 2092 states have call successors, (2092), 50 states have call predecessors, (2092), 50 states have return successors, (2092), 2068 states have call predecessors, (2092), 2092 states have call successors, (2092) [2025-01-09 14:27:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10132 states to 10132 states and 16036 transitions. [2025-01-09 14:27:16,421 INFO L78 Accepts]: Start accepts. Automaton has 10132 states and 16036 transitions. Word has length 354 [2025-01-09 14:27:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:16,422 INFO L471 AbstractCegarLoop]: Abstraction has 10132 states and 16036 transitions. [2025-01-09 14:27:16,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 10132 states and 16036 transitions. [2025-01-09 14:27:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-01-09 14:27:16,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:16,429 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:16,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:27:16,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:16,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:16,431 INFO L85 PathProgramCache]: Analyzing trace with hash -275984275, now seen corresponding path program 1 times [2025-01-09 14:27:16,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:16,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021977532] [2025-01-09 14:27:16,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:16,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:16,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-01-09 14:27:16,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-01-09 14:27:16,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:16,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:17,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:27:17,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:17,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021977532] [2025-01-09 14:27:17,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021977532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:17,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:17,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:27:17,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452248312] [2025-01-09 14:27:17,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:17,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:27:17,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:17,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:27:17,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:27:17,655 INFO L87 Difference]: Start difference. First operand 10132 states and 16036 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:19,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:19,732 INFO L93 Difference]: Finished difference Result 24129 states and 37860 transitions. [2025-01-09 14:27:19,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:27:19,732 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 354 [2025-01-09 14:27:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:19,800 INFO L225 Difference]: With dead ends: 24129 [2025-01-09 14:27:19,800 INFO L226 Difference]: Without dead ends: 21319 [2025-01-09 14:27:19,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:27:19,815 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 895 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:19,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 2720 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 14:27:19,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21319 states. [2025-01-09 14:27:20,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21319 to 16289. [2025-01-09 14:27:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16289 states, 12754 states have (on average 1.4771836286655167) internal successors, (18840), 12794 states have internal predecessors, (18840), 3452 states have call successors, (3452), 82 states have call predecessors, (3452), 82 states have return successors, (3452), 3412 states have call predecessors, (3452), 3452 states have call successors, (3452) [2025-01-09 14:27:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16289 states to 16289 states and 25744 transitions. [2025-01-09 14:27:20,833 INFO L78 Accepts]: Start accepts. Automaton has 16289 states and 25744 transitions. Word has length 354 [2025-01-09 14:27:20,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:20,834 INFO L471 AbstractCegarLoop]: Abstraction has 16289 states and 25744 transitions. [2025-01-09 14:27:20,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:20,835 INFO L276 IsEmpty]: Start isEmpty. Operand 16289 states and 25744 transitions. [2025-01-09 14:27:20,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-01-09 14:27:20,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:20,845 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:20,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:27:20,846 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:20,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:20,846 INFO L85 PathProgramCache]: Analyzing trace with hash -135435665, now seen corresponding path program 1 times [2025-01-09 14:27:20,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:20,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991246866] [2025-01-09 14:27:20,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:20,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-01-09 14:27:21,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-01-09 14:27:21,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:21,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:22,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:27:22,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:22,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991246866] [2025-01-09 14:27:22,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991246866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:22,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:22,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:27:22,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930607485] [2025-01-09 14:27:22,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:22,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:27:22,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:22,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:27:22,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:27:22,052 INFO L87 Difference]: Start difference. First operand 16289 states and 25744 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:23,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:23,779 INFO L93 Difference]: Finished difference Result 29999 states and 46824 transitions. [2025-01-09 14:27:23,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:27:23,780 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 354 [2025-01-09 14:27:23,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:23,847 INFO L225 Difference]: With dead ends: 29999 [2025-01-09 14:27:23,847 INFO L226 Difference]: Without dead ends: 27189 [2025-01-09 14:27:23,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:27:23,862 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 1154 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:23,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 1823 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:27:23,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27189 states. [2025-01-09 14:27:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27189 to 16287. [2025-01-09 14:27:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16287 states, 12752 states have (on average 1.4774153074027603) internal successors, (18840), 12792 states have internal predecessors, (18840), 3452 states have call successors, (3452), 82 states have call predecessors, (3452), 82 states have return successors, (3452), 3412 states have call predecessors, (3452), 3452 states have call successors, (3452) [2025-01-09 14:27:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16287 states to 16287 states and 25744 transitions. [2025-01-09 14:27:24,921 INFO L78 Accepts]: Start accepts. Automaton has 16287 states and 25744 transitions. Word has length 354 [2025-01-09 14:27:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:24,922 INFO L471 AbstractCegarLoop]: Abstraction has 16287 states and 25744 transitions. [2025-01-09 14:27:24,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 16287 states and 25744 transitions. [2025-01-09 14:27:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-01-09 14:27:24,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:24,933 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:24,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:27:24,933 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:24,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1281793962, now seen corresponding path program 1 times [2025-01-09 14:27:24,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:24,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027443605] [2025-01-09 14:27:24,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:24,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:24,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-01-09 14:27:25,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-01-09 14:27:25,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:25,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:27:25,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:25,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027443605] [2025-01-09 14:27:25,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027443605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:25,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:25,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:27:25,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625394198] [2025-01-09 14:27:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:25,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:27:25,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:25,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:27:25,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:27:25,217 INFO L87 Difference]: Start difference. First operand 16287 states and 25744 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:25,786 INFO L93 Difference]: Finished difference Result 36269 states and 57386 transitions. [2025-01-09 14:27:25,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:27:25,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 354 [2025-01-09 14:27:25,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:25,941 INFO L225 Difference]: With dead ends: 36269 [2025-01-09 14:27:25,942 INFO L226 Difference]: Without dead ends: 20171 [2025-01-09 14:27:26,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:27:26,006 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 209 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:26,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1148 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:27:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20171 states. [2025-01-09 14:27:26,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20171 to 20169. [2025-01-09 14:27:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20169 states, 15938 states have (on average 1.478855565315598) internal successors, (23570), 15986 states have internal predecessors, (23570), 4132 states have call successors, (4132), 98 states have call predecessors, (4132), 98 states have return successors, (4132), 4084 states have call predecessors, (4132), 4132 states have call successors, (4132) [2025-01-09 14:27:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20169 states to 20169 states and 31834 transitions. [2025-01-09 14:27:27,060 INFO L78 Accepts]: Start accepts. Automaton has 20169 states and 31834 transitions. Word has length 354 [2025-01-09 14:27:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:27,061 INFO L471 AbstractCegarLoop]: Abstraction has 20169 states and 31834 transitions. [2025-01-09 14:27:27,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 20169 states and 31834 transitions. [2025-01-09 14:27:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-01-09 14:27:27,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:27,085 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:27,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:27:27,085 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:27,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:27,086 INFO L85 PathProgramCache]: Analyzing trace with hash -185111233, now seen corresponding path program 1 times [2025-01-09 14:27:27,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:27,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167502950] [2025-01-09 14:27:27,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:27,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:27,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-01-09 14:27:27,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-01-09 14:27:27,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:27,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:27:29,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:29,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167502950] [2025-01-09 14:27:29,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167502950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:29,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:29,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:27:29,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588562113] [2025-01-09 14:27:29,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:29,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:27:29,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:29,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:27:29,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:27:29,581 INFO L87 Difference]: Start difference. First operand 20169 states and 31834 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2025-01-09 14:27:30,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:30,705 INFO L93 Difference]: Finished difference Result 44184 states and 69564 transitions. [2025-01-09 14:27:30,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:27:30,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 355 [2025-01-09 14:27:30,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:30,777 INFO L225 Difference]: With dead ends: 44184 [2025-01-09 14:27:30,777 INFO L226 Difference]: Without dead ends: 24111 [2025-01-09 14:27:30,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:27:30,812 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 462 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:30,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1120 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:27:30,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24111 states. [2025-01-09 14:27:31,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24111 to 20117. [2025-01-09 14:27:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20117 states, 15886 states have (on average 1.4787234042553192) internal successors, (23491), 15934 states have internal predecessors, (23491), 4132 states have call successors, (4132), 98 states have call predecessors, (4132), 98 states have return successors, (4132), 4084 states have call predecessors, (4132), 4132 states have call successors, (4132) [2025-01-09 14:27:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20117 states to 20117 states and 31755 transitions. [2025-01-09 14:27:31,975 INFO L78 Accepts]: Start accepts. Automaton has 20117 states and 31755 transitions. Word has length 355 [2025-01-09 14:27:31,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:31,975 INFO L471 AbstractCegarLoop]: Abstraction has 20117 states and 31755 transitions. [2025-01-09 14:27:31,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2025-01-09 14:27:31,976 INFO L276 IsEmpty]: Start isEmpty. Operand 20117 states and 31755 transitions. [2025-01-09 14:27:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-01-09 14:27:31,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:31,981 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:31,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:27:31,982 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:31,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:31,982 INFO L85 PathProgramCache]: Analyzing trace with hash 726706832, now seen corresponding path program 1 times [2025-01-09 14:27:31,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:31,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943604851] [2025-01-09 14:27:31,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:31,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:32,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-01-09 14:27:32,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-01-09 14:27:32,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:32,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 105 proven. 48 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-01-09 14:27:32,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:32,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943604851] [2025-01-09 14:27:32,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943604851] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:32,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921574778] [2025-01-09 14:27:32,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:32,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:32,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:32,306 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:27:32,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:27:32,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-01-09 14:27:32,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-01-09 14:27:32,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:32,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:32,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 14:27:32,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:27:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 3014 proven. 150 refuted. 0 times theorem prover too weak. 2140 trivial. 0 not checked. [2025-01-09 14:27:33,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:27:33,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921574778] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:33,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:27:33,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12] total 13 [2025-01-09 14:27:33,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285348632] [2025-01-09 14:27:33,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:27:33,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:27:33,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:33,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:27:33,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:27:33,392 INFO L87 Difference]: Start difference. First operand 20117 states and 31755 transitions. Second operand has 13 states, 13 states have (on average 13.76923076923077) internal successors, (179), 13 states have internal predecessors, (179), 4 states have call successors, (93), 3 states have call predecessors, (93), 5 states have return successors, (94), 4 states have call predecessors, (94), 4 states have call successors, (94) [2025-01-09 14:27:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:36,199 INFO L93 Difference]: Finished difference Result 60636 states and 93315 transitions. [2025-01-09 14:27:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 14:27:36,199 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.76923076923077) internal successors, (179), 13 states have internal predecessors, (179), 4 states have call successors, (93), 3 states have call predecessors, (93), 5 states have return successors, (94), 4 states have call predecessors, (94), 4 states have call successors, (94) Word has length 355 [2025-01-09 14:27:36,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:36,297 INFO L225 Difference]: With dead ends: 60636 [2025-01-09 14:27:36,297 INFO L226 Difference]: Without dead ends: 40666 [2025-01-09 14:27:36,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=265, Invalid=995, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 14:27:36,329 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 1166 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:36,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 1772 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:27:36,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40666 states. [2025-01-09 14:27:37,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40666 to 33170. [2025-01-09 14:27:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33170 states, 28263 states have (on average 1.477833209496515) internal successors, (41768), 28359 states have internal predecessors, (41768), 4516 states have call successors, (4516), 390 states have call predecessors, (4516), 390 states have return successors, (4516), 4420 states have call predecessors, (4516), 4516 states have call successors, (4516) [2025-01-09 14:27:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33170 states to 33170 states and 50800 transitions. [2025-01-09 14:27:37,772 INFO L78 Accepts]: Start accepts. Automaton has 33170 states and 50800 transitions. Word has length 355 [2025-01-09 14:27:37,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:37,772 INFO L471 AbstractCegarLoop]: Abstraction has 33170 states and 50800 transitions. [2025-01-09 14:27:37,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.76923076923077) internal successors, (179), 13 states have internal predecessors, (179), 4 states have call successors, (93), 3 states have call predecessors, (93), 5 states have return successors, (94), 4 states have call predecessors, (94), 4 states have call successors, (94) [2025-01-09 14:27:37,773 INFO L276 IsEmpty]: Start isEmpty. Operand 33170 states and 50800 transitions. [2025-01-09 14:27:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-01-09 14:27:37,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:37,783 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:37,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 14:27:37,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 14:27:37,983 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:37,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:37,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1815484940, now seen corresponding path program 1 times [2025-01-09 14:27:37,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:37,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017604990] [2025-01-09 14:27:37,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:37,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:38,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-01-09 14:27:38,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-01-09 14:27:38,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:38,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:38,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-01-09 14:27:38,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:38,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017604990] [2025-01-09 14:27:38,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017604990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:38,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:38,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:27:38,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112501282] [2025-01-09 14:27:38,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:38,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:27:38,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:38,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:27:38,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:27:38,460 INFO L87 Difference]: Start difference. First operand 33170 states and 50800 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 1 states have call successors, (52), 1 states have call predecessors, (52), 2 states have return successors, (52), 2 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:40,227 INFO L93 Difference]: Finished difference Result 75830 states and 116161 transitions. [2025-01-09 14:27:40,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:27:40,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 1 states have call successors, (52), 1 states have call predecessors, (52), 2 states have return successors, (52), 2 states have call predecessors, (52), 1 states have call successors, (52) Word has length 356 [2025-01-09 14:27:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:40,334 INFO L225 Difference]: With dead ends: 75830 [2025-01-09 14:27:40,334 INFO L226 Difference]: Without dead ends: 42844 [2025-01-09 14:27:40,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:27:40,385 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 620 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:40,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1358 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:27:40,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42844 states. [2025-01-09 14:27:41,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42844 to 36992. [2025-01-09 14:27:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36992 states, 32036 states have (on average 1.4733112748158321) internal successors, (47199), 32132 states have internal predecessors, (47199), 4516 states have call successors, (4516), 439 states have call predecessors, (4516), 439 states have return successors, (4516), 4420 states have call predecessors, (4516), 4516 states have call successors, (4516) [2025-01-09 14:27:41,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36992 states to 36992 states and 56231 transitions. [2025-01-09 14:27:41,921 INFO L78 Accepts]: Start accepts. Automaton has 36992 states and 56231 transitions. Word has length 356 [2025-01-09 14:27:41,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:41,922 INFO L471 AbstractCegarLoop]: Abstraction has 36992 states and 56231 transitions. [2025-01-09 14:27:41,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 1 states have call successors, (52), 1 states have call predecessors, (52), 2 states have return successors, (52), 2 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:27:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 36992 states and 56231 transitions. [2025-01-09 14:27:41,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-01-09 14:27:41,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:41,932 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:41,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:27:41,932 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:41,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:41,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1358015383, now seen corresponding path program 1 times [2025-01-09 14:27:41,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:41,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316331301] [2025-01-09 14:27:41,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:41,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:41,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-01-09 14:27:42,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-01-09 14:27:42,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:42,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 54 proven. 99 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2025-01-09 14:27:44,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:44,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316331301] [2025-01-09 14:27:44,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316331301] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:44,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052020798] [2025-01-09 14:27:44,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:44,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:44,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:44,932 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:27:44,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 14:27:45,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-01-09 14:27:45,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-01-09 14:27:45,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:45,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:45,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 14:27:45,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:27:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 3417 proven. 216 refuted. 0 times theorem prover too weak. 1671 trivial. 0 not checked. [2025-01-09 14:27:45,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:27:46,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052020798] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:46,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:27:46,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2025-01-09 14:27:46,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961521066] [2025-01-09 14:27:46,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:27:46,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 14:27:46,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:46,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 14:27:46,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2025-01-09 14:27:46,120 INFO L87 Difference]: Start difference. First operand 36992 states and 56231 transitions. Second operand has 22 states, 21 states have (on average 9.238095238095237) internal successors, (194), 21 states have internal predecessors, (194), 7 states have call successors, (104), 4 states have call predecessors, (104), 6 states have return successors, (104), 6 states have call predecessors, (104), 7 states have call successors, (104) [2025-01-09 14:27:55,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:55,274 INFO L93 Difference]: Finished difference Result 84976 states and 126774 transitions. [2025-01-09 14:27:55,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-01-09 14:27:55,275 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.238095238095237) internal successors, (194), 21 states have internal predecessors, (194), 7 states have call successors, (104), 4 states have call predecessors, (104), 6 states have return successors, (104), 6 states have call predecessors, (104), 7 states have call successors, (104) Word has length 356 [2025-01-09 14:27:55,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:55,384 INFO L225 Difference]: With dead ends: 84976 [2025-01-09 14:27:55,384 INFO L226 Difference]: Without dead ends: 48180 [2025-01-09 14:27:55,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1451 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=906, Invalid=4202, Unknown=4, NotChecked=0, Total=5112 [2025-01-09 14:27:55,431 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 4892 mSDsluCounter, 2121 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 790 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4893 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 3174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 790 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:55,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4893 Valid, 2501 Invalid, 3174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [790 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 14:27:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48180 states. [2025-01-09 14:27:58,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48180 to 34456. [2025-01-09 14:27:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34456 states, 27625 states have (on average 1.3926515837104072) internal successors, (38472), 27769 states have internal predecessors, (38472), 5860 states have call successors, (5860), 970 states have call predecessors, (5860), 970 states have return successors, (5860), 5716 states have call predecessors, (5860), 5860 states have call successors, (5860) [2025-01-09 14:27:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34456 states to 34456 states and 50192 transitions. [2025-01-09 14:27:58,350 INFO L78 Accepts]: Start accepts. Automaton has 34456 states and 50192 transitions. Word has length 356 [2025-01-09 14:27:58,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:58,350 INFO L471 AbstractCegarLoop]: Abstraction has 34456 states and 50192 transitions. [2025-01-09 14:27:58,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.238095238095237) internal successors, (194), 21 states have internal predecessors, (194), 7 states have call successors, (104), 4 states have call predecessors, (104), 6 states have return successors, (104), 6 states have call predecessors, (104), 7 states have call successors, (104) [2025-01-09 14:27:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 34456 states and 50192 transitions. [2025-01-09 14:27:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-09 14:27:58,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:58,357 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:58,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 14:27:58,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 14:27:58,557 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:58,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash -355087141, now seen corresponding path program 1 times [2025-01-09 14:27:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:58,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374057687] [2025-01-09 14:27:58,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:58,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:58,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-09 14:27:58,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-09 14:27:58,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:58,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-01-09 14:27:58,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:58,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374057687] [2025-01-09 14:27:58,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374057687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:58,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:58,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:27:58,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459083382] [2025-01-09 14:27:58,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:58,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:27:58,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:58,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:27:58,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:27:58,913 INFO L87 Difference]: Start difference. First operand 34456 states and 50192 transitions. Second operand has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:28:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:03,493 INFO L93 Difference]: Finished difference Result 62048 states and 89989 transitions. [2025-01-09 14:28:03,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:28:03,494 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 357 [2025-01-09 14:28:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:03,633 INFO L225 Difference]: With dead ends: 62048 [2025-01-09 14:28:03,633 INFO L226 Difference]: Without dead ends: 51198 [2025-01-09 14:28:03,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:28:03,671 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 2370 mSDsluCounter, 3104 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 1255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2370 SdHoareTripleChecker+Valid, 3691 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1255 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:03,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2370 Valid, 3691 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1255 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 14:28:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51198 states. [2025-01-09 14:28:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51198 to 36752. [2025-01-09 14:28:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36752 states, 29369 states have (on average 1.387789846436719) internal successors, (40758), 29529 states have internal predecessors, (40758), 6332 states have call successors, (6332), 1050 states have call predecessors, (6332), 1050 states have return successors, (6332), 6172 states have call predecessors, (6332), 6332 states have call successors, (6332) [2025-01-09 14:28:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36752 states to 36752 states and 53422 transitions. [2025-01-09 14:28:07,500 INFO L78 Accepts]: Start accepts. Automaton has 36752 states and 53422 transitions. Word has length 357 [2025-01-09 14:28:07,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:07,501 INFO L471 AbstractCegarLoop]: Abstraction has 36752 states and 53422 transitions. [2025-01-09 14:28:07,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-01-09 14:28:07,501 INFO L276 IsEmpty]: Start isEmpty. Operand 36752 states and 53422 transitions. [2025-01-09 14:28:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-09 14:28:07,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:07,519 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:28:07,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 14:28:07,519 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:07,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1943435043, now seen corresponding path program 1 times [2025-01-09 14:28:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:07,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347680900] [2025-01-09 14:28:07,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:07,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes.