./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i --full-output --architecture 32bit


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


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

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 21:07:22,133 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 21:07:22,185 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 21:07:22,191 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 21:07:22,193 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 21:07:22,214 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 21:07:22,215 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 21:07:22,215 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 21:07:22,215 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 21:07:22,215 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 21:07:22,216 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 21:07:22,216 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 21:07:22,216 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 21:07:22,217 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 21:07:22,217 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 21:07:22,217 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 21:07:22,217 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 21:07:22,217 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 21:07:22,217 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 21:07:22,218 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 21:07:22,218 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 21:07:22,218 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 21:07:22,218 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 21:07:22,218 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 21:07:22,218 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 21:07:22,218 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 21:07:22,218 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 21:07:22,218 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 21:07:22,218 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 21:07:22,218 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 21:07:22,218 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 21:07:22,218 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 21:07:22,219 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 21:07:22,219 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 21:07:22,219 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 21:07:22,219 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 21:07:22,219 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 21:07:22,219 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 21:07:22,219 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 21:07:22,220 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 21:07:22,220 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 21:07:22,220 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 21:07:22,220 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 21:07:22,220 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 -> c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63
[2025-02-05 21:07:22,442 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 21:07:22,449 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 21:07:22,451 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 21:07:22,451 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 21:07:22,452 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 21:07:22,453 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-02-05 21:07:23,586 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31e0d488a/35ac6d87e3a349d8ab701673d00c387f/FLAG59154a2a9
[2025-02-05 21:07:23,806 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 21:07:23,808 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-02-05 21:07:23,819 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31e0d488a/35ac6d87e3a349d8ab701673d00c387f/FLAG59154a2a9
[2025-02-05 21:07:24,152 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31e0d488a/35ac6d87e3a349d8ab701673d00c387f
[2025-02-05 21:07:24,154 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 21:07:24,155 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 21:07:24,156 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 21:07:24,156 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 21:07:24,159 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 21:07:24,159 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:07:24" (1/1) ...
[2025-02-05 21:07:24,160 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ef2832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:24, skipping insertion in model container
[2025-02-05 21:07:24,160 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:07:24" (1/1) ...
[2025-02-05 21:07:24,174 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 21:07:24,258 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929]
[2025-02-05 21:07:24,307 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 21:07:24,318 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 21:07:24,324 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929]
[2025-02-05 21:07:24,368 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 21:07:24,384 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 21:07:24,385 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:24 WrapperNode
[2025-02-05 21:07:24,386 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 21:07:24,387 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 21:07:24,387 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 21:07:24,387 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 21:07:24,392 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:24" (1/1) ...
[2025-02-05 21:07:24,404 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:24" (1/1) ...
[2025-02-05 21:07:24,438 INFO  L138                Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 315
[2025-02-05 21:07:24,442 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 21:07:24,443 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 21:07:24,443 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 21:07:24,443 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 21:07:24,449 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:24" (1/1) ...
[2025-02-05 21:07:24,449 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:24" (1/1) ...
[2025-02-05 21:07:24,453 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:24" (1/1) ...
[2025-02-05 21:07:24,469 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 21:07:24,471 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:24" (1/1) ...
[2025-02-05 21:07:24,471 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:24" (1/1) ...
[2025-02-05 21:07:24,480 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:24" (1/1) ...
[2025-02-05 21:07:24,482 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:24" (1/1) ...
[2025-02-05 21:07:24,486 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:24" (1/1) ...
[2025-02-05 21:07:24,487 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:24" (1/1) ...
[2025-02-05 21:07:24,492 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 21:07:24,493 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 21:07:24,493 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 21:07:24,493 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 21:07:24,494 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:24" (1/1) ...
[2025-02-05 21:07:24,497 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 21:07:24,506 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:07:24,520 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 21:07:24,522 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 21:07:24,539 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 21:07:24,539 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-05 21:07:24,539 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-05 21:07:24,540 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 21:07:24,540 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 21:07:24,540 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 21:07:24,617 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 21:07:24,619 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 21:07:25,025 INFO  L?                        ?]: Removed 18 outVars from TransFormulas that were not future-live.
[2025-02-05 21:07:25,025 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 21:07:25,043 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 21:07:25,045 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 21:07:25,045 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:07:25 BoogieIcfgContainer
[2025-02-05 21:07:25,045 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 21:07:25,047 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 21:07:25,047 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 21:07:25,051 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 21:07:25,051 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:07:24" (1/3) ...
[2025-02-05 21:07:25,051 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c845bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:07:25, skipping insertion in model container
[2025-02-05 21:07:25,052 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:24" (2/3) ...
[2025-02-05 21:07:25,052 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c845bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:07:25, skipping insertion in model container
[2025-02-05 21:07:25,052 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:07:25" (3/3) ...
[2025-02-05 21:07:25,053 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-02-05 21:07:25,063 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 21:07:25,066 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i that has 2 procedures, 132 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 21:07:25,103 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 21:07:25,110 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;@42ab8fd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 21:07:25,110 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 21:07:25,113 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 132 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 91 states have internal predecessors, (138), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39)
[2025-02-05 21:07:25,123 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 251
[2025-02-05 21:07:25,123 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:25,124 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:25,124 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:25,128 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:25,128 INFO  L85        PathProgramCache]: Analyzing trace with hash -344281931, now seen corresponding path program 1 times
[2025-02-05 21:07:25,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:25,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179166043]
[2025-02-05 21:07:25,133 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:25,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:25,212 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-02-05 21:07:25,235 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-02-05 21:07:25,236 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:25,236 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:25,450 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked.
[2025-02-05 21:07:25,450 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:25,450 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179166043]
[2025-02-05 21:07:25,450 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179166043] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 21:07:25,451 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931142812]
[2025-02-05 21:07:25,451 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:25,451 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 21:07:25,451 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:07:25,456 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 21:07:25,457 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 21:07:25,557 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-02-05 21:07:25,664 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-02-05 21:07:25,664 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:25,664 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:25,668 INFO  L256         TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-05 21:07:25,679 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 21:07:25,714 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked.
[2025-02-05 21:07:25,714 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 21:07:25,715 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [931142812] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:25,715 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 21:07:25,715 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-05 21:07:25,717 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43859003]
[2025-02-05 21:07:25,717 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:25,720 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 21:07:25,721 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:25,733 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 21:07:25,734 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 21:07:25,735 INFO  L87              Difference]: Start difference. First operand  has 132 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 91 states have internal predecessors, (138), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand  has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39)
[2025-02-05 21:07:25,778 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:25,778 INFO  L93              Difference]: Finished difference Result 258 states and 466 transitions.
[2025-02-05 21:07:25,779 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 21:07:25,780 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 250
[2025-02-05 21:07:25,780 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:25,787 INFO  L225             Difference]: With dead ends: 258
[2025-02-05 21:07:25,788 INFO  L226             Difference]: Without dead ends: 129
[2025-02-05 21:07:25,790 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 21:07:25,794 INFO  L435           NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:25,796 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:07:25,805 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2025-02-05 21:07:25,822 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129.
[2025-02-05 21:07:25,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 88 states have (on average 1.5) internal successors, (132), 88 states have internal predecessors, (132), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39)
[2025-02-05 21:07:25,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 210 transitions.
[2025-02-05 21:07:25,830 INFO  L78                 Accepts]: Start accepts. Automaton has 129 states and 210 transitions. Word has length 250
[2025-02-05 21:07:25,831 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:25,831 INFO  L471      AbstractCegarLoop]: Abstraction has 129 states and 210 transitions.
[2025-02-05 21:07:25,831 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39)
[2025-02-05 21:07:25,831 INFO  L276                IsEmpty]: Start isEmpty. Operand 129 states and 210 transitions.
[2025-02-05 21:07:25,835 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 251
[2025-02-05 21:07:25,837 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:25,837 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:25,844 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-05 21:07:26,037 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-02-05 21:07:26,038 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:26,038 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:26,038 INFO  L85        PathProgramCache]: Analyzing trace with hash 1829787124, now seen corresponding path program 1 times
[2025-02-05 21:07:26,038 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:26,039 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650819750]
[2025-02-05 21:07:26,039 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:26,039 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:26,067 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-02-05 21:07:26,123 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-02-05 21:07:26,126 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:26,126 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:26,318 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:26,319 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:26,319 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650819750]
[2025-02-05 21:07:26,319 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650819750] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:26,319 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:26,319 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:07:26,319 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079525647]
[2025-02-05 21:07:26,319 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:26,320 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 21:07:26,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:26,320 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 21:07:26,320 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:07:26,323 INFO  L87              Difference]: Start difference. First operand 129 states and 210 transitions. Second operand  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:26,387 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:26,387 INFO  L93              Difference]: Finished difference Result 322 states and 522 transitions.
[2025-02-05 21:07:26,387 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 21:07:26,388 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 250
[2025-02-05 21:07:26,389 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:26,392 INFO  L225             Difference]: With dead ends: 322
[2025-02-05 21:07:26,392 INFO  L226             Difference]: Without dead ends: 196
[2025-02-05 21:07:26,393 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:07:26,394 INFO  L435           NwaCegarLoop]: 297 mSDtfsCounter, 200 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:26,394 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 403 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:07:26,395 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2025-02-05 21:07:26,428 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 129.
[2025-02-05 21:07:26,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 states have internal predecessors, (130), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39)
[2025-02-05 21:07:26,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 208 transitions.
[2025-02-05 21:07:26,430 INFO  L78                 Accepts]: Start accepts. Automaton has 129 states and 208 transitions. Word has length 250
[2025-02-05 21:07:26,432 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:26,432 INFO  L471      AbstractCegarLoop]: Abstraction has 129 states and 208 transitions.
[2025-02-05 21:07:26,432 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:26,432 INFO  L276                IsEmpty]: Start isEmpty. Operand 129 states and 208 transitions.
[2025-02-05 21:07:26,434 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 252
[2025-02-05 21:07:26,435 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:26,435 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:26,435 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 21:07:26,435 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:26,435 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:26,435 INFO  L85        PathProgramCache]: Analyzing trace with hash 331106021, now seen corresponding path program 1 times
[2025-02-05 21:07:26,435 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:26,436 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477325868]
[2025-02-05 21:07:26,437 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:26,437 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:26,460 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes.
[2025-02-05 21:07:26,493 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements.
[2025-02-05 21:07:26,494 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:26,494 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:26,767 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:26,768 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:26,768 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477325868]
[2025-02-05 21:07:26,769 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477325868] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:26,770 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:26,770 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 21:07:26,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140809852]
[2025-02-05 21:07:26,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:26,771 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 21:07:26,771 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:26,772 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 21:07:26,772 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:07:26,772 INFO  L87              Difference]: Start difference. First operand 129 states and 208 transitions. Second operand  has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:27,003 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:27,004 INFO  L93              Difference]: Finished difference Result 351 states and 567 transitions.
[2025-02-05 21:07:27,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 21:07:27,004 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 251
[2025-02-05 21:07:27,005 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:27,008 INFO  L225             Difference]: With dead ends: 351
[2025-02-05 21:07:27,009 INFO  L226             Difference]: Without dead ends: 225
[2025-02-05 21:07:27,009 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:07:27,010 INFO  L435           NwaCegarLoop]: 243 mSDtfsCounter, 288 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:27,010 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 643 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 21:07:27,011 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 225 states.
[2025-02-05 21:07:27,027 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 149.
[2025-02-05 21:07:27,028 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 149 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 107 states have internal predecessors, (160), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39)
[2025-02-05 21:07:27,028 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 238 transitions.
[2025-02-05 21:07:27,029 INFO  L78                 Accepts]: Start accepts. Automaton has 149 states and 238 transitions. Word has length 251
[2025-02-05 21:07:27,029 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:27,029 INFO  L471      AbstractCegarLoop]: Abstraction has 149 states and 238 transitions.
[2025-02-05 21:07:27,029 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:27,032 INFO  L276                IsEmpty]: Start isEmpty. Operand 149 states and 238 transitions.
[2025-02-05 21:07:27,034 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-02-05 21:07:27,034 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:27,034 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:27,034 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 21:07:27,034 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:27,035 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:27,035 INFO  L85        PathProgramCache]: Analyzing trace with hash 1098140009, now seen corresponding path program 1 times
[2025-02-05 21:07:27,035 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:27,035 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595495633]
[2025-02-05 21:07:27,035 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:27,035 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:27,054 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-02-05 21:07:27,073 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-02-05 21:07:27,073 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:27,073 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:27,202 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:27,203 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:27,203 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595495633]
[2025-02-05 21:07:27,203 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595495633] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:27,203 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:27,203 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:07:27,203 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580802377]
[2025-02-05 21:07:27,203 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:27,203 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 21:07:27,203 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:27,204 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 21:07:27,204 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:07:27,204 INFO  L87              Difference]: Start difference. First operand 149 states and 238 transitions. Second operand  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:27,234 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:27,234 INFO  L93              Difference]: Finished difference Result 296 states and 475 transitions.
[2025-02-05 21:07:27,236 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 21:07:27,236 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252
[2025-02-05 21:07:27,237 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:27,238 INFO  L225             Difference]: With dead ends: 296
[2025-02-05 21:07:27,238 INFO  L226             Difference]: Without dead ends: 150
[2025-02-05 21:07:27,238 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:07:27,239 INFO  L435           NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:27,239 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:07:27,242 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2025-02-05 21:07:27,248 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150.
[2025-02-05 21:07:27,248 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 150 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 108 states have internal predecessors, (161), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39)
[2025-02-05 21:07:27,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 239 transitions.
[2025-02-05 21:07:27,249 INFO  L78                 Accepts]: Start accepts. Automaton has 150 states and 239 transitions. Word has length 252
[2025-02-05 21:07:27,250 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:27,250 INFO  L471      AbstractCegarLoop]: Abstraction has 150 states and 239 transitions.
[2025-02-05 21:07:27,250 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:27,250 INFO  L276                IsEmpty]: Start isEmpty. Operand 150 states and 239 transitions.
[2025-02-05 21:07:27,251 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-02-05 21:07:27,251 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:27,252 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:27,252 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 21:07:27,252 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:27,252 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:27,252 INFO  L85        PathProgramCache]: Analyzing trace with hash 101067656, now seen corresponding path program 1 times
[2025-02-05 21:07:27,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:27,252 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430347622]
[2025-02-05 21:07:27,252 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:27,252 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:27,265 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-02-05 21:07:27,278 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-02-05 21:07:27,278 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:27,278 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:27,365 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:27,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:27,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430347622]
[2025-02-05 21:07:27,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430347622] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:27,366 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:27,366 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:07:27,366 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684060707]
[2025-02-05 21:07:27,366 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:27,366 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 21:07:27,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:27,367 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 21:07:27,367 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:07:27,367 INFO  L87              Difference]: Start difference. First operand 150 states and 239 transitions. Second operand  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:27,410 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:27,411 INFO  L93              Difference]: Finished difference Result 408 states and 651 transitions.
[2025-02-05 21:07:27,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 21:07:27,411 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252
[2025-02-05 21:07:27,412 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:27,414 INFO  L225             Difference]: With dead ends: 408
[2025-02-05 21:07:27,415 INFO  L226             Difference]: Without dead ends: 261
[2025-02-05 21:07:27,415 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:07:27,416 INFO  L435           NwaCegarLoop]: 300 mSDtfsCounter, 138 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:27,417 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 487 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:07:27,417 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 261 states.
[2025-02-05 21:07:27,433 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258.
[2025-02-05 21:07:27,435 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 258 states, 192 states have (on average 1.5) internal successors, (288), 193 states have internal predecessors, (288), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61)
[2025-02-05 21:07:27,436 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 410 transitions.
[2025-02-05 21:07:27,436 INFO  L78                 Accepts]: Start accepts. Automaton has 258 states and 410 transitions. Word has length 252
[2025-02-05 21:07:27,437 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:27,437 INFO  L471      AbstractCegarLoop]: Abstraction has 258 states and 410 transitions.
[2025-02-05 21:07:27,437 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:27,437 INFO  L276                IsEmpty]: Start isEmpty. Operand 258 states and 410 transitions.
[2025-02-05 21:07:27,441 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-02-05 21:07:27,441 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:27,441 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:27,441 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 21:07:27,441 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:27,442 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:27,442 INFO  L85        PathProgramCache]: Analyzing trace with hash 1062681673, now seen corresponding path program 1 times
[2025-02-05 21:07:27,442 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:27,442 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043042875]
[2025-02-05 21:07:27,442 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:27,442 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:27,463 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-02-05 21:07:27,489 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-02-05 21:07:27,490 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:27,490 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:27,731 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:27,732 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:27,732 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043042875]
[2025-02-05 21:07:27,732 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043042875] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:27,732 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:27,732 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 21:07:27,732 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892989875]
[2025-02-05 21:07:27,732 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:27,733 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 21:07:27,733 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:27,734 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 21:07:27,734 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-02-05 21:07:27,734 INFO  L87              Difference]: Start difference. First operand 258 states and 410 transitions. Second operand  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:27,991 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:27,993 INFO  L93              Difference]: Finished difference Result 671 states and 1071 transitions.
[2025-02-05 21:07:27,994 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 21:07:27,994 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252
[2025-02-05 21:07:27,994 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:28,000 INFO  L225             Difference]: With dead ends: 671
[2025-02-05 21:07:28,000 INFO  L226             Difference]: Without dead ends: 416
[2025-02-05 21:07:28,001 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42
[2025-02-05 21:07:28,002 INFO  L435           NwaCegarLoop]: 243 mSDtfsCounter, 443 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:28,002 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 587 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 21:07:28,003 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 416 states.
[2025-02-05 21:07:28,023 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 260.
[2025-02-05 21:07:28,024 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 260 states, 194 states have (on average 1.5051546391752577) internal successors, (292), 195 states have internal predecessors, (292), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61)
[2025-02-05 21:07:28,026 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 414 transitions.
[2025-02-05 21:07:28,026 INFO  L78                 Accepts]: Start accepts. Automaton has 260 states and 414 transitions. Word has length 252
[2025-02-05 21:07:28,027 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:28,027 INFO  L471      AbstractCegarLoop]: Abstraction has 260 states and 414 transitions.
[2025-02-05 21:07:28,027 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:28,029 INFO  L276                IsEmpty]: Start isEmpty. Operand 260 states and 414 transitions.
[2025-02-05 21:07:28,030 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-02-05 21:07:28,031 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:28,031 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:28,031 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 21:07:28,031 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:28,032 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:28,032 INFO  L85        PathProgramCache]: Analyzing trace with hash -1987521142, now seen corresponding path program 1 times
[2025-02-05 21:07:28,032 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:28,032 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695866223]
[2025-02-05 21:07:28,032 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:28,032 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:28,048 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-02-05 21:07:28,065 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-02-05 21:07:28,066 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:28,066 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:28,433 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:28,434 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:28,434 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695866223]
[2025-02-05 21:07:28,434 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695866223] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:28,434 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:28,434 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 21:07:28,434 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536637280]
[2025-02-05 21:07:28,434 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:28,434 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 21:07:28,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:28,435 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 21:07:28,435 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 21:07:28,435 INFO  L87              Difference]: Start difference. First operand 260 states and 414 transitions. Second operand  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:29,000 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:29,000 INFO  L93              Difference]: Finished difference Result 963 states and 1523 transitions.
[2025-02-05 21:07:29,000 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 21:07:29,001 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252
[2025-02-05 21:07:29,001 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:29,006 INFO  L225             Difference]: With dead ends: 963
[2025-02-05 21:07:29,006 INFO  L226             Difference]: Without dead ends: 706
[2025-02-05 21:07:29,006 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2025-02-05 21:07:29,007 INFO  L435           NwaCegarLoop]: 469 mSDtfsCounter, 506 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:29,007 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 958 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 21:07:29,009 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 706 states.
[2025-02-05 21:07:29,038 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 260.
[2025-02-05 21:07:29,039 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 260 states, 194 states have (on average 1.4948453608247423) internal successors, (290), 195 states have internal predecessors, (290), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61)
[2025-02-05 21:07:29,040 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 412 transitions.
[2025-02-05 21:07:29,041 INFO  L78                 Accepts]: Start accepts. Automaton has 260 states and 412 transitions. Word has length 252
[2025-02-05 21:07:29,042 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:29,042 INFO  L471      AbstractCegarLoop]: Abstraction has 260 states and 412 transitions.
[2025-02-05 21:07:29,042 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:29,042 INFO  L276                IsEmpty]: Start isEmpty. Operand 260 states and 412 transitions.
[2025-02-05 21:07:29,044 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-02-05 21:07:29,044 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:29,044 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:29,045 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 21:07:29,045 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:29,046 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:29,046 INFO  L85        PathProgramCache]: Analyzing trace with hash 797194570, now seen corresponding path program 1 times
[2025-02-05 21:07:29,046 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:29,046 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593072302]
[2025-02-05 21:07:29,046 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:29,046 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:29,059 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-02-05 21:07:29,076 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-02-05 21:07:29,076 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:29,077 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:29,271 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:29,272 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:29,272 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593072302]
[2025-02-05 21:07:29,272 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593072302] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:29,272 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:29,272 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-05 21:07:29,272 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987992125]
[2025-02-05 21:07:29,272 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:29,273 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-05 21:07:29,273 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:29,274 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-05 21:07:29,274 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-05 21:07:29,274 INFO  L87              Difference]: Start difference. First operand 260 states and 412 transitions. Second operand  has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:29,980 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:29,981 INFO  L93              Difference]: Finished difference Result 967 states and 1524 transitions.
[2025-02-05 21:07:29,981 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-05 21:07:29,981 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252
[2025-02-05 21:07:29,982 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:29,985 INFO  L225             Difference]: With dead ends: 967
[2025-02-05 21:07:29,985 INFO  L226             Difference]: Without dead ends: 710
[2025-02-05 21:07:29,986 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156
[2025-02-05 21:07:29,987 INFO  L435           NwaCegarLoop]: 278 mSDtfsCounter, 689 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:29,987 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1023 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 21:07:29,987 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 710 states.
[2025-02-05 21:07:30,033 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 484.
[2025-02-05 21:07:30,034 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 484 states, 353 states have (on average 1.4702549575070822) internal successors, (519), 355 states have internal predecessors, (519), 122 states have call successors, (122), 8 states have call predecessors, (122), 8 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122)
[2025-02-05 21:07:30,036 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 763 transitions.
[2025-02-05 21:07:30,037 INFO  L78                 Accepts]: Start accepts. Automaton has 484 states and 763 transitions. Word has length 252
[2025-02-05 21:07:30,038 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:30,038 INFO  L471      AbstractCegarLoop]: Abstraction has 484 states and 763 transitions.
[2025-02-05 21:07:30,038 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:30,038 INFO  L276                IsEmpty]: Start isEmpty. Operand 484 states and 763 transitions.
[2025-02-05 21:07:30,039 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-02-05 21:07:30,039 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:30,039 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:30,039 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 21:07:30,040 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:30,040 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:30,040 INFO  L85        PathProgramCache]: Analyzing trace with hash 388370345, now seen corresponding path program 1 times
[2025-02-05 21:07:30,040 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:30,040 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909377819]
[2025-02-05 21:07:30,040 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:30,040 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:30,064 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-02-05 21:07:30,081 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-02-05 21:07:30,082 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:30,082 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:30,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:30,418 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:30,418 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909377819]
[2025-02-05 21:07:30,418 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909377819] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:30,418 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:30,418 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 21:07:30,418 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070954158]
[2025-02-05 21:07:30,418 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:30,418 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 21:07:30,418 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:30,419 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 21:07:30,419 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:07:30,419 INFO  L87              Difference]: Start difference. First operand 484 states and 763 transitions. Second operand  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:30,482 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:30,482 INFO  L93              Difference]: Finished difference Result 1007 states and 1580 transitions.
[2025-02-05 21:07:30,483 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 21:07:30,483 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252
[2025-02-05 21:07:30,483 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:30,486 INFO  L225             Difference]: With dead ends: 1007
[2025-02-05 21:07:30,486 INFO  L226             Difference]: Without dead ends: 526
[2025-02-05 21:07:30,487 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:07:30,487 INFO  L435           NwaCegarLoop]: 197 mSDtfsCounter, 42 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:30,487 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 397 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:07:30,492 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 526 states.
[2025-02-05 21:07:30,528 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 500.
[2025-02-05 21:07:30,529 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 500 states, 369 states have (on average 1.4715447154471544) internal successors, (543), 371 states have internal predecessors, (543), 122 states have call successors, (122), 8 states have call predecessors, (122), 8 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122)
[2025-02-05 21:07:30,532 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 787 transitions.
[2025-02-05 21:07:30,533 INFO  L78                 Accepts]: Start accepts. Automaton has 500 states and 787 transitions. Word has length 252
[2025-02-05 21:07:30,533 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:30,533 INFO  L471      AbstractCegarLoop]: Abstraction has 500 states and 787 transitions.
[2025-02-05 21:07:30,533 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:30,533 INFO  L276                IsEmpty]: Start isEmpty. Operand 500 states and 787 transitions.
[2025-02-05 21:07:30,535 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-02-05 21:07:30,535 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:30,535 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:30,535 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 21:07:30,535 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:30,536 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:30,536 INFO  L85        PathProgramCache]: Analyzing trace with hash 389293866, now seen corresponding path program 1 times
[2025-02-05 21:07:30,536 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:30,536 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205554478]
[2025-02-05 21:07:30,536 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:30,536 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:30,548 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-02-05 21:07:30,607 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-02-05 21:07:30,607 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:30,607 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:30,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:30,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:30,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205554478]
[2025-02-05 21:07:30,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205554478] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:30,784 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:30,784 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 21:07:30,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075614283]
[2025-02-05 21:07:30,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:30,785 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 21:07:30,785 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:30,785 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 21:07:30,786 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:07:30,786 INFO  L87              Difference]: Start difference. First operand 500 states and 787 transitions. Second operand  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:31,078 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:31,079 INFO  L93              Difference]: Finished difference Result 1328 states and 2099 transitions.
[2025-02-05 21:07:31,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 21:07:31,080 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252
[2025-02-05 21:07:31,082 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:31,087 INFO  L225             Difference]: With dead ends: 1328
[2025-02-05 21:07:31,087 INFO  L226             Difference]: Without dead ends: 831
[2025-02-05 21:07:31,088 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-02-05 21:07:31,089 INFO  L435           NwaCegarLoop]: 198 mSDtfsCounter, 190 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:31,089 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 700 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 21:07:31,089 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 831 states.
[2025-02-05 21:07:31,156 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 749.
[2025-02-05 21:07:31,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 749 states, 577 states have (on average 1.4974003466204506) internal successors, (864), 579 states have internal predecessors, (864), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161)
[2025-02-05 21:07:31,161 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1186 transitions.
[2025-02-05 21:07:31,162 INFO  L78                 Accepts]: Start accepts. Automaton has 749 states and 1186 transitions. Word has length 252
[2025-02-05 21:07:31,163 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:31,163 INFO  L471      AbstractCegarLoop]: Abstraction has 749 states and 1186 transitions.
[2025-02-05 21:07:31,163 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:31,163 INFO  L276                IsEmpty]: Start isEmpty. Operand 749 states and 1186 transitions.
[2025-02-05 21:07:31,164 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2025-02-05 21:07:31,164 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:31,165 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:31,165 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 21:07:31,165 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:31,165 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:31,165 INFO  L85        PathProgramCache]: Analyzing trace with hash 1376635546, now seen corresponding path program 1 times
[2025-02-05 21:07:31,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:31,165 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422173166]
[2025-02-05 21:07:31,165 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:31,165 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:31,178 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes.
[2025-02-05 21:07:31,228 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements.
[2025-02-05 21:07:31,229 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:31,229 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:32,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:32,081 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:32,081 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422173166]
[2025-02-05 21:07:32,081 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422173166] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:32,081 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:32,081 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-05 21:07:32,081 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11890483]
[2025-02-05 21:07:32,082 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:32,082 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-05 21:07:32,082 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:32,082 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-05 21:07:32,082 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2025-02-05 21:07:32,083 INFO  L87              Difference]: Start difference. First operand 749 states and 1186 transitions. Second operand  has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39)
[2025-02-05 21:07:33,204 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:33,204 INFO  L93              Difference]: Finished difference Result 2531 states and 4007 transitions.
[2025-02-05 21:07:33,205 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-02-05 21:07:33,205 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 253
[2025-02-05 21:07:33,205 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:33,214 INFO  L225             Difference]: With dead ends: 2531
[2025-02-05 21:07:33,214 INFO  L226             Difference]: Without dead ends: 1992
[2025-02-05 21:07:33,216 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210
[2025-02-05 21:07:33,216 INFO  L435           NwaCegarLoop]: 279 mSDtfsCounter, 1071 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 559 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:33,216 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 676 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [559 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 21:07:33,218 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1992 states.
[2025-02-05 21:07:33,307 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 795.
[2025-02-05 21:07:33,308 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 795 states, 623 states have (on average 1.4895666131621188) internal successors, (928), 625 states have internal predecessors, (928), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161)
[2025-02-05 21:07:33,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1250 transitions.
[2025-02-05 21:07:33,313 INFO  L78                 Accepts]: Start accepts. Automaton has 795 states and 1250 transitions. Word has length 253
[2025-02-05 21:07:33,313 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:33,313 INFO  L471      AbstractCegarLoop]: Abstraction has 795 states and 1250 transitions.
[2025-02-05 21:07:33,314 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39)
[2025-02-05 21:07:33,314 INFO  L276                IsEmpty]: Start isEmpty. Operand 795 states and 1250 transitions.
[2025-02-05 21:07:33,315 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2025-02-05 21:07:33,315 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:33,315 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:33,315 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 21:07:33,315 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:33,315 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:33,316 INFO  L85        PathProgramCache]: Analyzing trace with hash -700573797, now seen corresponding path program 1 times
[2025-02-05 21:07:33,316 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:33,316 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262182422]
[2025-02-05 21:07:33,316 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:33,316 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:33,328 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes.
[2025-02-05 21:07:33,338 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements.
[2025-02-05 21:07:33,339 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:33,339 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:33,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:33,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:33,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262182422]
[2025-02-05 21:07:33,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262182422] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:33,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:33,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 21:07:33,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700447103]
[2025-02-05 21:07:33,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:33,443 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 21:07:33,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:33,444 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 21:07:33,444 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 21:07:33,444 INFO  L87              Difference]: Start difference. First operand 795 states and 1250 transitions. Second operand  has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:33,671 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:33,672 INFO  L93              Difference]: Finished difference Result 1532 states and 2409 transitions.
[2025-02-05 21:07:33,672 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 21:07:33,672 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 253
[2025-02-05 21:07:33,673 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:33,678 INFO  L225             Difference]: With dead ends: 1532
[2025-02-05 21:07:33,678 INFO  L226             Difference]: Without dead ends: 941
[2025-02-05 21:07:33,679 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:07:33,680 INFO  L435           NwaCegarLoop]: 303 mSDtfsCounter, 140 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:33,680 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 734 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 21:07:33,681 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 941 states.
[2025-02-05 21:07:33,748 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 781.
[2025-02-05 21:07:33,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 781 states, 609 states have (on average 1.4811165845648604) internal successors, (902), 611 states have internal predecessors, (902), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161)
[2025-02-05 21:07:33,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1224 transitions.
[2025-02-05 21:07:33,753 INFO  L78                 Accepts]: Start accepts. Automaton has 781 states and 1224 transitions. Word has length 253
[2025-02-05 21:07:33,753 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:33,754 INFO  L471      AbstractCegarLoop]: Abstraction has 781 states and 1224 transitions.
[2025-02-05 21:07:33,754 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:33,754 INFO  L276                IsEmpty]: Start isEmpty. Operand 781 states and 1224 transitions.
[2025-02-05 21:07:33,755 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-02-05 21:07:33,755 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:33,755 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:33,755 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 21:07:33,756 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:33,756 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:33,756 INFO  L85        PathProgramCache]: Analyzing trace with hash -449427811, now seen corresponding path program 1 times
[2025-02-05 21:07:33,756 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:33,756 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956993122]
[2025-02-05 21:07:33,756 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:33,756 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:33,768 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-02-05 21:07:33,782 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-02-05 21:07:33,782 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:33,782 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:33,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:33,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:33,917 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956993122]
[2025-02-05 21:07:33,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956993122] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:33,917 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:33,917 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 21:07:33,917 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098543581]
[2025-02-05 21:07:33,917 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:33,918 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 21:07:33,918 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:33,918 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 21:07:33,918 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 21:07:33,919 INFO  L87              Difference]: Start difference. First operand 781 states and 1224 transitions. Second operand  has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:34,329 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:34,330 INFO  L93              Difference]: Finished difference Result 1824 states and 2864 transitions.
[2025-02-05 21:07:34,330 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 21:07:34,330 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 254
[2025-02-05 21:07:34,331 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:34,337 INFO  L225             Difference]: With dead ends: 1824
[2025-02-05 21:07:34,337 INFO  L226             Difference]: Without dead ends: 1497
[2025-02-05 21:07:34,338 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2025-02-05 21:07:34,338 INFO  L435           NwaCegarLoop]: 231 mSDtfsCounter, 307 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:34,338 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 923 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 21:07:34,339 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1497 states.
[2025-02-05 21:07:34,403 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 801.
[2025-02-05 21:07:34,405 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 801 states, 629 states have (on average 1.4848966613672496) internal successors, (934), 631 states have internal predecessors, (934), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161)
[2025-02-05 21:07:34,407 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1256 transitions.
[2025-02-05 21:07:34,409 INFO  L78                 Accepts]: Start accepts. Automaton has 801 states and 1256 transitions. Word has length 254
[2025-02-05 21:07:34,409 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:34,409 INFO  L471      AbstractCegarLoop]: Abstraction has 801 states and 1256 transitions.
[2025-02-05 21:07:34,409 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:34,409 INFO  L276                IsEmpty]: Start isEmpty. Operand 801 states and 1256 transitions.
[2025-02-05 21:07:34,410 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-02-05 21:07:34,410 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:34,411 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:34,411 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 21:07:34,411 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:34,411 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:34,411 INFO  L85        PathProgramCache]: Analyzing trace with hash -238076898, now seen corresponding path program 1 times
[2025-02-05 21:07:34,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:34,411 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694645231]
[2025-02-05 21:07:34,411 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:34,412 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:34,422 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-02-05 21:07:34,432 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-02-05 21:07:34,432 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:34,432 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:34,495 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:34,495 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:34,495 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694645231]
[2025-02-05 21:07:34,496 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694645231] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:34,496 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:34,496 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 21:07:34,496 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504111122]
[2025-02-05 21:07:34,497 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:34,497 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 21:07:34,497 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:34,497 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 21:07:34,497 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 21:07:34,498 INFO  L87              Difference]: Start difference. First operand 801 states and 1256 transitions. Second operand  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:34,696 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:34,697 INFO  L93              Difference]: Finished difference Result 1324 states and 2080 transitions.
[2025-02-05 21:07:34,697 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 21:07:34,697 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 254
[2025-02-05 21:07:34,698 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:34,702 INFO  L225             Difference]: With dead ends: 1324
[2025-02-05 21:07:34,703 INFO  L226             Difference]: Without dead ends: 961
[2025-02-05 21:07:34,704 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:07:34,704 INFO  L435           NwaCegarLoop]: 204 mSDtfsCounter, 142 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:34,705 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 530 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 21:07:34,705 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 961 states.
[2025-02-05 21:07:34,765 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 801.
[2025-02-05 21:07:34,766 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 801 states, 629 states have (on average 1.4721780604133545) internal successors, (926), 631 states have internal predecessors, (926), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161)
[2025-02-05 21:07:34,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1248 transitions.
[2025-02-05 21:07:34,773 INFO  L78                 Accepts]: Start accepts. Automaton has 801 states and 1248 transitions. Word has length 254
[2025-02-05 21:07:34,775 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:34,775 INFO  L471      AbstractCegarLoop]: Abstraction has 801 states and 1248 transitions.
[2025-02-05 21:07:34,775 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:34,775 INFO  L276                IsEmpty]: Start isEmpty. Operand 801 states and 1248 transitions.
[2025-02-05 21:07:34,777 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-02-05 21:07:34,777 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:34,777 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:34,777 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 21:07:34,778 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:34,778 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:34,778 INFO  L85        PathProgramCache]: Analyzing trace with hash 1979681055, now seen corresponding path program 1 times
[2025-02-05 21:07:34,778 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:34,778 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681513856]
[2025-02-05 21:07:34,778 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:34,778 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:34,789 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-02-05 21:07:34,801 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-02-05 21:07:34,801 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:34,801 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:34,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:34,997 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:34,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681513856]
[2025-02-05 21:07:34,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681513856] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:34,997 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:34,997 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 21:07:34,998 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532259140]
[2025-02-05 21:07:34,998 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:34,998 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 21:07:34,998 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:34,999 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 21:07:34,999 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:07:34,999 INFO  L87              Difference]: Start difference. First operand 801 states and 1248 transitions. Second operand  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:35,377 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:35,377 INFO  L93              Difference]: Finished difference Result 1284 states and 2010 transitions.
[2025-02-05 21:07:35,378 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 21:07:35,378 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 254
[2025-02-05 21:07:35,378 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:35,383 INFO  L225             Difference]: With dead ends: 1284
[2025-02-05 21:07:35,383 INFO  L226             Difference]: Without dead ends: 909
[2025-02-05 21:07:35,385 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 21:07:35,385 INFO  L435           NwaCegarLoop]: 407 mSDtfsCounter, 427 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:35,385 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 809 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 21:07:35,386 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 909 states.
[2025-02-05 21:07:35,444 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 755.
[2025-02-05 21:07:35,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 755 states, 583 states have (on average 1.4648370497427101) internal successors, (854), 585 states have internal predecessors, (854), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161)
[2025-02-05 21:07:35,448 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1176 transitions.
[2025-02-05 21:07:35,449 INFO  L78                 Accepts]: Start accepts. Automaton has 755 states and 1176 transitions. Word has length 254
[2025-02-05 21:07:35,450 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:35,450 INFO  L471      AbstractCegarLoop]: Abstraction has 755 states and 1176 transitions.
[2025-02-05 21:07:35,450 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:35,450 INFO  L276                IsEmpty]: Start isEmpty. Operand 755 states and 1176 transitions.
[2025-02-05 21:07:35,451 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-02-05 21:07:35,451 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:35,452 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:35,452 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 21:07:35,452 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:35,452 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:35,452 INFO  L85        PathProgramCache]: Analyzing trace with hash -185064485, now seen corresponding path program 1 times
[2025-02-05 21:07:35,453 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:35,453 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592818715]
[2025-02-05 21:07:35,453 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:35,453 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:35,464 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-02-05 21:07:35,477 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-02-05 21:07:35,477 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:35,477 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:35,634 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:35,635 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:35,635 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592818715]
[2025-02-05 21:07:35,635 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592818715] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:35,635 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:35,635 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 21:07:35,635 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505806774]
[2025-02-05 21:07:35,635 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:35,636 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 21:07:35,636 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:35,637 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 21:07:35,637 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 21:07:35,637 INFO  L87              Difference]: Start difference. First operand 755 states and 1176 transitions. Second operand  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:35,831 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:35,831 INFO  L93              Difference]: Finished difference Result 1750 states and 2749 transitions.
[2025-02-05 21:07:35,832 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 21:07:35,832 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 254
[2025-02-05 21:07:35,833 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:35,839 INFO  L225             Difference]: With dead ends: 1750
[2025-02-05 21:07:35,839 INFO  L226             Difference]: Without dead ends: 1155
[2025-02-05 21:07:35,840 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:07:35,841 INFO  L435           NwaCegarLoop]: 262 mSDtfsCounter, 121 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:35,841 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 645 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 21:07:35,842 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1155 states.
[2025-02-05 21:07:35,921 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 747.
[2025-02-05 21:07:35,923 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 747 states, 575 states have (on average 1.4539130434782608) internal successors, (836), 577 states have internal predecessors, (836), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161)
[2025-02-05 21:07:35,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1158 transitions.
[2025-02-05 21:07:35,927 INFO  L78                 Accepts]: Start accepts. Automaton has 747 states and 1158 transitions. Word has length 254
[2025-02-05 21:07:35,927 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:35,927 INFO  L471      AbstractCegarLoop]: Abstraction has 747 states and 1158 transitions.
[2025-02-05 21:07:35,927 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:35,927 INFO  L276                IsEmpty]: Start isEmpty. Operand 747 states and 1158 transitions.
[2025-02-05 21:07:35,928 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-02-05 21:07:35,928 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:35,929 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:35,929 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 21:07:35,929 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:35,929 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:35,929 INFO  L85        PathProgramCache]: Analyzing trace with hash 1882886011, now seen corresponding path program 1 times
[2025-02-05 21:07:35,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:35,929 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15024616]
[2025-02-05 21:07:35,930 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:35,930 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:35,941 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-02-05 21:07:35,957 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-02-05 21:07:35,958 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:35,958 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:36,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:36,057 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:36,057 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15024616]
[2025-02-05 21:07:36,057 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15024616] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:36,057 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:36,057 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 21:07:36,057 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497054210]
[2025-02-05 21:07:36,057 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:36,058 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 21:07:36,058 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:07:36,058 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 21:07:36,058 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:07:36,059 INFO  L87              Difference]: Start difference. First operand 747 states and 1158 transitions. Second operand  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:36,405 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:36,405 INFO  L93              Difference]: Finished difference Result 1541 states and 2388 transitions.
[2025-02-05 21:07:36,405 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 21:07:36,406 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 254
[2025-02-05 21:07:36,406 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:36,411 INFO  L225             Difference]: With dead ends: 1541
[2025-02-05 21:07:36,411 INFO  L226             Difference]: Without dead ends: 994
[2025-02-05 21:07:36,413 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 21:07:36,414 INFO  L435           NwaCegarLoop]: 260 mSDtfsCounter, 281 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:36,414 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 619 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 21:07:36,415 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 994 states.
[2025-02-05 21:07:36,502 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 988.
[2025-02-05 21:07:36,503 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 988 states, 764 states have (on average 1.4541884816753927) internal successors, (1111), 768 states have internal predecessors, (1111), 209 states have call successors, (209), 14 states have call predecessors, (209), 14 states have return successors, (209), 205 states have call predecessors, (209), 209 states have call successors, (209)
[2025-02-05 21:07:36,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1529 transitions.
[2025-02-05 21:07:36,508 INFO  L78                 Accepts]: Start accepts. Automaton has 988 states and 1529 transitions. Word has length 254
[2025-02-05 21:07:36,508 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:36,508 INFO  L471      AbstractCegarLoop]: Abstraction has 988 states and 1529 transitions.
[2025-02-05 21:07:36,508 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:36,509 INFO  L276                IsEmpty]: Start isEmpty. Operand 988 states and 1529 transitions.
[2025-02-05 21:07:36,510 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-02-05 21:07:36,510 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:36,510 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:36,510 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 21:07:36,510 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:36,510 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:36,511 INFO  L85        PathProgramCache]: Analyzing trace with hash 2094236924, now seen corresponding path program 1 times
[2025-02-05 21:07:36,511 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:07:36,511 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872979708]
[2025-02-05 21:07:36,511 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:36,511 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:07:36,522 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-02-05 21:07:36,598 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-02-05 21:07:36,598 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:36,598 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:36,890 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 9 proven. 105 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked.
[2025-02-05 21:07:36,893 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:07:36,893 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872979708]
[2025-02-05 21:07:36,893 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872979708] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 21:07:36,893 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669607064]
[2025-02-05 21:07:36,893 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:36,893 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 21:07:36,893 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:07:36,896 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 21:07:36,897 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 21:07:36,972 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-02-05 21:07:37,029 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-02-05 21:07:37,029 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:37,029 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:37,034 INFO  L256         TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-02-05 21:07:37,040 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 21:07:37,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 1508 proven. 51 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked.
[2025-02-05 21:07:37,519 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 21:07:37,596 WARN  L320   FreeRefinementEngine]: Global settings require throwing the following exception
[2025-02-05 21:07:37,605 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 21:07:37,797 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 21:07:37,798 FATAL L?                        ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception:
java.lang.IllegalArgumentException: Modulus must be strictly greater one but is 0
	at de.uni_freiburg.informatik.ultimate.util.ArithmeticUtils.multiplicativeInverse(ArithmeticUtils.java:89)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDml.findAllDmlPossibilities(DualJunctionDml.java:162)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDml.tryToEliminate(DualJunctionDml.java:184)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283)
	at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181)
	at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.<init>(TraceCheckSpWp.java:160)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77)
	at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267)
	at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148)
	at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137)
	at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.<init>(AutomatonFreeRefinementEngine.java:85)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(TraceAbstractionRefinementEngine.java:82)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.<init>(TraceAbstractionStarter.java:140)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145)
	at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63)
[2025-02-05 21:07:37,803 INFO  L158              Benchmark]: Toolchain (without parser) took 13648.13ms. Allocated memory was 201.3MB in the beginning and 520.1MB in the end (delta: 318.8MB). Free memory was 158.8MB in the beginning and 298.6MB in the end (delta: -139.8MB). Peak memory consumption was 177.8MB. Max. memory is 16.1GB.
[2025-02-05 21:07:37,803 INFO  L158              Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 21:07:37,803 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 230.75ms. Allocated memory is still 201.3MB. Free memory was 158.5MB in the beginning and 141.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-05 21:07:37,804 INFO  L158              Benchmark]: Boogie Procedure Inliner took 55.31ms. Allocated memory is still 201.3MB. Free memory was 141.5MB in the beginning and 137.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 21:07:37,804 INFO  L158              Benchmark]: Boogie Preprocessor took 49.43ms. Allocated memory is still 201.3MB. Free memory was 137.8MB in the beginning and 133.6MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-05 21:07:37,804 INFO  L158              Benchmark]: IcfgBuilder took 552.57ms. Allocated memory is still 201.3MB. Free memory was 133.6MB in the beginning and 97.7MB in the end (delta: 36.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-02-05 21:07:37,804 INFO  L158              Benchmark]: TraceAbstraction took 12755.23ms. Allocated memory was 201.3MB in the beginning and 520.1MB in the end (delta: 318.8MB). Free memory was 97.1MB in the beginning and 298.6MB in the end (delta: -201.5MB). Peak memory consumption was 119.1MB. Max. memory is 16.1GB.
[2025-02-05 21:07:37,806 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 230.75ms. Allocated memory is still 201.3MB. Free memory was 158.5MB in the beginning and 141.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 55.31ms. Allocated memory is still 201.3MB. Free memory was 141.5MB in the beginning and 137.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 49.43ms. Allocated memory is still 201.3MB. Free memory was 137.8MB in the beginning and 133.6MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 552.57ms. Allocated memory is still 201.3MB. Free memory was 133.6MB in the beginning and 97.7MB in the end (delta: 36.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 12755.23ms. Allocated memory was 201.3MB in the beginning and 520.1MB in the end (delta: 318.8MB). Free memory was 97.1MB in the beginning and 298.6MB in the end (delta: -201.5MB). Peak memory consumption was 119.1MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - ExceptionOrErrorResult: IllegalArgumentException: Modulus must be strictly greater one but is 0
    de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: Modulus must be strictly greater one but is 0: de.uni_freiburg.informatik.ultimate.util.ArithmeticUtils.multiplicativeInverse(ArithmeticUtils.java:89)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
[2025-02-05 21:07:37,822 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis

### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 21:07:39,722 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 21:07:39,799 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-02-05 21:07:39,803 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 21:07:39,803 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 21:07:39,824 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 21:07:39,825 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 21:07:39,825 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 21:07:39,825 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 21:07:39,825 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 21:07:39,826 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 21:07:39,826 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 21:07:39,826 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 21:07:39,826 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 21:07:39,826 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 21:07:39,826 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 21:07:39,826 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 21:07:39,826 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 21:07:39,826 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 21:07:39,826 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 21:07:39,827 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 21:07:39,827 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-02-05 21:07:39,827 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 21:07:39,828 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 21:07:39,828 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 21:07:39,828 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 21:07:39,828 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 -> c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63
[2025-02-05 21:07:40,082 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 21:07:40,088 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 21:07:40,089 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 21:07:40,090 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 21:07:40,090 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 21:07:40,091 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-02-05 21:07:41,351 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e317d8cc5/98668889c89243658d4abac3910610b9/FLAG15f66dd04
[2025-02-05 21:07:41,564 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 21:07:41,566 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-02-05 21:07:41,574 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e317d8cc5/98668889c89243658d4abac3910610b9/FLAG15f66dd04
[2025-02-05 21:07:41,590 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e317d8cc5/98668889c89243658d4abac3910610b9
[2025-02-05 21:07:41,595 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 21:07:41,596 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 21:07:41,597 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 21:07:41,597 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 21:07:41,601 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 21:07:41,601 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:07:41" (1/1) ...
[2025-02-05 21:07:41,602 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f770e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:41, skipping insertion in model container
[2025-02-05 21:07:41,603 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:07:41" (1/1) ...
[2025-02-05 21:07:41,625 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 21:07:41,728 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929]
[2025-02-05 21:07:41,803 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 21:07:41,819 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 21:07:41,828 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929]
[2025-02-05 21:07:41,882 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 21:07:41,901 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 21:07:41,901 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:41 WrapperNode
[2025-02-05 21:07:41,902 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 21:07:41,902 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 21:07:41,903 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 21:07:41,904 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 21:07:41,908 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:41" (1/1) ...
[2025-02-05 21:07:41,921 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:41" (1/1) ...
[2025-02-05 21:07:41,950 INFO  L138                Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250
[2025-02-05 21:07:41,954 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 21:07:41,955 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 21:07:41,955 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 21:07:41,955 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 21:07:41,961 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:41" (1/1) ...
[2025-02-05 21:07:41,962 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:41" (1/1) ...
[2025-02-05 21:07:41,967 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:41" (1/1) ...
[2025-02-05 21:07:41,987 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 21:07:41,991 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:41" (1/1) ...
[2025-02-05 21:07:41,991 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:41" (1/1) ...
[2025-02-05 21:07:42,005 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:41" (1/1) ...
[2025-02-05 21:07:42,007 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:41" (1/1) ...
[2025-02-05 21:07:42,008 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:41" (1/1) ...
[2025-02-05 21:07:42,009 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:41" (1/1) ...
[2025-02-05 21:07:42,012 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 21:07:42,016 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 21:07:42,016 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 21:07:42,016 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 21:07:42,017 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:41" (1/1) ...
[2025-02-05 21:07:42,021 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 21:07:42,030 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:07:42,040 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 21:07:42,043 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 21:07:42,062 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 21:07:42,062 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-02-05 21:07:42,062 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-05 21:07:42,062 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-05 21:07:42,062 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 21:07:42,062 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 21:07:42,147 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 21:07:42,149 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 21:07:42,792 INFO  L?                        ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2025-02-05 21:07:42,793 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 21:07:42,804 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 21:07:42,804 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 21:07:42,804 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:07:42 BoogieIcfgContainer
[2025-02-05 21:07:42,805 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 21:07:42,807 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 21:07:42,807 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 21:07:42,811 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 21:07:42,811 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:07:41" (1/3) ...
[2025-02-05 21:07:42,811 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1001529b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:07:42, skipping insertion in model container
[2025-02-05 21:07:42,812 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:07:41" (2/3) ...
[2025-02-05 21:07:42,812 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1001529b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:07:42, skipping insertion in model container
[2025-02-05 21:07:42,812 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:07:42" (3/3) ...
[2025-02-05 21:07:42,813 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-02-05 21:07:42,823 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 21:07:42,825 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 21:07:42,882 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 21:07:42,889 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;@57ced827, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 21:07:42,890 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 21:07:42,893 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 113 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 72 states have internal predecessors, (106), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39)
[2025-02-05 21:07:42,904 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 247
[2025-02-05 21:07:42,904 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:42,904 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:42,905 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:42,908 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:42,909 INFO  L85        PathProgramCache]: Analyzing trace with hash -47776823, now seen corresponding path program 1 times
[2025-02-05 21:07:42,919 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-02-05 21:07:42,920 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020737002]
[2025-02-05 21:07:42,921 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:42,921 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-02-05 21:07:42,921 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2025-02-05 21:07:42,923 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-02-05 21:07:42,924 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2025-02-05 21:07:43,002 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes.
[2025-02-05 21:07:43,237 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements.
[2025-02-05 21:07:43,238 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:43,238 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:43,252 INFO  L256         TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-05 21:07:43,258 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 21:07:43,303 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 944 proven. 0 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked.
[2025-02-05 21:07:43,304 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 21:07:43,304 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-02-05 21:07:43,304 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020737002]
[2025-02-05 21:07:43,304 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020737002] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:43,304 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:43,305 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 21:07:43,306 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423608022]
[2025-02-05 21:07:43,306 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:43,308 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 21:07:43,309 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-02-05 21:07:43,322 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 21:07:43,322 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 21:07:43,324 INFO  L87              Difference]: Start difference. First operand  has 113 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 72 states have internal predecessors, (106), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand  has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39)
[2025-02-05 21:07:43,349 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:43,350 INFO  L93              Difference]: Finished difference Result 220 states and 402 transitions.
[2025-02-05 21:07:43,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 21:07:43,351 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 246
[2025-02-05 21:07:43,352 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:43,356 INFO  L225             Difference]: With dead ends: 220
[2025-02-05 21:07:43,356 INFO  L226             Difference]: Without dead ends: 110
[2025-02-05 21:07:43,358 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 21:07:43,360 INFO  L435           NwaCegarLoop]: 177 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, 177 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 21:07:43,361 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:07:43,368 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 110 states.
[2025-02-05 21:07:43,393 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110.
[2025-02-05 21:07:43,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 110 states, 69 states have (on average 1.434782608695652) internal successors, (99), 69 states have internal predecessors, (99), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39)
[2025-02-05 21:07:43,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 177 transitions.
[2025-02-05 21:07:43,401 INFO  L78                 Accepts]: Start accepts. Automaton has 110 states and 177 transitions. Word has length 246
[2025-02-05 21:07:43,401 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:43,401 INFO  L471      AbstractCegarLoop]: Abstraction has 110 states and 177 transitions.
[2025-02-05 21:07:43,402 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39)
[2025-02-05 21:07:43,402 INFO  L276                IsEmpty]: Start isEmpty. Operand 110 states and 177 transitions.
[2025-02-05 21:07:43,404 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 247
[2025-02-05 21:07:43,405 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:43,405 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:43,418 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2025-02-05 21:07:43,606 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-02-05 21:07:43,606 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:43,607 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:43,607 INFO  L85        PathProgramCache]: Analyzing trace with hash 306781320, now seen corresponding path program 1 times
[2025-02-05 21:07:43,608 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-02-05 21:07:43,608 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004164354]
[2025-02-05 21:07:43,608 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:43,608 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-02-05 21:07:43,608 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2025-02-05 21:07:43,610 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-02-05 21:07:43,611 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2025-02-05 21:07:43,689 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes.
[2025-02-05 21:07:43,950 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements.
[2025-02-05 21:07:43,951 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:43,951 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:43,963 INFO  L256         TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 21:07:43,968 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 21:07:44,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:44,011 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 21:07:44,011 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-02-05 21:07:44,011 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004164354]
[2025-02-05 21:07:44,011 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004164354] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:44,011 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:44,011 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:07:44,011 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742644384]
[2025-02-05 21:07:44,011 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:44,012 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 21:07:44,012 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-02-05 21:07:44,015 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 21:07:44,015 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:07:44,015 INFO  L87              Difference]: Start difference. First operand 110 states and 177 transitions. Second operand  has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:44,082 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:44,083 INFO  L93              Difference]: Finished difference Result 290 states and 469 transitions.
[2025-02-05 21:07:44,083 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 21:07:44,084 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 246
[2025-02-05 21:07:44,085 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:44,088 INFO  L225             Difference]: With dead ends: 290
[2025-02-05 21:07:44,088 INFO  L226             Difference]: Without dead ends: 183
[2025-02-05 21:07:44,091 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:07:44,091 INFO  L435           NwaCegarLoop]: 271 mSDtfsCounter, 112 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:44,093 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 432 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:07:44,094 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 183 states.
[2025-02-05 21:07:44,119 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180.
[2025-02-05 21:07:44,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 180 states, 116 states have (on average 1.4482758620689655) internal successors, (168), 117 states have internal predecessors, (168), 61 states have call successors, (61), 2 states have call predecessors, (61), 2 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61)
[2025-02-05 21:07:44,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions.
[2025-02-05 21:07:44,126 INFO  L78                 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 246
[2025-02-05 21:07:44,126 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:44,126 INFO  L471      AbstractCegarLoop]: Abstraction has 180 states and 290 transitions.
[2025-02-05 21:07:44,126 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:44,126 INFO  L276                IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions.
[2025-02-05 21:07:44,130 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 247
[2025-02-05 21:07:44,130 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:44,130 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:44,145 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2025-02-05 21:07:44,330 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-02-05 21:07:44,331 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:44,331 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:44,331 INFO  L85        PathProgramCache]: Analyzing trace with hash -1731274969, now seen corresponding path program 1 times
[2025-02-05 21:07:44,332 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-02-05 21:07:44,332 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588571015]
[2025-02-05 21:07:44,332 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:44,332 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-02-05 21:07:44,332 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2025-02-05 21:07:44,335 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-02-05 21:07:44,336 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2025-02-05 21:07:44,392 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes.
[2025-02-05 21:07:44,601 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements.
[2025-02-05 21:07:44,601 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:44,601 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:44,614 INFO  L256         TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-05 21:07:44,619 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 21:07:45,553 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:45,553 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 21:07:45,553 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-02-05 21:07:45,553 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588571015]
[2025-02-05 21:07:45,553 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [588571015] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:45,554 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:45,554 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 21:07:45,554 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856086711]
[2025-02-05 21:07:45,554 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:45,554 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 21:07:45,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-02-05 21:07:45,556 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 21:07:45,556 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:07:45,557 INFO  L87              Difference]: Start difference. First operand 180 states and 290 transitions. Second operand  has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:45,936 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:45,937 INFO  L93              Difference]: Finished difference Result 498 states and 807 transitions.
[2025-02-05 21:07:45,939 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 21:07:45,939 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 246
[2025-02-05 21:07:45,940 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:45,945 INFO  L225             Difference]: With dead ends: 498
[2025-02-05 21:07:45,945 INFO  L226             Difference]: Without dead ends: 321
[2025-02-05 21:07:45,946 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-02-05 21:07:45,946 INFO  L435           NwaCegarLoop]: 173 mSDtfsCounter, 133 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:45,947 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 600 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 21:07:45,947 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 321 states.
[2025-02-05 21:07:45,998 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 287.
[2025-02-05 21:07:45,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 287 states, 183 states have (on average 1.459016393442623) internal successors, (267), 184 states have internal predecessors, (267), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100)
[2025-02-05 21:07:46,004 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 467 transitions.
[2025-02-05 21:07:46,005 INFO  L78                 Accepts]: Start accepts. Automaton has 287 states and 467 transitions. Word has length 246
[2025-02-05 21:07:46,005 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:46,005 INFO  L471      AbstractCegarLoop]: Abstraction has 287 states and 467 transitions.
[2025-02-05 21:07:46,005 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:46,005 INFO  L276                IsEmpty]: Start isEmpty. Operand 287 states and 467 transitions.
[2025-02-05 21:07:46,008 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 248
[2025-02-05 21:07:46,008 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:46,008 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:46,022 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2025-02-05 21:07:46,209 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-02-05 21:07:46,209 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:46,209 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:46,209 INFO  L85        PathProgramCache]: Analyzing trace with hash 91216731, now seen corresponding path program 1 times
[2025-02-05 21:07:46,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-02-05 21:07:46,210 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252000152]
[2025-02-05 21:07:46,210 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:46,210 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-02-05 21:07:46,210 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2025-02-05 21:07:46,214 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-02-05 21:07:46,215 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2025-02-05 21:07:46,251 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes.
[2025-02-05 21:07:46,459 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements.
[2025-02-05 21:07:46,459 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:46,459 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:46,473 INFO  L256         TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-05 21:07:46,477 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 21:07:46,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 464 proven. 105 refuted. 0 times theorem prover too weak. 2395 trivial. 0 not checked.
[2025-02-05 21:07:46,751 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 21:07:47,013 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 9 proven. 105 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked.
[2025-02-05 21:07:47,014 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-02-05 21:07:47,014 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252000152]
[2025-02-05 21:07:47,014 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [252000152] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 21:07:47,014 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-02-05 21:07:47,014 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9
[2025-02-05 21:07:47,014 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090414599]
[2025-02-05 21:07:47,014 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-02-05 21:07:47,015 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-05 21:07:47,015 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-02-05 21:07:47,016 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-05 21:07:47,017 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-02-05 21:07:47,017 INFO  L87              Difference]: Start difference. First operand 287 states and 467 transitions. Second operand  has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75)
[2025-02-05 21:07:47,393 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:47,394 INFO  L93              Difference]: Finished difference Result 488 states and 775 transitions.
[2025-02-05 21:07:47,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-05 21:07:47,396 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) Word has length 247
[2025-02-05 21:07:47,396 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:47,400 INFO  L225             Difference]: With dead ends: 488
[2025-02-05 21:07:47,401 INFO  L226             Difference]: Without dead ends: 311
[2025-02-05 21:07:47,402 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 485 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240
[2025-02-05 21:07:47,402 INFO  L435           NwaCegarLoop]: 129 mSDtfsCounter, 319 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:47,403 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 308 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 21:07:47,404 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 311 states.
[2025-02-05 21:07:47,432 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 299.
[2025-02-05 21:07:47,433 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 299 states, 192 states have (on average 1.4166666666666667) internal successors, (272), 193 states have internal predecessors, (272), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100)
[2025-02-05 21:07:47,437 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 472 transitions.
[2025-02-05 21:07:47,437 INFO  L78                 Accepts]: Start accepts. Automaton has 299 states and 472 transitions. Word has length 247
[2025-02-05 21:07:47,438 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:47,438 INFO  L471      AbstractCegarLoop]: Abstraction has 299 states and 472 transitions.
[2025-02-05 21:07:47,438 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75)
[2025-02-05 21:07:47,438 INFO  L276                IsEmpty]: Start isEmpty. Operand 299 states and 472 transitions.
[2025-02-05 21:07:47,441 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2025-02-05 21:07:47,441 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:47,441 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:47,453 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0
[2025-02-05 21:07:47,642 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-02-05 21:07:47,642 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:47,643 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:47,643 INFO  L85        PathProgramCache]: Analyzing trace with hash -462028635, now seen corresponding path program 1 times
[2025-02-05 21:07:47,644 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-02-05 21:07:47,644 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789086019]
[2025-02-05 21:07:47,644 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:47,644 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-02-05 21:07:47,644 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2025-02-05 21:07:47,646 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-02-05 21:07:47,648 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2025-02-05 21:07:47,691 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes.
[2025-02-05 21:07:47,896 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements.
[2025-02-05 21:07:47,896 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:47,896 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:47,909 INFO  L256         TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 21:07:47,912 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 21:07:48,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-02-05 21:07:48,235 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 21:07:48,235 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-02-05 21:07:48,235 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789086019]
[2025-02-05 21:07:48,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [789086019] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:07:48,235 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:07:48,235 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:07:48,236 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031767755]
[2025-02-05 21:07:48,236 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:07:48,236 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 21:07:48,236 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-02-05 21:07:48,237 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 21:07:48,237 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 21:07:48,237 INFO  L87              Difference]: Start difference. First operand 299 states and 472 transitions. Second operand  has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:48,926 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:07:48,926 INFO  L93              Difference]: Finished difference Result 492 states and 773 transitions.
[2025-02-05 21:07:48,927 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 21:07:48,927 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248
[2025-02-05 21:07:48,927 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:07:48,929 INFO  L225             Difference]: With dead ends: 492
[2025-02-05 21:07:48,929 INFO  L226             Difference]: Without dead ends: 307
[2025-02-05 21:07:48,930 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 245 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 21:07:48,930 INFO  L435           NwaCegarLoop]: 299 mSDtfsCounter, 139 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 21:07:48,930 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 436 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 21:07:48,931 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 307 states.
[2025-02-05 21:07:48,948 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 299.
[2025-02-05 21:07:48,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 299 states, 192 states have (on average 1.3958333333333333) internal successors, (268), 193 states have internal predecessors, (268), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100)
[2025-02-05 21:07:48,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 468 transitions.
[2025-02-05 21:07:48,951 INFO  L78                 Accepts]: Start accepts. Automaton has 299 states and 468 transitions. Word has length 248
[2025-02-05 21:07:48,951 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:07:48,951 INFO  L471      AbstractCegarLoop]: Abstraction has 299 states and 468 transitions.
[2025-02-05 21:07:48,951 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39)
[2025-02-05 21:07:48,951 INFO  L276                IsEmpty]: Start isEmpty. Operand 299 states and 468 transitions.
[2025-02-05 21:07:48,956 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 251
[2025-02-05 21:07:48,956 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:07:48,956 INFO  L218           NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:07:48,969 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0
[2025-02-05 21:07:49,156 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-02-05 21:07:49,157 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:07:49,157 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:07:49,157 INFO  L85        PathProgramCache]: Analyzing trace with hash 1555818246, now seen corresponding path program 1 times
[2025-02-05 21:07:49,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-02-05 21:07:49,158 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111845198]
[2025-02-05 21:07:49,158 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:07:49,158 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-02-05 21:07:49,158 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2025-02-05 21:07:49,160 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-02-05 21:07:49,160 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2025-02-05 21:07:49,204 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-02-05 21:07:49,400 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-02-05 21:07:49,400 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:07:49,400 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:07:49,412 INFO  L256         TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-02-05 21:07:49,417 INFO  L279         TraceCheckSpWp]: Computing forward predicates...