./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-33.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version c00e63dc
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-33.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 28f14d75de89afae09449709ada95c31646c3d0705a1364fd113ea63ae6b9c48
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 23:57:44,338 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 23:57:44,397 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 23:57:44,402 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 23:57:44,402 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 23:57:44,421 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 23:57:44,423 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 23:57:44,423 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 23:57:44,423 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 23:57:44,423 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 23:57:44,424 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 23:57:44,424 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 23:57:44,424 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 23:57:44,424 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 23:57:44,424 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 23:57:44,424 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 23:57:44,425 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 23:57:44,425 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 23:57:44,425 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 23:57:44,425 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 23:57:44,425 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 23:57:44,425 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 23:57:44,426 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 23:57:44,426 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 23:57:44,426 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 23:57:44,426 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 23:57:44,426 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 23:57:44,426 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 23:57:44,426 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 23:57:44,426 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 23:57:44,426 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 23:57:44,426 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 23:57:44,426 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 23:57:44,426 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 23:57:44,426 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 23:57:44,426 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 23:57:44,426 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 23:57:44,426 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 23:57:44,427 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 23:57:44,427 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 23:57:44,427 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 23:57:44,427 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 23:57:44,427 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 23:57:44,427 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 -> 28f14d75de89afae09449709ada95c31646c3d0705a1364fd113ea63ae6b9c48
[2025-02-05 23:57:44,643 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 23:57:44,648 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 23:57:44,650 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 23:57:44,651 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 23:57:44,651 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 23:57:44,652 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-33.i
[2025-02-05 23:57:45,776 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/53b4238f4/16422488e0ca4128a2e8d30b8efe36f7/FLAGb19395034
[2025-02-05 23:57:46,072 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 23:57:46,072 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-33.i
[2025-02-05 23:57:46,079 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/53b4238f4/16422488e0ca4128a2e8d30b8efe36f7/FLAGb19395034
[2025-02-05 23:57:46,349 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/53b4238f4/16422488e0ca4128a2e8d30b8efe36f7
[2025-02-05 23:57:46,351 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 23:57:46,352 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 23:57:46,353 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 23:57:46,353 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 23:57:46,356 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 23:57:46,357 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:57:46" (1/1) ...
[2025-02-05 23:57:46,357 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c7e046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:46, skipping insertion in model container
[2025-02-05 23:57:46,359 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:57:46" (1/1) ...
[2025-02-05 23:57:46,375 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 23:57:46,468 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-33.i[919,932]
[2025-02-05 23:57:46,514 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 23:57:46,525 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 23:57:46,531 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-33.i[919,932]
[2025-02-05 23:57:46,563 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 23:57:46,583 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 23:57:46,584 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:46 WrapperNode
[2025-02-05 23:57:46,584 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 23:57:46,585 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 23:57:46,585 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 23:57:46,585 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 23:57:46,589 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:46" (1/1) ...
[2025-02-05 23:57:46,597 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:46" (1/1) ...
[2025-02-05 23:57:46,626 INFO  L138                Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223
[2025-02-05 23:57:46,626 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 23:57:46,627 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 23:57:46,627 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 23:57:46,627 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 23:57:46,635 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:46" (1/1) ...
[2025-02-05 23:57:46,635 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:46" (1/1) ...
[2025-02-05 23:57:46,640 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:46" (1/1) ...
[2025-02-05 23:57:46,654 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 23:57:46,662 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:46" (1/1) ...
[2025-02-05 23:57:46,662 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:46" (1/1) ...
[2025-02-05 23:57:46,669 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:46" (1/1) ...
[2025-02-05 23:57:46,671 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:46" (1/1) ...
[2025-02-05 23:57:46,673 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:46" (1/1) ...
[2025-02-05 23:57:46,673 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:46" (1/1) ...
[2025-02-05 23:57:46,676 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 23:57:46,677 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 23:57:46,677 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 23:57:46,677 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 23:57:46,678 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:46" (1/1) ...
[2025-02-05 23:57:46,681 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 23:57:46,690 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 23:57:46,706 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 23:57:46,712 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 23:57:46,726 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 23:57:46,727 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-05 23:57:46,727 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-05 23:57:46,727 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 23:57:46,727 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 23:57:46,727 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 23:57:46,784 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 23:57:46,785 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 23:57:47,092 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L184: havoc property_#t~ite23#1;havoc property_#t~bitwise22#1;
[2025-02-05 23:57:47,121 INFO  L?                        ?]: Removed 15 outVars from TransFormulas that were not future-live.
[2025-02-05 23:57:47,121 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 23:57:47,139 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 23:57:47,141 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 23:57:47,141 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:57:47 BoogieIcfgContainer
[2025-02-05 23:57:47,141 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 23:57:47,143 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 23:57:47,144 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 23:57:47,147 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 23:57:47,147 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:57:46" (1/3) ...
[2025-02-05 23:57:47,148 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5278f6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:57:47, skipping insertion in model container
[2025-02-05 23:57:47,148 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:57:46" (2/3) ...
[2025-02-05 23:57:47,149 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5278f6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:57:47, skipping insertion in model container
[2025-02-05 23:57:47,149 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:57:47" (3/3) ...
[2025-02-05 23:57:47,150 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-33.i
[2025-02-05 23:57:47,162 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 23:57:47,164 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-33.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 23:57:47,209 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 23:57:47,216 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;@884db7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 23:57:47,217 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 23:57:47,220 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 99 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2025-02-05 23:57:47,232 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 214
[2025-02-05 23:57:47,232 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:57:47,233 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:47,233 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:57:47,236 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:57:47,237 INFO  L85        PathProgramCache]: Analyzing trace with hash -1189513390, now seen corresponding path program 1 times
[2025-02-05 23:57:47,242 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:57:47,242 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911418728]
[2025-02-05 23:57:47,242 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:57:47,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:57:47,343 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-02-05 23:57:47,360 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-02-05 23:57:47,360 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:57:47,361 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:57:47,543 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked.
[2025-02-05 23:57:47,544 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:57:47,544 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911418728]
[2025-02-05 23:57:47,545 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911418728] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 23:57:47,545 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838763520]
[2025-02-05 23:57:47,545 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:57:47,545 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 23:57:47,545 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 23:57:47,553 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 23:57:47,554 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 23:57:47,636 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-02-05 23:57:47,711 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-02-05 23:57:47,711 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:57:47,711 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:57:47,714 INFO  L256         TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-05 23:57:47,723 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 23:57:47,752 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked.
[2025-02-05 23:57:47,756 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 23:57:47,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [838763520] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:57:47,757 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 23:57:47,757 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-05 23:57:47,758 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510714353]
[2025-02-05 23:57:47,760 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:57:47,763 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 23:57:47,763 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:57:47,777 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 23:57:47,777 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 23:57:47,779 INFO  L87              Difference]: Start difference. First operand  has 99 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand  has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34)
[2025-02-05 23:57:47,800 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:57:47,800 INFO  L93              Difference]: Finished difference Result 190 states and 337 transitions.
[2025-02-05 23:57:47,801 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 23:57:47,802 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 213
[2025-02-05 23:57:47,802 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:57:47,806 INFO  L225             Difference]: With dead ends: 190
[2025-02-05 23:57:47,807 INFO  L226             Difference]: Without dead ends: 94
[2025-02-05 23:57:47,809 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 214 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 23:57:47,810 INFO  L435           NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 23:57:47,811 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 23:57:47,819 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2025-02-05 23:57:47,834 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2025-02-05 23:57:47,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 58 states have internal predecessors, (76), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2025-02-05 23:57:47,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 144 transitions.
[2025-02-05 23:57:47,843 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 144 transitions. Word has length 213
[2025-02-05 23:57:47,843 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:57:47,843 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 144 transitions.
[2025-02-05 23:57:47,843 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34)
[2025-02-05 23:57:47,843 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 144 transitions.
[2025-02-05 23:57:47,846 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 214
[2025-02-05 23:57:47,846 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:57:47,846 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:47,855 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 23:57:48,052 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-02-05 23:57:48,053 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:57:48,054 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:57:48,054 INFO  L85        PathProgramCache]: Analyzing trace with hash 1975255760, now seen corresponding path program 1 times
[2025-02-05 23:57:48,054 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:57:48,054 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554322707]
[2025-02-05 23:57:48,054 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:57:48,055 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:57:48,088 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-02-05 23:57:48,242 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-02-05 23:57:48,242 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:57:48,242 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:57:49,087 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-02-05 23:57:49,091 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:57:49,092 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554322707]
[2025-02-05 23:57:49,092 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554322707] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:57:49,092 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:57:49,092 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 23:57:49,092 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486720850]
[2025-02-05 23:57:49,092 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:57:49,093 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 23:57:49,093 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:57:49,096 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 23:57:49,096 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 23:57:49,096 INFO  L87              Difference]: Start difference. First operand 94 states and 144 transitions. Second operand  has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34)
[2025-02-05 23:57:49,377 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:57:49,377 INFO  L93              Difference]: Finished difference Result 260 states and 404 transitions.
[2025-02-05 23:57:49,378 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 23:57:49,378 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 213
[2025-02-05 23:57:49,379 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:57:49,381 INFO  L225             Difference]: With dead ends: 260
[2025-02-05 23:57:49,381 INFO  L226             Difference]: Without dead ends: 169
[2025-02-05 23:57:49,381 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 23:57:49,382 INFO  L435           NwaCegarLoop]: 133 mSDtfsCounter, 77 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 23:57:49,382 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 394 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 23:57:49,383 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 169 states.
[2025-02-05 23:57:49,413 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152.
[2025-02-05 23:57:49,414 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 152 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68)
[2025-02-05 23:57:49,415 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 235 transitions.
[2025-02-05 23:57:49,416 INFO  L78                 Accepts]: Start accepts. Automaton has 152 states and 235 transitions. Word has length 213
[2025-02-05 23:57:49,416 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:57:49,416 INFO  L471      AbstractCegarLoop]: Abstraction has 152 states and 235 transitions.
[2025-02-05 23:57:49,416 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34)
[2025-02-05 23:57:49,417 INFO  L276                IsEmpty]: Start isEmpty. Operand 152 states and 235 transitions.
[2025-02-05 23:57:49,419 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 214
[2025-02-05 23:57:49,419 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:57:49,419 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:49,419 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 23:57:49,419 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:57:49,420 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:57:49,420 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108360623, now seen corresponding path program 1 times
[2025-02-05 23:57:49,420 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:57:49,420 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531957575]
[2025-02-05 23:57:49,420 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:57:49,420 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:57:49,436 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-02-05 23:57:49,544 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-02-05 23:57:49,547 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:57:49,548 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:57:49,955 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-02-05 23:57:49,955 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:57:49,955 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531957575]
[2025-02-05 23:57:49,955 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531957575] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:57:49,955 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:57:49,955 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 23:57:49,955 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300435632]
[2025-02-05 23:57:49,955 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:57:49,956 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 23:57:49,956 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:57:49,956 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 23:57:49,957 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 23:57:49,957 INFO  L87              Difference]: Start difference. First operand 152 states and 235 transitions. Second operand  has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-02-05 23:57:50,203 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:57:50,204 INFO  L93              Difference]: Finished difference Result 281 states and 433 transitions.
[2025-02-05 23:57:50,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 23:57:50,204 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 213
[2025-02-05 23:57:50,205 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:57:50,206 INFO  L225             Difference]: With dead ends: 281
[2025-02-05 23:57:50,207 INFO  L226             Difference]: Without dead ends: 190
[2025-02-05 23:57:50,207 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 23:57:50,208 INFO  L435           NwaCegarLoop]: 118 mSDtfsCounter, 96 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 23:57:50,208 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 351 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 23:57:50,208 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 190 states.
[2025-02-05 23:57:50,233 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176.
[2025-02-05 23:57:50,233 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 176 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68)
[2025-02-05 23:57:50,235 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 272 transitions.
[2025-02-05 23:57:50,236 INFO  L78                 Accepts]: Start accepts. Automaton has 176 states and 272 transitions. Word has length 213
[2025-02-05 23:57:50,236 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:57:50,236 INFO  L471      AbstractCegarLoop]: Abstraction has 176 states and 272 transitions.
[2025-02-05 23:57:50,237 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-02-05 23:57:50,237 INFO  L276                IsEmpty]: Start isEmpty. Operand 176 states and 272 transitions.
[2025-02-05 23:57:50,239 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 215
[2025-02-05 23:57:50,239 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:57:50,239 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:50,239 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 23:57:50,240 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:57:50,240 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:57:50,240 INFO  L85        PathProgramCache]: Analyzing trace with hash 806257817, now seen corresponding path program 1 times
[2025-02-05 23:57:50,240 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:57:50,240 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630736858]
[2025-02-05 23:57:50,240 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:57:50,241 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:57:50,255 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes.
[2025-02-05 23:57:50,275 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements.
[2025-02-05 23:57:50,276 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:57:50,276 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:57:50,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-02-05 23:57:50,464 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:57:50,464 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630736858]
[2025-02-05 23:57:50,464 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630736858] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:57:50,464 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:57:50,464 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 23:57:50,465 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401102234]
[2025-02-05 23:57:50,465 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:57:50,465 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 23:57:50,465 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:57:50,465 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 23:57:50,465 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 23:57:50,466 INFO  L87              Difference]: Start difference. First operand 176 states and 272 transitions. Second operand  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-02-05 23:57:50,665 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:57:50,665 INFO  L93              Difference]: Finished difference Result 290 states and 444 transitions.
[2025-02-05 23:57:50,666 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 23:57:50,666 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214
[2025-02-05 23:57:50,666 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:57:50,668 INFO  L225             Difference]: With dead ends: 290
[2025-02-05 23:57:50,668 INFO  L226             Difference]: Without dead ends: 186
[2025-02-05 23:57:50,668 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 23:57:50,669 INFO  L435           NwaCegarLoop]: 124 mSDtfsCounter, 93 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 23:57:50,669 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 369 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 23:57:50,669 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 186 states.
[2025-02-05 23:57:50,695 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 177.
[2025-02-05 23:57:50,696 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 177 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 106 states have internal predecessors, (136), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68)
[2025-02-05 23:57:50,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 272 transitions.
[2025-02-05 23:57:50,698 INFO  L78                 Accepts]: Start accepts. Automaton has 177 states and 272 transitions. Word has length 214
[2025-02-05 23:57:50,698 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:57:50,698 INFO  L471      AbstractCegarLoop]: Abstraction has 177 states and 272 transitions.
[2025-02-05 23:57:50,699 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-02-05 23:57:50,699 INFO  L276                IsEmpty]: Start isEmpty. Operand 177 states and 272 transitions.
[2025-02-05 23:57:50,700 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2025-02-05 23:57:50,701 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:57:50,701 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:57:50,701 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 23:57:50,701 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:57:50,702 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:57:50,702 INFO  L85        PathProgramCache]: Analyzing trace with hash 687245747, now seen corresponding path program 1 times
[2025-02-05 23:57:50,702 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:57:50,702 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518500264]
[2025-02-05 23:57:50,702 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:57:50,702 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:57:50,714 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-02-05 23:57:50,846 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-02-05 23:57:50,847 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:57:50,847 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:58:00,167 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-02-05 23:58:00,167 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:58:00,167 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518500264]
[2025-02-05 23:58:00,167 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518500264] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:58:00,167 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:58:00,167 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-02-05 23:58:00,168 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448025219]
[2025-02-05 23:58:00,168 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:58:00,168 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-02-05 23:58:00,168 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:58:00,168 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-02-05 23:58:00,168 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156
[2025-02-05 23:58:00,169 INFO  L87              Difference]: Start difference. First operand 177 states and 272 transitions. Second operand  has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-02-05 23:58:02,362 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:58:02,362 INFO  L93              Difference]: Finished difference Result 238 states and 343 transitions.
[2025-02-05 23:58:02,362 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-02-05 23:58:02,363 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215
[2025-02-05 23:58:02,363 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:58:02,364 INFO  L225             Difference]: With dead ends: 238
[2025-02-05 23:58:02,364 INFO  L226             Difference]: Without dead ends: 236
[2025-02-05 23:58:02,364 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600
[2025-02-05 23:58:02,365 INFO  L435           NwaCegarLoop]: 118 mSDtfsCounter, 298 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 23:58:02,365 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 792 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 23:58:02,368 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 236 states.
[2025-02-05 23:58:02,393 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 191.
[2025-02-05 23:58:02,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 191 states, 120 states have (on average 1.275) internal successors, (153), 120 states have internal predecessors, (153), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68)
[2025-02-05 23:58:02,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 289 transitions.
[2025-02-05 23:58:02,396 INFO  L78                 Accepts]: Start accepts. Automaton has 191 states and 289 transitions. Word has length 215
[2025-02-05 23:58:02,398 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:58:02,398 INFO  L471      AbstractCegarLoop]: Abstraction has 191 states and 289 transitions.
[2025-02-05 23:58:02,398 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-02-05 23:58:02,399 INFO  L276                IsEmpty]: Start isEmpty. Operand 191 states and 289 transitions.
[2025-02-05 23:58:02,400 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2025-02-05 23:58:02,400 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:58:02,400 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:58:02,400 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 23:58:02,400 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:58:02,400 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:58:02,400 INFO  L85        PathProgramCache]: Analyzing trace with hash 490732242, now seen corresponding path program 1 times
[2025-02-05 23:58:02,400 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:58:02,401 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305689902]
[2025-02-05 23:58:02,401 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:58:02,401 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:58:02,410 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-02-05 23:58:02,493 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-02-05 23:58:02,494 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:58:02,494 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:58:07,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 6 proven. 93 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked.
[2025-02-05 23:58:07,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:58:07,877 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305689902]
[2025-02-05 23:58:07,877 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305689902] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 23:58:07,877 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810689354]
[2025-02-05 23:58:07,877 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:58:07,877 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 23:58:07,878 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 23:58:07,881 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 23:58:07,882 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 23:58:07,930 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-02-05 23:58:07,978 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-02-05 23:58:07,978 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:58:07,978 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:58:07,985 INFO  L256         TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 31 conjuncts are in the unsatisfiable core
[2025-02-05 23:58:07,995 INFO  L279         TraceCheckSpWp]: Computing forward predicates...