./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label04.c -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 1fd9e1e868c304b5369800f6e74fe17eb5b4635faf40e950da9c44d0d244c905 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:34:47,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:34:47,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:34:47,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:34:47,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:34:47,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:34:47,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:34:47,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:34:47,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:34:47,852 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:34:47,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:34:47,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:34:47,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:34:47,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:34:47,852 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:34:47,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:34:47,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:34:47,852 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:34:47,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:34:47,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:34:47,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:34:47,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:34:47,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:34:47,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:34:47,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:34:47,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:34:47,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:34:47,854 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 -> 1fd9e1e868c304b5369800f6e74fe17eb5b4635faf40e950da9c44d0d244c905 [2025-02-05 17:34:48,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:34:48,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:34:48,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:34:48,120 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:34:48,120 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:34:48,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-02-05 17:34:49,381 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a53547d4a/72d7b91e94bf435d90495bbb5d425cf4/FLAGc85cc78ef [2025-02-05 17:34:49,920 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:34:49,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-02-05 17:34:49,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a53547d4a/72d7b91e94bf435d90495bbb5d425cf4/FLAGc85cc78ef [2025-02-05 17:34:49,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a53547d4a/72d7b91e94bf435d90495bbb5d425cf4 [2025-02-05 17:34:49,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:34:49,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:34:49,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:34:49,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:34:49,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:34:49,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:34:49" (1/1) ... [2025-02-05 17:34:49,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1957993c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:34:49, skipping insertion in model container [2025-02-05 17:34:49,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:34:49" (1/1) ... [2025-02-05 17:34:50,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:34:50,312 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label04.c[6450,6463] [2025-02-05 17:34:50,371 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label04.c[13511,13524] [2025-02-05 17:34:50,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:34:50,787 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:34:50,814 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label04.c[6450,6463] [2025-02-05 17:34:50,825 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label04.c[13511,13524] [2025-02-05 17:34:51,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:34:51,110 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:34:51,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:34:51 WrapperNode [2025-02-05 17:34:51,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:34:51,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:34:51,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:34:51,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:34:51,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:34:51" (1/1) ... [2025-02-05 17:34:51,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:34:51" (1/1) ... [2025-02-05 17:34:51,361 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4977 [2025-02-05 17:34:51,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:34:51,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:34:51,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:34:51,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:34:51,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:34:51" (1/1) ... [2025-02-05 17:34:51,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:34:51" (1/1) ... [2025-02-05 17:34:51,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:34:51" (1/1) ... [2025-02-05 17:34:51,546 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:34:51,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:34:51" (1/1) ... [2025-02-05 17:34:51,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:34:51" (1/1) ... [2025-02-05 17:34:51,671 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:34:51" (1/1) ... [2025-02-05 17:34:51,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:34:51" (1/1) ... [2025-02-05 17:34:51,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:34:51" (1/1) ... [2025-02-05 17:34:51,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:34:51" (1/1) ... [2025-02-05 17:34:51,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:34:51,798 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:34:51,798 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:34:51,798 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:34:51,800 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:34:51" (1/1) ... [2025-02-05 17:34:51,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:34:51,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:34:51,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:34:51,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:34:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:34:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:34:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:34:51,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:34:51,939 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:34:51,941 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:34:56,122 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1987: havoc calculate_output_#t~ret29#1; [2025-02-05 17:34:56,123 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3466: havoc calculate_output2_#t~ret30#1; [2025-02-05 17:34:56,123 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4956: havoc calculate_output3_#t~ret31#1; [2025-02-05 17:34:56,277 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2025-02-05 17:34:56,278 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:34:56,311 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:34:56,315 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:34:56,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:34:56 BoogieIcfgContainer [2025-02-05 17:34:56,316 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:34:56,318 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:34:56,318 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:34:56,321 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:34:56,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:34:49" (1/3) ... [2025-02-05 17:34:56,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e910193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:34:56, skipping insertion in model container [2025-02-05 17:34:56,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:34:51" (2/3) ... [2025-02-05 17:34:56,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e910193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:34:56, skipping insertion in model container [2025-02-05 17:34:56,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:34:56" (3/3) ... [2025-02-05 17:34:56,323 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-02-05 17:34:56,334 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:34:56,337 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label04.c that has 1 procedures, 873 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:34:56,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:34:56,431 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;@41748b4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:34:56,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:34:56,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 873 states, 870 states have (on average 1.9045977011494253) internal successors, (1657), 872 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:56,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 17:34:56,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:34:56,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:34:56,447 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:34:56,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:34:56,452 INFO L85 PathProgramCache]: Analyzing trace with hash 628275282, now seen corresponding path program 1 times [2025-02-05 17:34:56,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:34:56,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997005957] [2025-02-05 17:34:56,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:34:56,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:34:56,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 17:34:56,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 17:34:56,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:34:56,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:34:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:34:56,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:34:56,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997005957] [2025-02-05 17:34:56,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997005957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:34:56,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:34:56,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:34:56,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135525467] [2025-02-05 17:34:56,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:34:56,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:34:56,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:34:56,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:34:56,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:34:56,679 INFO L87 Difference]: Start difference. First operand has 873 states, 870 states have (on average 1.9045977011494253) internal successors, (1657), 872 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:56,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:34:56,756 INFO L93 Difference]: Finished difference Result 1723 states and 3273 transitions. [2025-02-05 17:34:56,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:34:56,757 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-05 17:34:56,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:34:56,772 INFO L225 Difference]: With dead ends: 1723 [2025-02-05 17:34:56,772 INFO L226 Difference]: Without dead ends: 808 [2025-02-05 17:34:56,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:34:56,781 INFO L435 NwaCegarLoop]: 1591 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, 1591 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-02-05 17:34:56,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:34:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-02-05 17:34:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2025-02-05 17:34:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 1.8945409429280398) internal successors, (1527), 807 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:56,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1527 transitions. [2025-02-05 17:34:56,851 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1527 transitions. Word has length 20 [2025-02-05 17:34:56,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:34:56,852 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1527 transitions. [2025-02-05 17:34:56,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:56,852 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1527 transitions. [2025-02-05 17:34:56,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 17:34:56,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:34:56,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:34:56,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:34:56,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:34:56,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:34:56,854 INFO L85 PathProgramCache]: Analyzing trace with hash 122716657, now seen corresponding path program 1 times [2025-02-05 17:34:56,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:34:56,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564705242] [2025-02-05 17:34:56,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:34:56,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:34:56,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 17:34:56,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 17:34:56,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:34:56,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:34:57,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:34:57,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:34:57,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564705242] [2025-02-05 17:34:57,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564705242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:34:57,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:34:57,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:34:57,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74451478] [2025-02-05 17:34:57,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:34:57,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:34:57,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:34:57,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:34:57,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:34:57,067 INFO L87 Difference]: Start difference. First operand 808 states and 1527 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:57,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:34:57,157 INFO L93 Difference]: Finished difference Result 844 states and 1581 transitions. [2025-02-05 17:34:57,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:34:57,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-05 17:34:57,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:34:57,162 INFO L225 Difference]: With dead ends: 844 [2025-02-05 17:34:57,162 INFO L226 Difference]: Without dead ends: 808 [2025-02-05 17:34:57,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:34:57,163 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:34:57,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:34:57,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-02-05 17:34:57,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2025-02-05 17:34:57,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 1.8746898263027296) internal successors, (1511), 807 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1511 transitions. [2025-02-05 17:34:57,199 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1511 transitions. Word has length 20 [2025-02-05 17:34:57,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:34:57,200 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1511 transitions. [2025-02-05 17:34:57,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:57,200 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1511 transitions. [2025-02-05 17:34:57,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 17:34:57,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:34:57,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:34:57,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:34:57,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:34:57,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:34:57,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1237708420, now seen corresponding path program 1 times [2025-02-05 17:34:57,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:34:57,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316116974] [2025-02-05 17:34:57,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:34:57,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:34:57,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 17:34:57,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 17:34:57,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:34:57,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:34:57,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:34:57,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:34:57,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316116974] [2025-02-05 17:34:57,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316116974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:34:57,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:34:57,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:34:57,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206719520] [2025-02-05 17:34:57,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:34:57,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:34:57,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:34:57,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:34:57,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:34:57,355 INFO L87 Difference]: Start difference. First operand 808 states and 1511 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:34:57,482 INFO L93 Difference]: Finished difference Result 1000 states and 1811 transitions. [2025-02-05 17:34:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:34:57,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-05 17:34:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:34:57,486 INFO L225 Difference]: With dead ends: 1000 [2025-02-05 17:34:57,487 INFO L226 Difference]: Without dead ends: 968 [2025-02-05 17:34:57,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-02-05 17:34:57,488 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 4644 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4644 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:34:57,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4644 Valid, 1789 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:34:57,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2025-02-05 17:34:57,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 838. [2025-02-05 17:34:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 1.8636363636363635) internal successors, (1558), 837 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1558 transitions. [2025-02-05 17:34:57,509 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1558 transitions. Word has length 35 [2025-02-05 17:34:57,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:34:57,510 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1558 transitions. [2025-02-05 17:34:57,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1558 transitions. [2025-02-05 17:34:57,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 17:34:57,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:34:57,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:34:57,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:34:57,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:34:57,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:34:57,512 INFO L85 PathProgramCache]: Analyzing trace with hash 852203871, now seen corresponding path program 1 times [2025-02-05 17:34:57,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:34:57,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562413393] [2025-02-05 17:34:57,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:34:57,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:34:57,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 17:34:57,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 17:34:57,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:34:57,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:34:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:34:57,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:34:57,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562413393] [2025-02-05 17:34:57,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562413393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:34:57,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:34:57,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:34:57,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490157587] [2025-02-05 17:34:57,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:34:57,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:34:57,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:34:57,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:34:57,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:34:57,609 INFO L87 Difference]: Start difference. First operand 838 states and 1558 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:34:57,645 INFO L93 Difference]: Finished difference Result 951 states and 1733 transitions. [2025-02-05 17:34:57,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:34:57,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-02-05 17:34:57,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:34:57,650 INFO L225 Difference]: With dead ends: 951 [2025-02-05 17:34:57,650 INFO L226 Difference]: Without dead ends: 889 [2025-02-05 17:34:57,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:34:57,652 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 1468 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:34:57,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 1550 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:34:57,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-02-05 17:34:57,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 885. [2025-02-05 17:34:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.8437146092865233) internal successors, (1628), 884 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1628 transitions. [2025-02-05 17:34:57,680 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1628 transitions. Word has length 37 [2025-02-05 17:34:57,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:34:57,681 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1628 transitions. [2025-02-05 17:34:57,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:57,681 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1628 transitions. [2025-02-05 17:34:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 17:34:57,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:34:57,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:34:57,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:34:57,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:34:57,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:34:57,684 INFO L85 PathProgramCache]: Analyzing trace with hash 884527106, now seen corresponding path program 1 times [2025-02-05 17:34:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:34:57,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119157237] [2025-02-05 17:34:57,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:34:57,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:34:57,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 17:34:57,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 17:34:57,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:34:57,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:34:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:34:57,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:34:57,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119157237] [2025-02-05 17:34:57,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119157237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:34:57,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:34:57,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:34:57,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634618864] [2025-02-05 17:34:57,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:34:57,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:34:57,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:34:57,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:34:57,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:34:57,849 INFO L87 Difference]: Start difference. First operand 885 states and 1628 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:34:57,916 INFO L93 Difference]: Finished difference Result 996 states and 1796 transitions. [2025-02-05 17:34:57,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:34:57,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-02-05 17:34:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:34:57,921 INFO L225 Difference]: With dead ends: 996 [2025-02-05 17:34:57,921 INFO L226 Difference]: Without dead ends: 887 [2025-02-05 17:34:57,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:34:57,922 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 2952 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2952 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:34:57,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2952 Valid, 1602 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:34:57,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-02-05 17:34:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2025-02-05 17:34:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.8414496036240091) internal successors, (1626), 884 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1626 transitions. [2025-02-05 17:34:57,942 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1626 transitions. Word has length 37 [2025-02-05 17:34:57,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:34:57,943 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1626 transitions. [2025-02-05 17:34:57,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1626 transitions. [2025-02-05 17:34:57,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 17:34:57,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:34:57,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:34:57,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:34:57,944 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:34:57,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:34:57,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1681074244, now seen corresponding path program 1 times [2025-02-05 17:34:57,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:34:57,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553746254] [2025-02-05 17:34:57,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:34:57,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:34:57,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 17:34:57,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 17:34:57,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:34:57,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:34:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:34:58,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:34:58,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553746254] [2025-02-05 17:34:58,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553746254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:34:58,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:34:58,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:34:58,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207068038] [2025-02-05 17:34:58,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:34:58,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:34:58,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:34:58,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:34:58,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:34:58,164 INFO L87 Difference]: Start difference. First operand 885 states and 1626 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:34:58,245 INFO L93 Difference]: Finished difference Result 893 states and 1635 transitions. [2025-02-05 17:34:58,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:34:58,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-05 17:34:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:34:58,249 INFO L225 Difference]: With dead ends: 893 [2025-02-05 17:34:58,249 INFO L226 Difference]: Without dead ends: 891 [2025-02-05 17:34:58,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:34:58,250 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 0 mSDsluCounter, 9017 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10522 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:34:58,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10522 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:34:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-02-05 17:34:58,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2025-02-05 17:34:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 889 states have (on average 1.8346456692913387) internal successors, (1631), 890 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1631 transitions. [2025-02-05 17:34:58,270 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1631 transitions. Word has length 38 [2025-02-05 17:34:58,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:34:58,270 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1631 transitions. [2025-02-05 17:34:58,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:58,271 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1631 transitions. [2025-02-05 17:34:58,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 17:34:58,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:34:58,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:34:58,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:34:58,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:34:58,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:34:58,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1052560352, now seen corresponding path program 1 times [2025-02-05 17:34:58,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:34:58,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443563430] [2025-02-05 17:34:58,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:34:58,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:34:58,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 17:34:58,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 17:34:58,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:34:58,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:34:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:34:58,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:34:58,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443563430] [2025-02-05 17:34:58,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443563430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:34:58,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:34:58,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:34:58,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762352870] [2025-02-05 17:34:58,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:34:58,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:34:58,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:34:58,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:34:58,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:34:58,318 INFO L87 Difference]: Start difference. First operand 891 states and 1631 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:34:58,343 INFO L93 Difference]: Finished difference Result 1105 states and 1943 transitions. [2025-02-05 17:34:58,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:34:58,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-02-05 17:34:58,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:34:58,347 INFO L225 Difference]: With dead ends: 1105 [2025-02-05 17:34:58,348 INFO L226 Difference]: Without dead ends: 990 [2025-02-05 17:34:58,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:34:58,349 INFO L435 NwaCegarLoop]: 1538 mSDtfsCounter, 1477 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:34:58,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 1593 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:34:58,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-02-05 17:34:58,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 988. [2025-02-05 17:34:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 986 states have (on average 1.793103448275862) internal successors, (1768), 987 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1768 transitions. [2025-02-05 17:34:58,372 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1768 transitions. Word has length 39 [2025-02-05 17:34:58,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:34:58,372 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1768 transitions. [2025-02-05 17:34:58,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:58,372 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1768 transitions. [2025-02-05 17:34:58,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 17:34:58,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:34:58,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:34:58,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:34:58,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:34:58,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:34:58,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1539278624, now seen corresponding path program 1 times [2025-02-05 17:34:58,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:34:58,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255282040] [2025-02-05 17:34:58,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:34:58,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:34:58,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 17:34:58,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 17:34:58,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:34:58,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:34:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:34:58,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:34:58,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255282040] [2025-02-05 17:34:58,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255282040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:34:58,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:34:58,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:34:58,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468926509] [2025-02-05 17:34:58,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:34:58,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:34:58,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:34:58,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:34:58,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:34:58,421 INFO L87 Difference]: Start difference. First operand 988 states and 1768 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:34:58,453 INFO L93 Difference]: Finished difference Result 1380 states and 2326 transitions. [2025-02-05 17:34:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:34:58,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-02-05 17:34:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:34:58,458 INFO L225 Difference]: With dead ends: 1380 [2025-02-05 17:34:58,458 INFO L226 Difference]: Without dead ends: 1168 [2025-02-05 17:34:58,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:34:58,459 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 1475 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:34:58,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1595 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:34:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2025-02-05 17:34:58,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1166. [2025-02-05 17:34:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1164 states have (on average 1.7268041237113403) internal successors, (2010), 1165 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 2010 transitions. [2025-02-05 17:34:58,487 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 2010 transitions. Word has length 39 [2025-02-05 17:34:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:34:58,488 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 2010 transitions. [2025-02-05 17:34:58,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 2010 transitions. [2025-02-05 17:34:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 17:34:58,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:34:58,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:34:58,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:34:58,489 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:34:58,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:34:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash -285813920, now seen corresponding path program 1 times [2025-02-05 17:34:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:34:58,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016077967] [2025-02-05 17:34:58,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:34:58,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:34:58,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 17:34:58,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 17:34:58,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:34:58,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:34:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:34:58,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:34:58,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016077967] [2025-02-05 17:34:58,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016077967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:34:58,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:34:58,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:34:58,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627806380] [2025-02-05 17:34:58,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:34:58,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:34:58,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:34:58,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:34:58,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:34:58,527 INFO L87 Difference]: Start difference. First operand 1166 states and 2010 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:34:58,552 INFO L93 Difference]: Finished difference Result 1589 states and 2616 transitions. [2025-02-05 17:34:58,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:34:58,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-05 17:34:58,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:34:58,558 INFO L225 Difference]: With dead ends: 1589 [2025-02-05 17:34:58,559 INFO L226 Difference]: Without dead ends: 1354 [2025-02-05 17:34:58,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:34:58,560 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 1476 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:34:58,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:34:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-02-05 17:34:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2025-02-05 17:34:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1350 states have (on average 1.677037037037037) internal successors, (2264), 1351 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2264 transitions. [2025-02-05 17:34:58,622 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2264 transitions. Word has length 41 [2025-02-05 17:34:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:34:58,622 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 2264 transitions. [2025-02-05 17:34:58,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2264 transitions. [2025-02-05 17:34:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:34:58,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:34:58,623 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:34:58,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:34:58,623 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:34:58,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:34:58,625 INFO L85 PathProgramCache]: Analyzing trace with hash -579892588, now seen corresponding path program 1 times [2025-02-05 17:34:58,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:34:58,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405816120] [2025-02-05 17:34:58,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:34:58,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:34:58,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:34:58,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:34:58,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:34:58,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:34:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:34:58,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:34:58,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405816120] [2025-02-05 17:34:58,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405816120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:34:58,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:34:58,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:34:58,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732472676] [2025-02-05 17:34:58,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:34:58,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:34:58,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:34:58,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:34:58,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:34:58,711 INFO L87 Difference]: Start difference. First operand 1352 states and 2264 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:34:58,790 INFO L93 Difference]: Finished difference Result 3208 states and 4844 transitions. [2025-02-05 17:34:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:34:58,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-02-05 17:34:58,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:34:58,798 INFO L225 Difference]: With dead ends: 3208 [2025-02-05 17:34:58,799 INFO L226 Difference]: Without dead ends: 2634 [2025-02-05 17:34:58,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:34:58,802 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 3054 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3054 SdHoareTripleChecker+Valid, 3159 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:34:58,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3054 Valid, 3159 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:34:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2025-02-05 17:34:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1924. [2025-02-05 17:34:58,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1922 states have (on average 1.5879292403746097) internal successors, (3052), 1923 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3052 transitions. [2025-02-05 17:34:58,851 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 3052 transitions. Word has length 54 [2025-02-05 17:34:58,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:34:58,851 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 3052 transitions. [2025-02-05 17:34:58,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 3052 transitions. [2025-02-05 17:34:58,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:34:58,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:34:58,853 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:34:58,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:34:58,853 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:34:58,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:34:58,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1066610860, now seen corresponding path program 1 times [2025-02-05 17:34:58,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:34:58,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46501410] [2025-02-05 17:34:58,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:34:58,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:34:58,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:34:58,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:34:58,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:34:58,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:34:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:34:58,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:34:58,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46501410] [2025-02-05 17:34:58,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46501410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:34:58,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:34:58,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:34:58,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490808967] [2025-02-05 17:34:58,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:34:58,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:34:58,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:34:58,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:34:58,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:34:58,952 INFO L87 Difference]: Start difference. First operand 1924 states and 3052 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:59,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:34:59,036 INFO L93 Difference]: Finished difference Result 3780 states and 5632 transitions. [2025-02-05 17:34:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:34:59,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-02-05 17:34:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:34:59,048 INFO L225 Difference]: With dead ends: 3780 [2025-02-05 17:34:59,049 INFO L226 Difference]: Without dead ends: 3206 [2025-02-05 17:34:59,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:34:59,052 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 3059 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3059 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:34:59,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3059 Valid, 3148 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:34:59,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2025-02-05 17:34:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 2784. [2025-02-05 17:34:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2782 states have (on average 1.518332135154565) internal successors, (4224), 2783 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4224 transitions. [2025-02-05 17:34:59,111 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4224 transitions. Word has length 54 [2025-02-05 17:34:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:34:59,111 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 4224 transitions. [2025-02-05 17:34:59,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4224 transitions. [2025-02-05 17:34:59,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:34:59,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:34:59,112 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:34:59,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:34:59,112 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:34:59,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:34:59,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2073319406, now seen corresponding path program 1 times [2025-02-05 17:34:59,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:34:59,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138756815] [2025-02-05 17:34:59,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:34:59,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:34:59,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:34:59,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:34:59,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:34:59,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:34:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:34:59,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:34:59,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138756815] [2025-02-05 17:34:59,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138756815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:34:59,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:34:59,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:34:59,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864831280] [2025-02-05 17:34:59,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:34:59,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:34:59,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:34:59,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:34:59,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:34:59,178 INFO L87 Difference]: Start difference. First operand 2784 states and 4224 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:34:59,216 INFO L93 Difference]: Finished difference Result 4260 states and 6287 transitions. [2025-02-05 17:34:59,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:34:59,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-02-05 17:34:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:34:59,223 INFO L225 Difference]: With dead ends: 4260 [2025-02-05 17:34:59,223 INFO L226 Difference]: Without dead ends: 2254 [2025-02-05 17:34:59,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:34:59,227 INFO L435 NwaCegarLoop]: 1535 mSDtfsCounter, 34 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3031 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:34:59,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3031 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:34:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2025-02-05 17:34:59,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2252. [2025-02-05 17:34:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2250 states have (on average 1.5537777777777777) internal successors, (3496), 2251 states have internal predecessors, (3496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3496 transitions. [2025-02-05 17:34:59,270 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3496 transitions. Word has length 56 [2025-02-05 17:34:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:34:59,271 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 3496 transitions. [2025-02-05 17:34:59,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3496 transitions. [2025-02-05 17:34:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:34:59,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:34:59,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:34:59,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:34:59,274 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:34:59,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:34:59,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1318626092, now seen corresponding path program 1 times [2025-02-05 17:34:59,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:34:59,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974352340] [2025-02-05 17:34:59,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:34:59,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:34:59,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:34:59,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:34:59,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:34:59,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:34:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:34:59,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:34:59,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974352340] [2025-02-05 17:34:59,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974352340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:34:59,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:34:59,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:34:59,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438545619] [2025-02-05 17:34:59,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:34:59,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:34:59,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:34:59,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:34:59,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:34:59,356 INFO L87 Difference]: Start difference. First operand 2252 states and 3496 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:34:59,443 INFO L93 Difference]: Finished difference Result 3508 states and 5252 transitions. [2025-02-05 17:34:59,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:34:59,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-02-05 17:34:59,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:34:59,452 INFO L225 Difference]: With dead ends: 3508 [2025-02-05 17:34:59,452 INFO L226 Difference]: Without dead ends: 3090 [2025-02-05 17:34:59,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:34:59,455 INFO L435 NwaCegarLoop]: 1550 mSDtfsCounter, 3049 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3049 SdHoareTripleChecker+Valid, 3182 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:34:59,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3049 Valid, 3182 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:34:59,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2025-02-05 17:34:59,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 2668. [2025-02-05 17:34:59,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2666 states have (on average 1.5273818454613652) internal successors, (4072), 2667 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 4072 transitions. [2025-02-05 17:34:59,508 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 4072 transitions. Word has length 56 [2025-02-05 17:34:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:34:59,509 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 4072 transitions. [2025-02-05 17:34:59,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 4072 transitions. [2025-02-05 17:34:59,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 17:34:59,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:34:59,510 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:34:59,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:34:59,510 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:34:59,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:34:59,510 INFO L85 PathProgramCache]: Analyzing trace with hash -431595430, now seen corresponding path program 1 times [2025-02-05 17:34:59,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:34:59,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735529136] [2025-02-05 17:34:59,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:34:59,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:34:59,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 17:34:59,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 17:34:59,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:34:59,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:34:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:34:59,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:34:59,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735529136] [2025-02-05 17:34:59,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735529136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:34:59,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:34:59,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:34:59,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135789479] [2025-02-05 17:34:59,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:34:59,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:34:59,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:34:59,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:34:59,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:34:59,578 INFO L87 Difference]: Start difference. First operand 2668 states and 4072 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:34:59,611 INFO L93 Difference]: Finished difference Result 3608 states and 5370 transitions. [2025-02-05 17:34:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:34:59,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-02-05 17:34:59,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:34:59,617 INFO L225 Difference]: With dead ends: 3608 [2025-02-05 17:34:59,617 INFO L226 Difference]: Without dead ends: 1734 [2025-02-05 17:34:59,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:34:59,620 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 29 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:34:59,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3016 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:34:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2025-02-05 17:34:59,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2025-02-05 17:34:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.5942196531791908) internal successors, (2758), 1731 states have internal predecessors, (2758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2758 transitions. [2025-02-05 17:34:59,655 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2758 transitions. Word has length 57 [2025-02-05 17:34:59,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:34:59,655 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 2758 transitions. [2025-02-05 17:34:59,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:59,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2758 transitions. [2025-02-05 17:34:59,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 17:34:59,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:34:59,656 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:34:59,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:34:59,656 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:34:59,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:34:59,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1723141375, now seen corresponding path program 1 times [2025-02-05 17:34:59,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:34:59,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96688824] [2025-02-05 17:34:59,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:34:59,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:34:59,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 17:34:59,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 17:34:59,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:34:59,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:34:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:34:59,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:34:59,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96688824] [2025-02-05 17:34:59,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96688824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:34:59,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:34:59,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:34:59,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369506345] [2025-02-05 17:34:59,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:34:59,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:34:59,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:34:59,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:34:59,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:34:59,724 INFO L87 Difference]: Start difference. First operand 1732 states and 2758 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:59,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:34:59,748 INFO L93 Difference]: Finished difference Result 2204 states and 3399 transitions. [2025-02-05 17:34:59,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:34:59,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-02-05 17:34:59,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:34:59,755 INFO L225 Difference]: With dead ends: 2204 [2025-02-05 17:34:59,756 INFO L226 Difference]: Without dead ends: 1266 [2025-02-05 17:34:59,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:34:59,757 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 26 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:34:59,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3001 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:34:59,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2025-02-05 17:34:59,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1264. [2025-02-05 17:34:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1262 states have (on average 1.6719492868462758) internal successors, (2110), 1263 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 2110 transitions. [2025-02-05 17:34:59,792 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 2110 transitions. Word has length 59 [2025-02-05 17:34:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:34:59,792 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 2110 transitions. [2025-02-05 17:34:59,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:34:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 2110 transitions. [2025-02-05 17:34:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 17:34:59,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:34:59,793 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:34:59,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:34:59,794 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:34:59,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:34:59,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1954883896, now seen corresponding path program 1 times [2025-02-05 17:34:59,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:34:59,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687286446] [2025-02-05 17:34:59,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:34:59,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:34:59,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 17:34:59,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 17:34:59,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:34:59,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:00,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:00,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687286446] [2025-02-05 17:35:00,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687286446] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:00,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068145050] [2025-02-05 17:35:00,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:00,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:00,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:00,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:35:00,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:35:00,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 17:35:00,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 17:35:00,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:00,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:00,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 17:35:00,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:35:01,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:35:01,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068145050] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:01,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:01,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2025-02-05 17:35:01,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254843934] [2025-02-05 17:35:01,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:01,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 17:35:01,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:01,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 17:35:01,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-02-05 17:35:01,326 INFO L87 Difference]: Start difference. First operand 1264 states and 2110 transitions. Second operand has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:04,071 INFO L93 Difference]: Finished difference Result 3709 states and 5328 transitions. [2025-02-05 17:35:04,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-05 17:35:04,071 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-05 17:35:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:04,081 INFO L225 Difference]: With dead ends: 3709 [2025-02-05 17:35:04,081 INFO L226 Difference]: Without dead ends: 3239 [2025-02-05 17:35:04,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=809, Invalid=3351, Unknown=0, NotChecked=0, Total=4160 [2025-02-05 17:35:04,085 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 17225 mSDsluCounter, 6276 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17225 SdHoareTripleChecker+Valid, 7775 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:04,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17225 Valid, 7775 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:35:04,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2025-02-05 17:35:04,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 3161. [2025-02-05 17:35:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3161 states, 3159 states have (on average 1.4102564102564104) internal successors, (4455), 3160 states have internal predecessors, (4455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 4455 transitions. [2025-02-05 17:35:04,157 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 4455 transitions. Word has length 61 [2025-02-05 17:35:04,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:04,157 INFO L471 AbstractCegarLoop]: Abstraction has 3161 states and 4455 transitions. [2025-02-05 17:35:04,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:04,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 4455 transitions. [2025-02-05 17:35:04,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 17:35:04,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:04,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:04,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:35:04,359 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,SelfDestructingSolverStorable15 [2025-02-05 17:35:04,359 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:04,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:04,364 INFO L85 PathProgramCache]: Analyzing trace with hash 362278407, now seen corresponding path program 1 times [2025-02-05 17:35:04,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:04,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400084521] [2025-02-05 17:35:04,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:04,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:04,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 17:35:04,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 17:35:04,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:04,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:04,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:04,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400084521] [2025-02-05 17:35:04,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400084521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:04,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:04,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:35:04,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062756497] [2025-02-05 17:35:04,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:04,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:04,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:04,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:04,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:04,417 INFO L87 Difference]: Start difference. First operand 3161 states and 4455 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:06,946 INFO L93 Difference]: Finished difference Result 4665 states and 7328 transitions. [2025-02-05 17:35:06,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:06,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-05 17:35:06,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:06,955 INFO L225 Difference]: With dead ends: 4665 [2025-02-05 17:35:06,955 INFO L226 Difference]: Without dead ends: 3912 [2025-02-05 17:35:06,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:06,957 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 812 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:06,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 547 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 17:35:06,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2025-02-05 17:35:07,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 3912. [2025-02-05 17:35:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3912 states, 3910 states have (on average 1.389769820971867) internal successors, (5434), 3911 states have internal predecessors, (5434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 5434 transitions. [2025-02-05 17:35:07,031 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 5434 transitions. Word has length 61 [2025-02-05 17:35:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:07,031 INFO L471 AbstractCegarLoop]: Abstraction has 3912 states and 5434 transitions. [2025-02-05 17:35:07,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 5434 transitions. [2025-02-05 17:35:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 17:35:07,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:07,032 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:07,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:35:07,033 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:07,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:07,034 INFO L85 PathProgramCache]: Analyzing trace with hash -250404215, now seen corresponding path program 1 times [2025-02-05 17:35:07,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:07,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714442697] [2025-02-05 17:35:07,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:07,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:07,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:35:07,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:35:07,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:07,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:07,390 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:07,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:07,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714442697] [2025-02-05 17:35:07,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714442697] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:07,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546177893] [2025-02-05 17:35:07,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:07,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:07,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:07,394 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-02-05 17:35:07,396 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-02-05 17:35:07,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:35:07,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:35:07,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:07,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:07,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 17:35:07,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:07,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:08,315 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:08,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546177893] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:08,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:08,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-02-05 17:35:08,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623042679] [2025-02-05 17:35:08,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:08,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 17:35:08,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:08,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 17:35:08,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-02-05 17:35:08,317 INFO L87 Difference]: Start difference. First operand 3912 states and 5434 transitions. Second operand has 21 states, 21 states have (on average 6.571428571428571) internal successors, (138), 20 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:08,657 INFO L93 Difference]: Finished difference Result 6056 states and 8138 transitions. [2025-02-05 17:35:08,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 17:35:08,658 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.571428571428571) internal successors, (138), 20 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-02-05 17:35:08,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:08,666 INFO L225 Difference]: With dead ends: 6056 [2025-02-05 17:35:08,666 INFO L226 Difference]: Without dead ends: 4018 [2025-02-05 17:35:08,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=693, Unknown=0, NotChecked=0, Total=930 [2025-02-05 17:35:08,670 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 13345 mSDsluCounter, 4642 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13345 SdHoareTripleChecker+Valid, 6137 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:08,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13345 Valid, 6137 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:35:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4018 states. [2025-02-05 17:35:08,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4018 to 3710. [2025-02-05 17:35:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3710 states, 3708 states have (on average 1.3888888888888888) internal successors, (5150), 3709 states have internal predecessors, (5150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5150 transitions. [2025-02-05 17:35:08,743 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5150 transitions. Word has length 62 [2025-02-05 17:35:08,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:08,743 INFO L471 AbstractCegarLoop]: Abstraction has 3710 states and 5150 transitions. [2025-02-05 17:35:08,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.571428571428571) internal successors, (138), 20 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5150 transitions. [2025-02-05 17:35:08,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 17:35:08,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:08,744 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:08,751 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-02-05 17:35:08,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 17:35:08,945 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:08,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:08,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2031332521, now seen corresponding path program 1 times [2025-02-05 17:35:08,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:08,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027091100] [2025-02-05 17:35:08,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:08,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:08,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:35:08,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:35:08,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:08,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:09,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:09,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027091100] [2025-02-05 17:35:09,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027091100] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:09,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448123485] [2025-02-05 17:35:09,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:09,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:09,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:09,214 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-02-05 17:35:09,216 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-02-05 17:35:09,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:35:09,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:35:09,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:09,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:09,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 17:35:09,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:09,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448123485] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:10,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:10,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 29 [2025-02-05 17:35:10,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170926557] [2025-02-05 17:35:10,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:10,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 17:35:10,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:10,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 17:35:10,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2025-02-05 17:35:10,379 INFO L87 Difference]: Start difference. First operand 3710 states and 5150 transitions. Second operand has 29 states, 29 states have (on average 5.379310344827586) internal successors, (156), 29 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:10,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:10,932 INFO L93 Difference]: Finished difference Result 7651 states and 10099 transitions. [2025-02-05 17:35:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:35:10,933 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.379310344827586) internal successors, (156), 29 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-02-05 17:35:10,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:10,945 INFO L225 Difference]: With dead ends: 7651 [2025-02-05 17:35:10,946 INFO L226 Difference]: Without dead ends: 5864 [2025-02-05 17:35:10,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=390, Invalid=1250, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 17:35:10,950 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 10594 mSDsluCounter, 6249 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10594 SdHoareTripleChecker+Valid, 7744 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:10,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10594 Valid, 7744 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:35:10,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5864 states. [2025-02-05 17:35:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5864 to 5798. [2025-02-05 17:35:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5798 states, 5796 states have (on average 1.3253968253968254) internal successors, (7682), 5797 states have internal predecessors, (7682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5798 states to 5798 states and 7682 transitions. [2025-02-05 17:35:11,135 INFO L78 Accepts]: Start accepts. Automaton has 5798 states and 7682 transitions. Word has length 62 [2025-02-05 17:35:11,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:11,136 INFO L471 AbstractCegarLoop]: Abstraction has 5798 states and 7682 transitions. [2025-02-05 17:35:11,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.379310344827586) internal successors, (156), 29 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 5798 states and 7682 transitions. [2025-02-05 17:35:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 17:35:11,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:11,137 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:11,150 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-02-05 17:35:11,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:11,340 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:11,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:11,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1177805111, now seen corresponding path program 1 times [2025-02-05 17:35:11,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:11,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006018303] [2025-02-05 17:35:11,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:11,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:11,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:35:11,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:35:11,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:11,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:11,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:11,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006018303] [2025-02-05 17:35:11,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006018303] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:11,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653292172] [2025-02-05 17:35:11,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:11,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:11,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:11,690 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-02-05 17:35:11,698 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-02-05 17:35:11,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:35:11,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:35:11,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:11,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:11,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 17:35:11,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:12,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:12,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653292172] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:12,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:12,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2025-02-05 17:35:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649831850] [2025-02-05 17:35:12,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:12,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 17:35:12,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:12,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 17:35:12,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2025-02-05 17:35:12,979 INFO L87 Difference]: Start difference. First operand 5798 states and 7682 transitions. Second operand has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:14,556 INFO L93 Difference]: Finished difference Result 12055 states and 15439 transitions. [2025-02-05 17:35:14,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-05 17:35:14,556 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-02-05 17:35:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:14,572 INFO L225 Difference]: With dead ends: 12055 [2025-02-05 17:35:14,572 INFO L226 Difference]: Without dead ends: 8291 [2025-02-05 17:35:14,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=704, Invalid=2836, Unknown=0, NotChecked=0, Total=3540 [2025-02-05 17:35:14,579 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 15862 mSDsluCounter, 12311 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15862 SdHoareTripleChecker+Valid, 13820 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:14,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15862 Valid, 13820 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:35:14,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8291 states. [2025-02-05 17:35:14,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8291 to 8279. [2025-02-05 17:35:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8279 states, 8277 states have (on average 1.2860939954089645) internal successors, (10645), 8278 states have internal predecessors, (10645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:14,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8279 states to 8279 states and 10645 transitions. [2025-02-05 17:35:14,759 INFO L78 Accepts]: Start accepts. Automaton has 8279 states and 10645 transitions. Word has length 62 [2025-02-05 17:35:14,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:14,759 INFO L471 AbstractCegarLoop]: Abstraction has 8279 states and 10645 transitions. [2025-02-05 17:35:14,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:14,759 INFO L276 IsEmpty]: Start isEmpty. Operand 8279 states and 10645 transitions. [2025-02-05 17:35:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 17:35:14,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:14,760 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:14,767 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-02-05 17:35:14,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:14,966 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:14,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:14,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1578127067, now seen corresponding path program 1 times [2025-02-05 17:35:14,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:14,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207780050] [2025-02-05 17:35:14,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:14,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:14,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 17:35:14,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 17:35:14,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:14,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:15,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:15,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207780050] [2025-02-05 17:35:15,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207780050] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:15,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369487845] [2025-02-05 17:35:15,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:15,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:15,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:15,902 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-02-05 17:35:15,904 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-02-05 17:35:15,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 17:35:16,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 17:35:16,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:16,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:16,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-05 17:35:16,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:17,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:19,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369487845] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:19,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:19,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21, 20] total 49 [2025-02-05 17:35:19,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791612136] [2025-02-05 17:35:19,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:19,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-05 17:35:19,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:19,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-05 17:35:19,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2123, Unknown=0, NotChecked=0, Total=2352 [2025-02-05 17:35:19,627 INFO L87 Difference]: Start difference. First operand 8279 states and 10645 transitions. Second operand has 49 states, 49 states have (on average 3.5306122448979593) internal successors, (173), 49 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:45,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:45,573 INFO L93 Difference]: Finished difference Result 23994 states and 29830 transitions. [2025-02-05 17:35:45,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2025-02-05 17:35:45,573 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.5306122448979593) internal successors, (173), 49 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 17:35:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:45,701 INFO L225 Difference]: With dead ends: 23994 [2025-02-05 17:35:45,701 INFO L226 Difference]: Without dead ends: 19834 [2025-02-05 17:35:45,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18967 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=6870, Invalid=43530, Unknown=0, NotChecked=0, Total=50400 [2025-02-05 17:35:45,725 INFO L435 NwaCegarLoop]: 1609 mSDtfsCounter, 21994 mSDsluCounter, 27007 mSDsCounter, 0 mSdLazyCounter, 3358 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21994 SdHoareTripleChecker+Valid, 28616 SdHoareTripleChecker+Invalid, 3515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 3358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:45,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21994 Valid, 28616 Invalid, 3515 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [157 Valid, 3358 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 17:35:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19834 states. [2025-02-05 17:35:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19834 to 7836. [2025-02-05 17:35:46,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7836 states, 7834 states have (on average 1.2935920347204493) internal successors, (10134), 7835 states have internal predecessors, (10134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7836 states to 7836 states and 10134 transitions. [2025-02-05 17:35:46,358 INFO L78 Accepts]: Start accepts. Automaton has 7836 states and 10134 transitions. Word has length 63 [2025-02-05 17:35:46,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:46,359 INFO L471 AbstractCegarLoop]: Abstraction has 7836 states and 10134 transitions. [2025-02-05 17:35:46,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.5306122448979593) internal successors, (173), 49 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:46,359 INFO L276 IsEmpty]: Start isEmpty. Operand 7836 states and 10134 transitions. [2025-02-05 17:35:46,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:35:46,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:46,362 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:46,372 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-02-05 17:35:46,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:46,563 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:46,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:46,567 INFO L85 PathProgramCache]: Analyzing trace with hash -76088125, now seen corresponding path program 1 times [2025-02-05 17:35:46,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:46,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365052334] [2025-02-05 17:35:46,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:46,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:46,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:35:46,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:35:46,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:46,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:48,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:48,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365052334] [2025-02-05 17:35:48,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365052334] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:48,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306799907] [2025-02-05 17:35:48,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:48,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:48,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:48,767 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-02-05 17:35:48,782 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-02-05 17:35:48,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:35:48,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:35:48,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:48,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:48,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-05 17:35:48,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:50,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:53,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306799907] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:53,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:53,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 54 [2025-02-05 17:35:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628041859] [2025-02-05 17:35:53,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:53,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-05 17:35:53,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:53,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-05 17:35:53,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2581, Unknown=0, NotChecked=0, Total=2862 [2025-02-05 17:35:53,223 INFO L87 Difference]: Start difference. First operand 7836 states and 10134 transitions. Second operand has 54 states, 54 states have (on average 3.1666666666666665) internal successors, (171), 54 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)