./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 8fc3dc66
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-8fc3dc6-m
[2025-03-16 23:39:17,322 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-16 23:39:17,373 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-16 23:39:17,376 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-16 23:39:17,377 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-16 23:39:17,389 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-16 23:39:17,391 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-16 23:39:17,392 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-16 23:39:17,392 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-16 23:39:17,392 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-16 23:39:17,392 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-16 23:39:17,393 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-16 23:39:17,393 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-16 23:39:17,393 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-16 23:39:17,393 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-16 23:39:17,393 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-16 23:39:17,394 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-16 23:39:17,394 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-16 23:39:17,394 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-16 23:39:17,394 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-16 23:39:17,394 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-16 23:39:17,395 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-16 23:39:17,395 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-16 23:39:17,395 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-16 23:39:17,395 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-16 23:39:17,395 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-16 23:39:17,395 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-16 23:39:17,395 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-16 23:39:17,395 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-16 23:39:17,395 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-16 23:39:17,395 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-16 23:39:17,395 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-16 23:39:17,395 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 23:39:17,395 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-16 23:39:17,395 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-16 23:39:17,395 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-16 23:39:17,396 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-16 23:39:17,396 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-16 23:39:17,396 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-16 23:39:17,396 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-16 23:39:17,396 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-16 23:39:17,396 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-16 23:39:17,396 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-16 23:39:17,396 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/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-03-16 23:39:17,617 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 23:39:17,624 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 23:39:17,626 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 23:39:17,627 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 23:39:17,627 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 23:39:17,628 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-03-16 23:39:18,804 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b073fe53/af801981dac043298d81be0516e37c9c/FLAG7f732116a
[2025-03-16 23:39:19,106 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 23:39:19,106 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-03-16 23:39:19,117 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b073fe53/af801981dac043298d81be0516e37c9c/FLAG7f732116a
[2025-03-16 23:39:19,376 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b073fe53/af801981dac043298d81be0516e37c9c
[2025-03-16 23:39:19,379 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 23:39:19,380 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 23:39:19,382 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 23:39:19,382 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 23:39:19,385 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 23:39:19,385 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:39:19" (1/1) ...
[2025-03-16 23:39:19,386 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6071136a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:19, skipping insertion in model container
[2025-03-16 23:39:19,386 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:39:19" (1/1) ...
[2025-03-16 23:39:19,403 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 23:39:19,498 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929]
[2025-03-16 23:39:19,575 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 23:39:19,588 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 23:39:19,597 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929]
[2025-03-16 23:39:19,638 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 23:39:19,654 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 23:39:19,654 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:19 WrapperNode
[2025-03-16 23:39:19,655 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 23:39:19,655 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 23:39:19,655 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 23:39:19,655 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 23:39:19,659 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:19" (1/1) ...
[2025-03-16 23:39:19,667 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:19" (1/1) ...
[2025-03-16 23:39:19,700 INFO  L138                Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 315
[2025-03-16 23:39:19,700 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 23:39:19,700 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 23:39:19,701 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 23:39:19,701 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 23:39:19,707 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:19" (1/1) ...
[2025-03-16 23:39:19,708 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:19" (1/1) ...
[2025-03-16 23:39:19,715 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:19" (1/1) ...
[2025-03-16 23:39:19,730 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-03-16 23:39:19,733 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:19" (1/1) ...
[2025-03-16 23:39:19,734 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:19" (1/1) ...
[2025-03-16 23:39:19,740 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:19" (1/1) ...
[2025-03-16 23:39:19,741 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:19" (1/1) ...
[2025-03-16 23:39:19,742 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:19" (1/1) ...
[2025-03-16 23:39:19,743 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:19" (1/1) ...
[2025-03-16 23:39:19,745 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 23:39:19,746 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 23:39:19,746 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 23:39:19,746 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 23:39:19,752 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:19" (1/1) ...
[2025-03-16 23:39:19,755 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 23:39:19,764 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 23:39:19,776 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-16 23:39:19,781 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-16 23:39:19,795 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 23:39:19,795 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-16 23:39:19,795 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-16 23:39:19,795 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-16 23:39:19,795 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 23:39:19,795 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 23:39:19,870 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 23:39:19,871 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 23:39:20,230 INFO  L?                        ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2025-03-16 23:39:20,230 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 23:39:20,246 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 23:39:20,246 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 23:39:20,246 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:39:20 BoogieIcfgContainer
[2025-03-16 23:39:20,246 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 23:39:20,250 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 23:39:20,250 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 23:39:20,253 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 23:39:20,253 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:39:19" (1/3) ...
[2025-03-16 23:39:20,254 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c28442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:39:20, skipping insertion in model container
[2025-03-16 23:39:20,254 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:19" (2/3) ...
[2025-03-16 23:39:20,255 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c28442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:39:20, skipping insertion in model container
[2025-03-16 23:39:20,255 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:39:20" (3/3) ...
[2025-03-16 23:39:20,256 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-03-16 23:39:20,265 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 23:39:20,267 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i that has 2 procedures, 127 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-16 23:39:20,304 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 23:39:20,312 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;@65f4d133, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 23:39:20,313 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 23:39:20,315 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 127 states, 85 states have (on average 1.5647058823529412) internal successors, (133), 86 states have internal predecessors, (133), 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-03-16 23:39:20,331 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 247
[2025-03-16 23:39:20,331 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:20,332 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-03-16 23:39:20,332 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:20,336 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:20,336 INFO  L85        PathProgramCache]: Analyzing trace with hash 301439038, now seen corresponding path program 1 times
[2025-03-16 23:39:20,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:20,342 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610888801]
[2025-03-16 23:39:20,342 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:20,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:20,439 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes.
[2025-03-16 23:39:20,467 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements.
[2025-03-16 23:39:20,468 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:20,469 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:20,695 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked.
[2025-03-16 23:39:20,696 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:20,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610888801]
[2025-03-16 23:39:20,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610888801] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 23:39:20,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932000836]
[2025-03-16 23:39:20,696 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:20,697 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 23:39:20,697 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 23:39:20,705 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 23:39:20,706 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-16 23:39:20,800 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes.
[2025-03-16 23:39:20,886 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements.
[2025-03-16 23:39:20,886 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:20,886 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:20,890 INFO  L256         TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-16 23:39:20,900 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 23:39:20,925 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked.
[2025-03-16 23:39:20,925 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 23:39:20,925 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [932000836] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:20,925 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-16 23:39:20,926 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-16 23:39:20,927 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486320854]
[2025-03-16 23:39:20,928 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:20,932 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-16 23:39:20,932 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 23:39:20,948 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-16 23:39:20,948 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 23:39:20,950 INFO  L87              Difference]: Start difference. First operand  has 127 states, 85 states have (on average 1.5647058823529412) internal successors, (133), 86 states have internal predecessors, (133), 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 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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-03-16 23:39:20,986 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:20,986 INFO  L93              Difference]: Finished difference Result 251 states and 459 transitions.
[2025-03-16 23:39:20,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-16 23:39:20,989 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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 246
[2025-03-16 23:39:20,990 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:20,995 INFO  L225             Difference]: With dead ends: 251
[2025-03-16 23:39:20,996 INFO  L226             Difference]: Without dead ends: 125
[2025-03-16 23:39:21,002 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 247 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-03-16 23:39:21,004 INFO  L435           NwaCegarLoop]: 200 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, 200 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-03-16 23:39:21,005 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 23:39:21,013 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 125 states.
[2025-03-16 23:39:21,030 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125.
[2025-03-16 23:39:21,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 125 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 84 states have internal predecessors, (128), 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-03-16 23:39:21,035 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 206 transitions.
[2025-03-16 23:39:21,037 INFO  L78                 Accepts]: Start accepts. Automaton has 125 states and 206 transitions. Word has length 246
[2025-03-16 23:39:21,038 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:21,038 INFO  L471      AbstractCegarLoop]: Abstraction has 125 states and 206 transitions.
[2025-03-16 23:39:21,038 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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-03-16 23:39:21,038 INFO  L276                IsEmpty]: Start isEmpty. Operand 125 states and 206 transitions.
[2025-03-16 23:39:21,041 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 247
[2025-03-16 23:39:21,041 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:21,041 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-03-16 23:39:21,048 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-16 23:39:21,242 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-16 23:39:21,242 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:21,243 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:21,243 INFO  L85        PathProgramCache]: Analyzing trace with hash 1618496287, now seen corresponding path program 1 times
[2025-03-16 23:39:21,243 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:21,243 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620389576]
[2025-03-16 23:39:21,243 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:21,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:21,262 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes.
[2025-03-16 23:39:21,324 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements.
[2025-03-16 23:39:21,325 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:21,325 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:21,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:21,517 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:21,517 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620389576]
[2025-03-16 23:39:21,517 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620389576] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:21,517 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:21,517 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 23:39:21,517 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897102323]
[2025-03-16 23:39:21,518 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:21,518 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 23:39:21,518 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 23:39:21,519 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 23:39:21,519 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 23:39:21,519 INFO  L87              Difference]: Start difference. First operand 125 states and 206 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-03-16 23:39:21,569 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:21,569 INFO  L93              Difference]: Finished difference Result 315 states and 515 transitions.
[2025-03-16 23:39:21,571 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 23:39:21,572 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-03-16 23:39:21,572 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:21,574 INFO  L225             Difference]: With dead ends: 315
[2025-03-16 23:39:21,574 INFO  L226             Difference]: Without dead ends: 191
[2025-03-16 23:39:21,577 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-03-16 23:39:21,578 INFO  L435           NwaCegarLoop]: 292 mSDtfsCounter, 198 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 395 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-03-16 23:39:21,578 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 395 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 23:39:21,579 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 191 states.
[2025-03-16 23:39:21,596 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 125.
[2025-03-16 23:39:21,598 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 125 states, 84 states have (on average 1.5) internal successors, (126), 84 states have internal predecessors, (126), 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-03-16 23:39:21,599 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 204 transitions.
[2025-03-16 23:39:21,600 INFO  L78                 Accepts]: Start accepts. Automaton has 125 states and 204 transitions. Word has length 246
[2025-03-16 23:39:21,601 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:21,601 INFO  L471      AbstractCegarLoop]: Abstraction has 125 states and 204 transitions.
[2025-03-16 23:39:21,601 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-03-16 23:39:21,601 INFO  L276                IsEmpty]: Start isEmpty. Operand 125 states and 204 transitions.
[2025-03-16 23:39:21,607 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 248
[2025-03-16 23:39:21,607 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:21,607 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-03-16 23:39:21,607 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-16 23:39:21,608 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:21,608 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:21,608 INFO  L85        PathProgramCache]: Analyzing trace with hash -1245666319, now seen corresponding path program 1 times
[2025-03-16 23:39:21,608 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:21,609 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836190035]
[2025-03-16 23:39:21,609 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:21,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:21,625 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes.
[2025-03-16 23:39:21,661 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements.
[2025-03-16 23:39:21,661 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:21,661 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:21,964 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:21,965 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:21,965 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836190035]
[2025-03-16 23:39:21,965 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836190035] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:21,965 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:21,965 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 23:39:21,965 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947025688]
[2025-03-16 23:39:21,965 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:21,966 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 23:39:21,966 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 23:39:21,966 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 23:39:21,966 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-16 23:39:21,967 INFO  L87              Difference]: Start difference. First operand 125 states and 204 transitions. Second operand  has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-03-16 23:39:22,206 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:22,206 INFO  L93              Difference]: Finished difference Result 343 states and 559 transitions.
[2025-03-16 23:39:22,207 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-16 23:39:22,207 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 247
[2025-03-16 23:39:22,207 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:22,209 INFO  L225             Difference]: With dead ends: 343
[2025-03-16 23:39:22,209 INFO  L226             Difference]: Without dead ends: 219
[2025-03-16 23:39:22,210 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-03-16 23:39:22,210 INFO  L435           NwaCegarLoop]: 238 mSDtfsCounter, 321 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-16 23:39:22,211 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 520 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-16 23:39:22,211 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 219 states.
[2025-03-16 23:39:22,225 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 145.
[2025-03-16 23:39:22,228 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 145 states, 103 states have (on average 1.5145631067961165) internal successors, (156), 103 states have internal predecessors, (156), 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-03-16 23:39:22,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 234 transitions.
[2025-03-16 23:39:22,231 INFO  L78                 Accepts]: Start accepts. Automaton has 145 states and 234 transitions. Word has length 247
[2025-03-16 23:39:22,231 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:22,233 INFO  L471      AbstractCegarLoop]: Abstraction has 145 states and 234 transitions.
[2025-03-16 23:39:22,233 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-03-16 23:39:22,233 INFO  L276                IsEmpty]: Start isEmpty. Operand 145 states and 234 transitions.
[2025-03-16 23:39:22,235 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2025-03-16 23:39:22,236 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:22,237 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-03-16 23:39:22,237 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-16 23:39:22,237 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:22,237 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:22,237 INFO  L85        PathProgramCache]: Analyzing trace with hash 1821577578, now seen corresponding path program 1 times
[2025-03-16 23:39:22,238 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:22,238 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314810650]
[2025-03-16 23:39:22,238 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:22,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:22,255 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes.
[2025-03-16 23:39:22,276 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements.
[2025-03-16 23:39:22,277 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:22,277 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:22,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:22,430 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:22,430 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314810650]
[2025-03-16 23:39:22,431 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314810650] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:22,431 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:22,431 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 23:39:22,431 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452194954]
[2025-03-16 23:39:22,431 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:22,431 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 23:39:22,431 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 23:39:22,432 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 23:39:22,432 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 23:39:22,432 INFO  L87              Difference]: Start difference. First operand 145 states and 234 transitions. Second operand  has 3 states, 3 states have (on average 18.666666666666668) 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-03-16 23:39:22,465 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:22,467 INFO  L93              Difference]: Finished difference Result 290 states and 469 transitions.
[2025-03-16 23:39:22,468 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 23:39:22,468 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-03-16 23:39:22,469 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:22,470 INFO  L225             Difference]: With dead ends: 290
[2025-03-16 23:39:22,470 INFO  L226             Difference]: Without dead ends: 146
[2025-03-16 23:39:22,471 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-03-16 23:39:22,473 INFO  L435           NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 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-03-16 23:39:22,474 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 23:39:22,474 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 146 states.
[2025-03-16 23:39:22,487 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146.
[2025-03-16 23:39:22,488 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 146 states, 104 states have (on average 1.5096153846153846) internal successors, (157), 104 states have internal predecessors, (157), 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-03-16 23:39:22,489 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 235 transitions.
[2025-03-16 23:39:22,489 INFO  L78                 Accepts]: Start accepts. Automaton has 146 states and 235 transitions. Word has length 248
[2025-03-16 23:39:22,489 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:22,490 INFO  L471      AbstractCegarLoop]: Abstraction has 146 states and 235 transitions.
[2025-03-16 23:39:22,490 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-03-16 23:39:22,490 INFO  L276                IsEmpty]: Start isEmpty. Operand 146 states and 235 transitions.
[2025-03-16 23:39:22,493 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2025-03-16 23:39:22,494 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:22,494 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-03-16 23:39:22,494 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-16 23:39:22,495 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:22,495 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:22,495 INFO  L85        PathProgramCache]: Analyzing trace with hash -1120080021, now seen corresponding path program 1 times
[2025-03-16 23:39:22,496 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:22,496 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215175600]
[2025-03-16 23:39:22,496 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:22,496 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:22,517 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes.
[2025-03-16 23:39:22,541 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements.
[2025-03-16 23:39:22,541 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:22,541 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:22,641 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:22,642 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:22,642 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215175600]
[2025-03-16 23:39:22,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215175600] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:22,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:22,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 23:39:22,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188564254]
[2025-03-16 23:39:22,643 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:22,645 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 23:39:22,645 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 23:39:22,646 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 23:39:22,646 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 23:39:22,646 INFO  L87              Difference]: Start difference. First operand 146 states and 235 transitions. Second operand  has 3 states, 3 states have (on average 18.666666666666668) 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-03-16 23:39:22,704 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:22,706 INFO  L93              Difference]: Finished difference Result 400 states and 643 transitions.
[2025-03-16 23:39:22,707 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 23:39:22,707 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-03-16 23:39:22,708 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:22,711 INFO  L225             Difference]: With dead ends: 400
[2025-03-16 23:39:22,711 INFO  L226             Difference]: Without dead ends: 255
[2025-03-16 23:39:22,712 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-03-16 23:39:22,712 INFO  L435           NwaCegarLoop]: 294 mSDtfsCounter, 136 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 477 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-03-16 23:39:22,712 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 477 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 23:39:22,713 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 255 states.
[2025-03-16 23:39:22,743 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252.
[2025-03-16 23:39:22,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 252 states, 186 states have (on average 1.5161290322580645) internal successors, (282), 187 states have internal predecessors, (282), 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-03-16 23:39:22,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 404 transitions.
[2025-03-16 23:39:22,748 INFO  L78                 Accepts]: Start accepts. Automaton has 252 states and 404 transitions. Word has length 248
[2025-03-16 23:39:22,748 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:22,748 INFO  L471      AbstractCegarLoop]: Abstraction has 252 states and 404 transitions.
[2025-03-16 23:39:22,749 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-03-16 23:39:22,751 INFO  L276                IsEmpty]: Start isEmpty. Operand 252 states and 404 transitions.
[2025-03-16 23:39:22,753 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2025-03-16 23:39:22,753 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:22,753 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-03-16 23:39:22,753 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-16 23:39:22,754 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:22,755 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:22,755 INFO  L85        PathProgramCache]: Analyzing trace with hash -1089060214, now seen corresponding path program 1 times
[2025-03-16 23:39:22,755 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:22,755 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169505431]
[2025-03-16 23:39:22,755 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:22,755 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:22,776 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes.
[2025-03-16 23:39:22,813 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements.
[2025-03-16 23:39:22,813 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:22,813 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:23,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:23,081 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:23,081 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169505431]
[2025-03-16 23:39:23,081 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169505431] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:23,081 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:23,081 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 23:39:23,081 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302712148]
[2025-03-16 23:39:23,081 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:23,082 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 23:39:23,082 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 23:39:23,082 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 23:39:23,082 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-03-16 23:39:23,083 INFO  L87              Difference]: Start difference. First operand 252 states and 404 transitions. Second operand  has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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-03-16 23:39:23,299 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:23,299 INFO  L93              Difference]: Finished difference Result 657 states and 1057 transitions.
[2025-03-16 23:39:23,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 23:39:23,300 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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-03-16 23:39:23,300 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:23,303 INFO  L225             Difference]: With dead ends: 657
[2025-03-16 23:39:23,303 INFO  L226             Difference]: Without dead ends: 406
[2025-03-16 23:39:23,306 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-03-16 23:39:23,307 INFO  L435           NwaCegarLoop]: 238 mSDtfsCounter, 392 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-16 23:39:23,308 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 519 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-16 23:39:23,308 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 406 states.
[2025-03-16 23:39:23,331 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 254.
[2025-03-16 23:39:23,332 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 254 states, 188 states have (on average 1.5212765957446808) internal successors, (286), 189 states have internal predecessors, (286), 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-03-16 23:39:23,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 408 transitions.
[2025-03-16 23:39:23,334 INFO  L78                 Accepts]: Start accepts. Automaton has 254 states and 408 transitions. Word has length 248
[2025-03-16 23:39:23,334 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:23,335 INFO  L471      AbstractCegarLoop]: Abstraction has 254 states and 408 transitions.
[2025-03-16 23:39:23,335 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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-03-16 23:39:23,335 INFO  L276                IsEmpty]: Start isEmpty. Operand 254 states and 408 transitions.
[2025-03-16 23:39:23,337 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2025-03-16 23:39:23,337 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:23,338 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-03-16 23:39:23,338 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-16 23:39:23,338 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:23,338 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:23,338 INFO  L85        PathProgramCache]: Analyzing trace with hash 1167850793, now seen corresponding path program 1 times
[2025-03-16 23:39:23,338 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:23,338 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137653776]
[2025-03-16 23:39:23,339 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:23,339 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:23,353 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes.
[2025-03-16 23:39:23,375 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements.
[2025-03-16 23:39:23,377 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:23,377 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:23,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:23,729 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:23,730 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137653776]
[2025-03-16 23:39:23,730 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137653776] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:23,730 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:23,730 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 23:39:23,730 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309888821]
[2025-03-16 23:39:23,730 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:23,730 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 23:39:23,730 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 23:39:23,731 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 23:39:23,731 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-16 23:39:23,731 INFO  L87              Difference]: Start difference. First operand 254 states and 408 transitions. Second operand  has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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-03-16 23:39:24,241 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:24,242 INFO  L93              Difference]: Finished difference Result 944 states and 1504 transitions.
[2025-03-16 23:39:24,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 23:39:24,242 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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-03-16 23:39:24,243 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:24,250 INFO  L225             Difference]: With dead ends: 944
[2025-03-16 23:39:24,250 INFO  L226             Difference]: Without dead ends: 691
[2025-03-16 23:39:24,252 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-03-16 23:39:24,252 INFO  L435           NwaCegarLoop]: 462 mSDtfsCounter, 501 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-16 23:39:24,252 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 920 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 23:39:24,253 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 691 states.
[2025-03-16 23:39:24,276 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 254.
[2025-03-16 23:39:24,277 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 254 states, 188 states have (on average 1.5106382978723405) internal successors, (284), 189 states have internal predecessors, (284), 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-03-16 23:39:24,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 406 transitions.
[2025-03-16 23:39:24,279 INFO  L78                 Accepts]: Start accepts. Automaton has 254 states and 406 transitions. Word has length 248
[2025-03-16 23:39:24,279 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:24,279 INFO  L471      AbstractCegarLoop]: Abstraction has 254 states and 406 transitions.
[2025-03-16 23:39:24,280 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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-03-16 23:39:24,280 INFO  L276                IsEmpty]: Start isEmpty. Operand 254 states and 406 transitions.
[2025-03-16 23:39:24,281 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2025-03-16 23:39:24,281 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:24,282 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-03-16 23:39:24,282 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-16 23:39:24,282 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:24,282 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:24,282 INFO  L85        PathProgramCache]: Analyzing trace with hash -2067455639, now seen corresponding path program 1 times
[2025-03-16 23:39:24,282 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:24,282 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783899250]
[2025-03-16 23:39:24,282 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:24,283 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:24,302 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes.
[2025-03-16 23:39:24,317 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements.
[2025-03-16 23:39:24,317 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:24,317 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:24,527 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:24,527 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:24,527 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783899250]
[2025-03-16 23:39:24,527 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783899250] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:24,527 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:24,527 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-16 23:39:24,528 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451829788]
[2025-03-16 23:39:24,528 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:24,528 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-16 23:39:24,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 23:39:24,529 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-16 23:39:24,529 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-16 23:39:24,529 INFO  L87              Difference]: Start difference. First operand 254 states and 406 transitions. Second operand  has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 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-03-16 23:39:25,355 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:25,355 INFO  L93              Difference]: Finished difference Result 948 states and 1505 transitions.
[2025-03-16 23:39:25,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-16 23:39:25,356 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 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-03-16 23:39:25,357 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:25,361 INFO  L225             Difference]: With dead ends: 948
[2025-03-16 23:39:25,361 INFO  L226             Difference]: Without dead ends: 695
[2025-03-16 23:39:25,363 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-03-16 23:39:25,363 INFO  L435           NwaCegarLoop]: 273 mSDtfsCounter, 677 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-16 23:39:25,363 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 1033 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-16 23:39:25,364 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 695 states.
[2025-03-16 23:39:25,414 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 474.
[2025-03-16 23:39:25,416 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 474 states, 343 states have (on average 1.4839650145772594) internal successors, (509), 345 states have internal predecessors, (509), 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-03-16 23:39:25,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 753 transitions.
[2025-03-16 23:39:25,421 INFO  L78                 Accepts]: Start accepts. Automaton has 474 states and 753 transitions. Word has length 248
[2025-03-16 23:39:25,421 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:25,421 INFO  L471      AbstractCegarLoop]: Abstraction has 474 states and 753 transitions.
[2025-03-16 23:39:25,421 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 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-03-16 23:39:25,422 INFO  L276                IsEmpty]: Start isEmpty. Operand 474 states and 753 transitions.
[2025-03-16 23:39:25,424 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2025-03-16 23:39:25,424 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:25,425 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-03-16 23:39:25,425 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-16 23:39:25,425 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:25,426 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:25,426 INFO  L85        PathProgramCache]: Analyzing trace with hash 1383039786, now seen corresponding path program 1 times
[2025-03-16 23:39:25,426 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:25,426 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47949206]
[2025-03-16 23:39:25,426 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:25,426 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:25,453 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes.
[2025-03-16 23:39:25,476 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements.
[2025-03-16 23:39:25,476 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:25,476 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:25,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:25,901 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:25,901 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47949206]
[2025-03-16 23:39:25,901 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47949206] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:25,902 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:25,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 23:39:25,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315211429]
[2025-03-16 23:39:25,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:25,903 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 23:39:25,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 23:39:25,903 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 23:39:25,904 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-16 23:39:25,904 INFO  L87              Difference]: Start difference. First operand 474 states and 753 transitions. Second operand  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-03-16 23:39:25,968 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:25,968 INFO  L93              Difference]: Finished difference Result 981 states and 1554 transitions.
[2025-03-16 23:39:25,968 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-16 23:39:25,969 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-03-16 23:39:25,969 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:25,973 INFO  L225             Difference]: With dead ends: 981
[2025-03-16 23:39:25,973 INFO  L226             Difference]: Without dead ends: 508
[2025-03-16 23:39:25,974 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-03-16 23:39:25,974 INFO  L435           NwaCegarLoop]: 192 mSDtfsCounter, 35 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 386 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-03-16 23:39:25,975 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 386 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 23:39:25,976 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 508 states.
[2025-03-16 23:39:26,014 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 490.
[2025-03-16 23:39:26,015 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 490 states, 359 states have (on average 1.4846796657381616) internal successors, (533), 361 states have internal predecessors, (533), 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-03-16 23:39:26,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 777 transitions.
[2025-03-16 23:39:26,017 INFO  L78                 Accepts]: Start accepts. Automaton has 490 states and 777 transitions. Word has length 248
[2025-03-16 23:39:26,018 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:26,018 INFO  L471      AbstractCegarLoop]: Abstraction has 490 states and 777 transitions.
[2025-03-16 23:39:26,018 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-03-16 23:39:26,018 INFO  L276                IsEmpty]: Start isEmpty. Operand 490 states and 777 transitions.
[2025-03-16 23:39:26,020 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2025-03-16 23:39:26,020 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:26,020 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-03-16 23:39:26,020 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-16 23:39:26,021 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:26,021 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:26,021 INFO  L85        PathProgramCache]: Analyzing trace with hash 1383069577, now seen corresponding path program 1 times
[2025-03-16 23:39:26,021 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:26,021 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523031970]
[2025-03-16 23:39:26,021 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:26,021 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:26,035 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes.
[2025-03-16 23:39:26,078 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements.
[2025-03-16 23:39:26,078 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:26,078 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:26,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:26,269 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:26,269 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523031970]
[2025-03-16 23:39:26,270 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523031970] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:26,270 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:26,270 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 23:39:26,270 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758903915]
[2025-03-16 23:39:26,270 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:26,270 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 23:39:26,270 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 23:39:26,271 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 23:39:26,271 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-16 23:39:26,271 INFO  L87              Difference]: Start difference. First operand 490 states and 777 transitions. Second operand  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-03-16 23:39:26,536 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:26,537 INFO  L93              Difference]: Finished difference Result 1305 states and 2076 transitions.
[2025-03-16 23:39:26,537 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-16 23:39:26,537 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-03-16 23:39:26,539 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:26,544 INFO  L225             Difference]: With dead ends: 1305
[2025-03-16 23:39:26,544 INFO  L226             Difference]: Without dead ends: 816
[2025-03-16 23:39:26,545 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-03-16 23:39:26,546 INFO  L435           NwaCegarLoop]: 194 mSDtfsCounter, 186 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 688 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-03-16 23:39:26,546 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 688 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-16 23:39:26,547 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 816 states.
[2025-03-16 23:39:26,598 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 738.
[2025-03-16 23:39:26,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 738 states, 566 states have (on average 1.5070671378091873) internal successors, (853), 568 states have internal predecessors, (853), 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-03-16 23:39:26,604 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1175 transitions.
[2025-03-16 23:39:26,605 INFO  L78                 Accepts]: Start accepts. Automaton has 738 states and 1175 transitions. Word has length 248
[2025-03-16 23:39:26,606 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:26,606 INFO  L471      AbstractCegarLoop]: Abstraction has 738 states and 1175 transitions.
[2025-03-16 23:39:26,606 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-03-16 23:39:26,606 INFO  L276                IsEmpty]: Start isEmpty. Operand 738 states and 1175 transitions.
[2025-03-16 23:39:26,608 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 250
[2025-03-16 23:39:26,608 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:26,609 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]
[2025-03-16 23:39:26,609 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-16 23:39:26,609 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:26,609 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:26,609 INFO  L85        PathProgramCache]: Analyzing trace with hash 1658807612, now seen corresponding path program 1 times
[2025-03-16 23:39:26,610 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:26,610 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901960595]
[2025-03-16 23:39:26,610 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:26,610 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:26,623 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes.
[2025-03-16 23:39:26,679 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements.
[2025-03-16 23:39:26,680 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:26,680 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:27,632 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:27,632 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:27,632 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901960595]
[2025-03-16 23:39:27,632 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901960595] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:27,632 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:27,633 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-16 23:39:27,633 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516522583]
[2025-03-16 23:39:27,634 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:27,634 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-16 23:39:27,634 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 23:39:27,635 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-16 23:39:27,635 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2025-03-16 23:39:27,635 INFO  L87              Difference]: Start difference. First operand 738 states and 1175 transitions. Second operand  has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-03-16 23:39:28,877 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:28,878 INFO  L93              Difference]: Finished difference Result 2488 states and 3964 transitions.
[2025-03-16 23:39:28,878 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-16 23:39:28,878 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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 249
[2025-03-16 23:39:28,879 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:28,886 INFO  L225             Difference]: With dead ends: 2488
[2025-03-16 23:39:28,887 INFO  L226             Difference]: Without dead ends: 1957
[2025-03-16 23:39:28,888 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-03-16 23:39:28,889 INFO  L435           NwaCegarLoop]: 273 mSDtfsCounter, 988 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 524 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-16 23:39:28,889 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 731 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [524 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-16 23:39:28,890 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1957 states.
[2025-03-16 23:39:28,989 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 784.
[2025-03-16 23:39:28,991 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 784 states, 612 states have (on average 1.4983660130718954) internal successors, (917), 614 states have internal predecessors, (917), 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-03-16 23:39:28,994 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1239 transitions.
[2025-03-16 23:39:28,996 INFO  L78                 Accepts]: Start accepts. Automaton has 784 states and 1239 transitions. Word has length 249
[2025-03-16 23:39:28,996 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:28,996 INFO  L471      AbstractCegarLoop]: Abstraction has 784 states and 1239 transitions.
[2025-03-16 23:39:28,997 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-03-16 23:39:28,997 INFO  L276                IsEmpty]: Start isEmpty. Operand 784 states and 1239 transitions.
[2025-03-16 23:39:28,998 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 250
[2025-03-16 23:39:28,998 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:28,999 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]
[2025-03-16 23:39:28,999 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-16 23:39:28,999 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:28,999 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:28,999 INFO  L85        PathProgramCache]: Analyzing trace with hash 1591800859, now seen corresponding path program 1 times
[2025-03-16 23:39:29,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:29,000 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799406253]
[2025-03-16 23:39:29,000 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:29,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:29,012 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes.
[2025-03-16 23:39:29,023 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements.
[2025-03-16 23:39:29,024 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:29,024 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:29,087 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:29,087 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:29,087 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799406253]
[2025-03-16 23:39:29,087 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799406253] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:29,087 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:29,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 23:39:29,087 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157980772]
[2025-03-16 23:39:29,087 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:29,088 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 23:39:29,088 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 23:39:29,088 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 23:39:29,088 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 23:39:29,088 INFO  L87              Difference]: Start difference. First operand 784 states and 1239 transitions. Second operand  has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-03-16 23:39:29,305 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:29,306 INFO  L93              Difference]: Finished difference Result 1509 states and 2386 transitions.
[2025-03-16 23:39:29,306 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 23:39:29,306 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 249
[2025-03-16 23:39:29,307 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:29,311 INFO  L225             Difference]: With dead ends: 1509
[2025-03-16 23:39:29,311 INFO  L226             Difference]: Without dead ends: 926
[2025-03-16 23:39:29,313 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-03-16 23:39:29,313 INFO  L435           NwaCegarLoop]: 297 mSDtfsCounter, 138 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 718 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-03-16 23:39:29,314 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 718 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 23:39:29,314 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 926 states.
[2025-03-16 23:39:29,387 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 770.
[2025-03-16 23:39:29,388 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 770 states, 598 states have (on average 1.4899665551839465) internal successors, (891), 600 states have internal predecessors, (891), 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-03-16 23:39:29,391 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1213 transitions.
[2025-03-16 23:39:29,393 INFO  L78                 Accepts]: Start accepts. Automaton has 770 states and 1213 transitions. Word has length 249
[2025-03-16 23:39:29,393 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:29,393 INFO  L471      AbstractCegarLoop]: Abstraction has 770 states and 1213 transitions.
[2025-03-16 23:39:29,393 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-03-16 23:39:29,393 INFO  L276                IsEmpty]: Start isEmpty. Operand 770 states and 1213 transitions.
[2025-03-16 23:39:29,395 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 251
[2025-03-16 23:39:29,395 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:29,395 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-03-16 23:39:29,395 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-16 23:39:29,396 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:29,396 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:29,396 INFO  L85        PathProgramCache]: Analyzing trace with hash -953515498, now seen corresponding path program 1 times
[2025-03-16 23:39:29,396 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:29,397 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532139236]
[2025-03-16 23:39:29,397 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:29,397 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:29,409 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-03-16 23:39:29,426 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-03-16 23:39:29,426 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:29,426 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:29,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:29,554 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:29,554 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532139236]
[2025-03-16 23:39:29,554 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532139236] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:29,554 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:29,554 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 23:39:29,554 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777998163]
[2025-03-16 23:39:29,555 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:29,555 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 23:39:29,555 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 23:39:29,555 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 23:39:29,555 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-16 23:39:29,556 INFO  L87              Difference]: Start difference. First operand 770 states and 1213 transitions. Second operand  has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-03-16 23:39:30,049 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:30,049 INFO  L93              Difference]: Finished difference Result 1797 states and 2837 transitions.
[2025-03-16 23:39:30,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 23:39:30,050 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-03-16 23:39:30,051 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:30,057 INFO  L225             Difference]: With dead ends: 1797
[2025-03-16 23:39:30,057 INFO  L226             Difference]: Without dead ends: 1474
[2025-03-16 23:39:30,058 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-03-16 23:39:30,058 INFO  L435           NwaCegarLoop]: 226 mSDtfsCounter, 301 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 899 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-03-16 23:39:30,059 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 899 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-16 23:39:30,060 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1474 states.
[2025-03-16 23:39:30,126 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 790.
[2025-03-16 23:39:30,128 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 790 states, 618 states have (on average 1.493527508090615) internal successors, (923), 620 states have internal predecessors, (923), 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-03-16 23:39:30,131 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1245 transitions.
[2025-03-16 23:39:30,132 INFO  L78                 Accepts]: Start accepts. Automaton has 790 states and 1245 transitions. Word has length 250
[2025-03-16 23:39:30,132 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:30,132 INFO  L471      AbstractCegarLoop]: Abstraction has 790 states and 1245 transitions.
[2025-03-16 23:39:30,133 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-03-16 23:39:30,133 INFO  L276                IsEmpty]: Start isEmpty. Operand 790 states and 1245 transitions.
[2025-03-16 23:39:30,134 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 251
[2025-03-16 23:39:30,134 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:30,135 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-03-16 23:39:30,135 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-16 23:39:30,135 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:30,135 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:30,135 INFO  L85        PathProgramCache]: Analyzing trace with hash -1362339723, now seen corresponding path program 1 times
[2025-03-16 23:39:30,135 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:30,135 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146627293]
[2025-03-16 23:39:30,135 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:30,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:30,148 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-03-16 23:39:30,159 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-03-16 23:39:30,160 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:30,160 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:30,232 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:30,232 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:30,233 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146627293]
[2025-03-16 23:39:30,233 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146627293] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:30,233 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:30,233 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 23:39:30,233 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099826323]
[2025-03-16 23:39:30,233 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:30,233 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 23:39:30,233 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 23:39:30,234 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 23:39:30,234 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 23:39:30,234 INFO  L87              Difference]: Start difference. First operand 790 states and 1245 transitions. Second operand  has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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-03-16 23:39:30,408 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:30,408 INFO  L93              Difference]: Finished difference Result 1305 states and 2061 transitions.
[2025-03-16 23:39:30,408 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 23:39:30,409 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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-03-16 23:39:30,409 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:30,413 INFO  L225             Difference]: With dead ends: 1305
[2025-03-16 23:39:30,413 INFO  L226             Difference]: Without dead ends: 946
[2025-03-16 23:39:30,414 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-03-16 23:39:30,415 INFO  L435           NwaCegarLoop]: 200 mSDtfsCounter, 138 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 520 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-03-16 23:39:30,415 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 520 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 23:39:30,416 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 946 states.
[2025-03-16 23:39:30,481 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 790.
[2025-03-16 23:39:30,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 790 states, 618 states have (on average 1.4805825242718447) internal successors, (915), 620 states have internal predecessors, (915), 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-03-16 23:39:30,486 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1237 transitions.
[2025-03-16 23:39:30,487 INFO  L78                 Accepts]: Start accepts. Automaton has 790 states and 1237 transitions. Word has length 250
[2025-03-16 23:39:30,487 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:30,487 INFO  L471      AbstractCegarLoop]: Abstraction has 790 states and 1237 transitions.
[2025-03-16 23:39:30,487 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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-03-16 23:39:30,487 INFO  L276                IsEmpty]: Start isEmpty. Operand 790 states and 1237 transitions.
[2025-03-16 23:39:30,489 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 251
[2025-03-16 23:39:30,489 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:30,489 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-03-16 23:39:30,490 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-16 23:39:30,490 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:30,490 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:30,490 INFO  L85        PathProgramCache]: Analyzing trace with hash -1429346476, now seen corresponding path program 1 times
[2025-03-16 23:39:30,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:30,490 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621944356]
[2025-03-16 23:39:30,490 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:30,491 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:30,502 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-03-16 23:39:30,512 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-03-16 23:39:30,513 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:30,513 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:30,681 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:30,682 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:30,682 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621944356]
[2025-03-16 23:39:30,682 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621944356] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:30,682 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:30,682 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 23:39:30,682 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681858132]
[2025-03-16 23:39:30,682 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:30,682 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 23:39:30,683 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 23:39:30,683 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 23:39:30,684 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 23:39:30,684 INFO  L87              Difference]: Start difference. First operand 790 states and 1237 transitions. Second operand  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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-03-16 23:39:31,043 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:31,043 INFO  L93              Difference]: Finished difference Result 1265 states and 1991 transitions.
[2025-03-16 23:39:31,044 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-16 23:39:31,044 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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-03-16 23:39:31,045 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:31,049 INFO  L225             Difference]: With dead ends: 1265
[2025-03-16 23:39:31,049 INFO  L226             Difference]: Without dead ends: 894
[2025-03-16 23:39:31,051 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-03-16 23:39:31,052 INFO  L435           NwaCegarLoop]: 400 mSDtfsCounter, 410 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-16 23:39:31,052 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 892 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-16 23:39:31,053 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 894 states.
[2025-03-16 23:39:31,109 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 744.
[2025-03-16 23:39:31,110 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 744 states, 572 states have (on average 1.4737762237762237) internal successors, (843), 574 states have internal predecessors, (843), 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-03-16 23:39:31,113 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1165 transitions.
[2025-03-16 23:39:31,114 INFO  L78                 Accepts]: Start accepts. Automaton has 744 states and 1165 transitions. Word has length 250
[2025-03-16 23:39:31,114 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:31,115 INFO  L471      AbstractCegarLoop]: Abstraction has 744 states and 1165 transitions.
[2025-03-16 23:39:31,115 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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-03-16 23:39:31,115 INFO  L276                IsEmpty]: Start isEmpty. Operand 744 states and 1165 transitions.
[2025-03-16 23:39:31,117 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 251
[2025-03-16 23:39:31,117 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:31,117 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-03-16 23:39:31,117 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-16 23:39:31,117 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:31,118 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:31,118 INFO  L85        PathProgramCache]: Analyzing trace with hash -601184904, now seen corresponding path program 1 times
[2025-03-16 23:39:31,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:31,118 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449904614]
[2025-03-16 23:39:31,118 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:31,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:31,131 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-03-16 23:39:31,143 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-03-16 23:39:31,144 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:31,144 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:31,252 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:31,252 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:31,252 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449904614]
[2025-03-16 23:39:31,252 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449904614] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:31,252 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:31,252 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 23:39:31,252 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240378562]
[2025-03-16 23:39:31,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:31,253 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 23:39:31,253 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 23:39:31,254 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 23:39:31,254 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-16 23:39:31,254 INFO  L87              Difference]: Start difference. First operand 744 states and 1165 transitions. Second operand  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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-03-16 23:39:31,634 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:31,634 INFO  L93              Difference]: Finished difference Result 1536 states and 2403 transitions.
[2025-03-16 23:39:31,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-16 23:39:31,634 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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-03-16 23:39:31,635 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:31,641 INFO  L225             Difference]: With dead ends: 1536
[2025-03-16 23:39:31,641 INFO  L226             Difference]: Without dead ends: 991
[2025-03-16 23:39:31,642 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-03-16 23:39:31,643 INFO  L435           NwaCegarLoop]: 255 mSDtfsCounter, 282 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-16 23:39:31,643 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 640 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-16 23:39:31,644 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 991 states.
[2025-03-16 23:39:31,743 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 985.
[2025-03-16 23:39:31,744 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 985 states, 761 states have (on average 1.4743758212877793) internal successors, (1122), 765 states have internal predecessors, (1122), 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-03-16 23:39:31,748 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1540 transitions.
[2025-03-16 23:39:31,749 INFO  L78                 Accepts]: Start accepts. Automaton has 985 states and 1540 transitions. Word has length 250
[2025-03-16 23:39:31,750 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:31,750 INFO  L471      AbstractCegarLoop]: Abstraction has 985 states and 1540 transitions.
[2025-03-16 23:39:31,750 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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-03-16 23:39:31,750 INFO  L276                IsEmpty]: Start isEmpty. Operand 985 states and 1540 transitions.
[2025-03-16 23:39:31,753 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 251
[2025-03-16 23:39:31,753 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:31,753 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-03-16 23:39:31,753 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-16 23:39:31,753 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:31,754 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:31,754 INFO  L85        PathProgramCache]: Analyzing trace with hash -1010009129, now seen corresponding path program 1 times
[2025-03-16 23:39:31,754 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 23:39:31,754 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684616779]
[2025-03-16 23:39:31,754 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:31,754 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 23:39:31,767 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-03-16 23:39:31,921 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-03-16 23:39:31,921 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:31,921 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:32,217 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 9 proven. 105 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked.
[2025-03-16 23:39:32,217 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 23:39:32,217 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684616779]
[2025-03-16 23:39:32,218 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684616779] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 23:39:32,218 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896169876]
[2025-03-16 23:39:32,218 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:32,218 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 23:39:32,218 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 23:39:32,220 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-16 23:39:32,222 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-16 23:39:32,300 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-03-16 23:39:32,357 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-03-16 23:39:32,357 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:32,357 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:32,360 INFO  L256         TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-03-16 23:39:32,368 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 23:39:32,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 1508 proven. 51 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked.
[2025-03-16 23:39:32,844 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-16 23:39:32,940 WARN  L320   FreeRefinementEngine]: Global settings require throwing the following exception
[2025-03-16 23:39:32,948 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-16 23:39:33,145 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-03-16 23:39:33,146 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-03-16 23:39:33,153 INFO  L158              Benchmark]: Toolchain (without parser) took 13772.71ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 104.5MB in the beginning and 398.0MB in the end (delta: -293.5MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB.
[2025-03-16 23:39:33,155 INFO  L158              Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-16 23:39:33,155 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 273.31ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 87.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-16 23:39:33,155 INFO  L158              Benchmark]: Boogie Procedure Inliner took 44.69ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 83.2MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-16 23:39:33,155 INFO  L158              Benchmark]: Boogie Preprocessor took 44.69ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 78.9MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-16 23:39:33,155 INFO  L158              Benchmark]: IcfgBuilder took 500.59ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 44.3MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-03-16 23:39:33,156 INFO  L158              Benchmark]: TraceAbstraction took 12902.75ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 43.3MB in the beginning and 398.0MB in the end (delta: -354.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB.
[2025-03-16 23:39:33,157 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 273.31ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 87.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 44.69ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 83.2MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 44.69ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 78.9MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 500.59ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 44.3MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 12902.75ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 43.3MB in the beginning and 398.0MB in the end (delta: -354.7MB). Peak memory consumption was 35.7MB. 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-03-16 23:39:33,176 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-8fc3dc6-m
[2025-03-16 23:39:35,048 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-16 23:39:35,132 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-16 23:39:35,140 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-16 23:39:35,141 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-16 23:39:35,182 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-16 23:39:35,183 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-16 23:39:35,183 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-16 23:39:35,183 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-16 23:39:35,183 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-16 23:39:35,183 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-16 23:39:35,183 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-16 23:39:35,184 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-16 23:39:35,184 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-16 23:39:35,184 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-16 23:39:35,184 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-16 23:39:35,184 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-16 23:39:35,184 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-16 23:39:35,184 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-16 23:39:35,184 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-16 23:39:35,184 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-16 23:39:35,184 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-16 23:39:35,184 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-16 23:39:35,184 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-16 23:39:35,184 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-16 23:39:35,187 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-16 23:39:35,187 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-16 23:39:35,187 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-16 23:39:35,187 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-16 23:39:35,187 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-16 23:39:35,187 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-16 23:39:35,187 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-16 23:39:35,187 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-16 23:39:35,188 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-16 23:39:35,188 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 23:39:35,188 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-16 23:39:35,188 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-16 23:39:35,188 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-16 23:39:35,188 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-16 23:39:35,188 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-16 23:39:35,188 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-16 23:39:35,188 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-16 23:39:35,189 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-16 23:39:35,189 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-16 23:39:35,189 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-16 23:39:35,189 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/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-03-16 23:39:35,429 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 23:39:35,437 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 23:39:35,439 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 23:39:35,441 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 23:39:35,441 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 23:39:35,443 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-03-16 23:39:36,661 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1373ae6a8/bf955622436348d193fd5a44930aee5a/FLAG976aad12a
[2025-03-16 23:39:36,906 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 23:39:36,907 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-03-16 23:39:36,917 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1373ae6a8/bf955622436348d193fd5a44930aee5a/FLAG976aad12a
[2025-03-16 23:39:36,934 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1373ae6a8/bf955622436348d193fd5a44930aee5a
[2025-03-16 23:39:36,936 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 23:39:36,938 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 23:39:36,939 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 23:39:36,939 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 23:39:36,943 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 23:39:36,944 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:39:36" (1/1) ...
[2025-03-16 23:39:36,945 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@efc5768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:36, skipping insertion in model container
[2025-03-16 23:39:36,945 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:39:36" (1/1) ...
[2025-03-16 23:39:36,968 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 23:39:37,072 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929]
[2025-03-16 23:39:37,133 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 23:39:37,147 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 23:39:37,155 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929]
[2025-03-16 23:39:37,185 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 23:39:37,199 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 23:39:37,199 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:37 WrapperNode
[2025-03-16 23:39:37,200 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 23:39:37,201 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 23:39:37,201 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 23:39:37,201 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 23:39:37,206 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:37" (1/1) ...
[2025-03-16 23:39:37,216 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:37" (1/1) ...
[2025-03-16 23:39:37,238 INFO  L138                Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250
[2025-03-16 23:39:37,239 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 23:39:37,239 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 23:39:37,239 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 23:39:37,239 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 23:39:37,248 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:37" (1/1) ...
[2025-03-16 23:39:37,248 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:37" (1/1) ...
[2025-03-16 23:39:37,255 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:37" (1/1) ...
[2025-03-16 23:39:37,270 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-03-16 23:39:37,270 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:37" (1/1) ...
[2025-03-16 23:39:37,270 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:37" (1/1) ...
[2025-03-16 23:39:37,278 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:37" (1/1) ...
[2025-03-16 23:39:37,280 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:37" (1/1) ...
[2025-03-16 23:39:37,281 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:37" (1/1) ...
[2025-03-16 23:39:37,282 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:37" (1/1) ...
[2025-03-16 23:39:37,287 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 23:39:37,290 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 23:39:37,290 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 23:39:37,290 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 23:39:37,291 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:37" (1/1) ...
[2025-03-16 23:39:37,299 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 23:39:37,309 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 23:39:37,321 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-16 23:39:37,324 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-16 23:39:37,345 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 23:39:37,346 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-16 23:39:37,346 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-16 23:39:37,346 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-16 23:39:37,346 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 23:39:37,346 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 23:39:37,433 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 23:39:37,436 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 23:39:38,217 INFO  L?                        ?]: Removed 12 outVars from TransFormulas that were not future-live.
[2025-03-16 23:39:38,217 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 23:39:38,229 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 23:39:38,230 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 23:39:38,230 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:39:38 BoogieIcfgContainer
[2025-03-16 23:39:38,230 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 23:39:38,232 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 23:39:38,233 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 23:39:38,236 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 23:39:38,237 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:39:36" (1/3) ...
[2025-03-16 23:39:38,238 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f44b03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:39:38, skipping insertion in model container
[2025-03-16 23:39:38,238 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:39:37" (2/3) ...
[2025-03-16 23:39:38,239 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f44b03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:39:38, skipping insertion in model container
[2025-03-16 23:39:38,239 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:39:38" (3/3) ...
[2025-03-16 23:39:38,240 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i
[2025-03-16 23:39:38,250 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 23:39:38,252 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i that has 2 procedures, 108 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-16 23:39:38,289 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 23:39:38,300 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;@43cbd07a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 23:39:38,300 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 23:39:38,310 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 108 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 67 states have internal predecessors, (101), 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-03-16 23:39:38,321 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2025-03-16 23:39:38,321 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:38,322 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]
[2025-03-16 23:39:38,322 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:38,325 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:38,325 INFO  L85        PathProgramCache]: Analyzing trace with hash -510889008, now seen corresponding path program 1 times
[2025-03-16 23:39:38,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-16 23:39:38,334 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708882428]
[2025-03-16 23:39:38,334 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:38,334 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-03-16 23:39:38,334 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-16 23:39:38,337 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-16 23:39:38,338 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:39:38,436 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes.
[2025-03-16 23:39:38,664 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements.
[2025-03-16 23:39:38,664 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:38,664 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:38,676 INFO  L256         TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-16 23:39:38,683 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 23:39:38,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 1324 proven. 0 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked.
[2025-03-16 23:39:38,733 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 23:39:38,737 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-16 23:39:38,737 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708882428]
[2025-03-16 23:39:38,737 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [708882428] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:38,738 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:38,738 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 23:39:38,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571701084]
[2025-03-16 23:39:38,740 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:38,742 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-16 23:39:38,742 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-16 23:39:38,760 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-16 23:39:38,760 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 23:39:38,762 INFO  L87              Difference]: Start difference. First operand  has 108 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 67 states have internal predecessors, (101), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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-03-16 23:39:38,783 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:38,784 INFO  L93              Difference]: Finished difference Result 213 states and 395 transitions.
[2025-03-16 23:39:38,785 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-16 23:39:38,787 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 242
[2025-03-16 23:39:38,787 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:38,793 INFO  L225             Difference]: With dead ends: 213
[2025-03-16 23:39:38,794 INFO  L226             Difference]: Without dead ends: 106
[2025-03-16 23:39:38,798 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 241 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-03-16 23:39:38,801 INFO  L435           NwaCegarLoop]: 173 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, 173 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-03-16 23:39:38,802 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 23:39:38,812 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2025-03-16 23:39:38,839 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106.
[2025-03-16 23:39:38,840 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 106 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 65 states have internal predecessors, (95), 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-03-16 23:39:38,844 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 173 transitions.
[2025-03-16 23:39:38,847 INFO  L78                 Accepts]: Start accepts. Automaton has 106 states and 173 transitions. Word has length 242
[2025-03-16 23:39:38,847 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:38,847 INFO  L471      AbstractCegarLoop]: Abstraction has 106 states and 173 transitions.
[2025-03-16 23:39:38,848 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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-03-16 23:39:38,848 INFO  L276                IsEmpty]: Start isEmpty. Operand 106 states and 173 transitions.
[2025-03-16 23:39:38,851 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2025-03-16 23:39:38,851 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:38,852 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]
[2025-03-16 23:39:38,866 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0
[2025-03-16 23:39:39,052 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-16 23:39:39,053 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:39,054 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:39,054 INFO  L85        PathProgramCache]: Analyzing trace with hash 1163116337, now seen corresponding path program 1 times
[2025-03-16 23:39:39,055 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-16 23:39:39,055 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658786898]
[2025-03-16 23:39:39,055 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:39,055 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-03-16 23:39:39,055 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-16 23:39:39,059 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-16 23:39:39,060 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:39:39,160 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes.
[2025-03-16 23:39:39,412 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements.
[2025-03-16 23:39:39,412 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:39,412 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:39,426 INFO  L256         TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-16 23:39:39,431 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 23:39:39,472 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:39,472 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 23:39:39,473 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-16 23:39:39,473 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658786898]
[2025-03-16 23:39:39,473 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [658786898] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:39,473 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:39,473 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 23:39:39,473 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734140620]
[2025-03-16 23:39:39,473 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:39,474 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 23:39:39,474 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-16 23:39:39,475 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 23:39:39,475 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 23:39:39,475 INFO  L87              Difference]: Start difference. First operand 106 states and 173 transitions. Second operand  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-03-16 23:39:39,521 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:39,522 INFO  L93              Difference]: Finished difference Result 282 states and 461 transitions.
[2025-03-16 23:39:39,522 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 23:39:39,522 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 242
[2025-03-16 23:39:39,523 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:39,524 INFO  L225             Difference]: With dead ends: 282
[2025-03-16 23:39:39,525 INFO  L226             Difference]: Without dead ends: 177
[2025-03-16 23:39:39,527 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 240 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-03-16 23:39:39,527 INFO  L435           NwaCegarLoop]: 265 mSDtfsCounter, 110 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 422 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-03-16 23:39:39,528 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 422 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 23:39:39,529 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 177 states.
[2025-03-16 23:39:39,552 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174.
[2025-03-16 23:39:39,552 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 174 states, 110 states have (on average 1.4727272727272727) internal successors, (162), 111 states have internal predecessors, (162), 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-03-16 23:39:39,554 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 284 transitions.
[2025-03-16 23:39:39,554 INFO  L78                 Accepts]: Start accepts. Automaton has 174 states and 284 transitions. Word has length 242
[2025-03-16 23:39:39,555 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:39,555 INFO  L471      AbstractCegarLoop]: Abstraction has 174 states and 284 transitions.
[2025-03-16 23:39:39,555 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-03-16 23:39:39,555 INFO  L276                IsEmpty]: Start isEmpty. Operand 174 states and 284 transitions.
[2025-03-16 23:39:39,557 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2025-03-16 23:39:39,557 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:39,558 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]
[2025-03-16 23:39:39,570 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0
[2025-03-16 23:39:39,758 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-16 23:39:39,758 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:39,759 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:39,759 INFO  L85        PathProgramCache]: Analyzing trace with hash 1374467250, now seen corresponding path program 1 times
[2025-03-16 23:39:39,759 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-16 23:39:39,759 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164902995]
[2025-03-16 23:39:39,760 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:39,760 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-03-16 23:39:39,760 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-16 23:39:39,761 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-16 23:39:39,763 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:39:39,816 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes.
[2025-03-16 23:39:40,033 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements.
[2025-03-16 23:39:40,034 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:40,034 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:40,048 INFO  L256         TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-16 23:39:40,056 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 23:39:41,099 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:41,099 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 23:39:41,100 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-16 23:39:41,100 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164902995]
[2025-03-16 23:39:41,100 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164902995] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:41,100 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:41,100 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 23:39:41,100 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677744945]
[2025-03-16 23:39:41,100 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:41,101 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 23:39:41,102 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-16 23:39:41,102 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 23:39:41,103 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-16 23:39:41,103 INFO  L87              Difference]: Start difference. First operand 174 states and 284 transitions. Second operand  has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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-03-16 23:39:42,157 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:42,157 INFO  L93              Difference]: Finished difference Result 485 states and 794 transitions.
[2025-03-16 23:39:42,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-16 23:39:42,159 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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 242
[2025-03-16 23:39:42,160 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:42,162 INFO  L225             Difference]: With dead ends: 485
[2025-03-16 23:39:42,163 INFO  L226             Difference]: Without dead ends: 312
[2025-03-16 23:39:42,164 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 238 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-03-16 23:39:42,164 INFO  L435           NwaCegarLoop]: 169 mSDtfsCounter, 129 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-16 23:39:42,164 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 588 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-16 23:39:42,165 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 312 states.
[2025-03-16 23:39:42,195 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 280.
[2025-03-16 23:39:42,197 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 280 states, 176 states have (on average 1.4772727272727273) internal successors, (260), 177 states have internal predecessors, (260), 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-03-16 23:39:42,201 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 460 transitions.
[2025-03-16 23:39:42,202 INFO  L78                 Accepts]: Start accepts. Automaton has 280 states and 460 transitions. Word has length 242
[2025-03-16 23:39:42,202 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:42,202 INFO  L471      AbstractCegarLoop]: Abstraction has 280 states and 460 transitions.
[2025-03-16 23:39:42,203 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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-03-16 23:39:42,203 INFO  L276                IsEmpty]: Start isEmpty. Operand 280 states and 460 transitions.
[2025-03-16 23:39:42,207 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 244
[2025-03-16 23:39:42,207 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:42,207 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]
[2025-03-16 23:39:42,219 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:39:42,407 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-16 23:39:42,408 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:42,408 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:42,408 INFO  L85        PathProgramCache]: Analyzing trace with hash 1393029205, now seen corresponding path program 1 times
[2025-03-16 23:39:42,409 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-16 23:39:42,409 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898778661]
[2025-03-16 23:39:42,409 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:42,409 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-03-16 23:39:42,409 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-16 23:39:42,411 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-16 23:39:42,412 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:39:42,455 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes.
[2025-03-16 23:39:42,675 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements.
[2025-03-16 23:39:42,675 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:42,675 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:42,693 INFO  L256         TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-16 23:39:42,698 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 23:39:42,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 464 proven. 105 refuted. 0 times theorem prover too weak. 2395 trivial. 0 not checked.
[2025-03-16 23:39:42,984 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-16 23:39:43,272 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 9 proven. 105 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked.
[2025-03-16 23:39:43,273 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-16 23:39:43,273 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898778661]
[2025-03-16 23:39:43,273 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898778661] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-16 23:39:43,273 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-16 23:39:43,273 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9
[2025-03-16 23:39:43,273 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497048545]
[2025-03-16 23:39:43,273 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-16 23:39:43,274 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-16 23:39:43,274 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-16 23:39:43,274 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-16 23:39:43,274 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-03-16 23:39:43,275 INFO  L87              Difference]: Start difference. First operand 280 states and 460 transitions. Second operand  has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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-03-16 23:39:43,731 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:43,732 INFO  L93              Difference]: Finished difference Result 477 states and 764 transitions.
[2025-03-16 23:39:43,737 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-16 23:39:43,737 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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 243
[2025-03-16 23:39:43,738 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:43,744 INFO  L225             Difference]: With dead ends: 477
[2025-03-16 23:39:43,744 INFO  L226             Difference]: Without dead ends: 304
[2025-03-16 23:39:43,745 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 477 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-03-16 23:39:43,745 INFO  L435           NwaCegarLoop]: 125 mSDtfsCounter, 303 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 296 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.4s IncrementalHoareTripleChecker+Time
[2025-03-16 23:39:43,745 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 296 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 23:39:43,746 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 304 states.
[2025-03-16 23:39:43,774 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 292.
[2025-03-16 23:39:43,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 292 states, 185 states have (on average 1.4324324324324325) internal successors, (265), 186 states have internal predecessors, (265), 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-03-16 23:39:43,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 465 transitions.
[2025-03-16 23:39:43,777 INFO  L78                 Accepts]: Start accepts. Automaton has 292 states and 465 transitions. Word has length 243
[2025-03-16 23:39:43,778 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:43,778 INFO  L471      AbstractCegarLoop]: Abstraction has 292 states and 465 transitions.
[2025-03-16 23:39:43,778 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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-03-16 23:39:43,778 INFO  L276                IsEmpty]: Start isEmpty. Operand 292 states and 465 transitions.
[2025-03-16 23:39:43,779 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 245
[2025-03-16 23:39:43,780 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:43,780 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]
[2025-03-16 23:39:43,791 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:39:43,980 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-03-16 23:39:43,981 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:43,981 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:43,981 INFO  L85        PathProgramCache]: Analyzing trace with hash -1257361836, now seen corresponding path program 1 times
[2025-03-16 23:39:43,982 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-16 23:39:43,982 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311582187]
[2025-03-16 23:39:43,982 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:43,982 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-03-16 23:39:43,982 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-16 23:39:43,985 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-03-16 23:39:43,986 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:39:44,022 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes.
[2025-03-16 23:39:44,233 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements.
[2025-03-16 23:39:44,233 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:44,233 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:44,246 INFO  L256         TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-16 23:39:44,250 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 23:39:44,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked.
[2025-03-16 23:39:44,602 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-16 23:39:44,602 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-16 23:39:44,602 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311582187]
[2025-03-16 23:39:44,602 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311582187] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 23:39:44,602 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 23:39:44,602 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 23:39:44,602 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132356350]
[2025-03-16 23:39:44,602 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 23:39:44,603 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 23:39:44,603 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-16 23:39:44,603 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 23:39:44,603 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 23:39:44,603 INFO  L87              Difference]: Start difference. First operand 292 states and 465 transitions. Second operand  has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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-03-16 23:39:45,507 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 23:39:45,508 INFO  L93              Difference]: Finished difference Result 481 states and 762 transitions.
[2025-03-16 23:39:45,509 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 23:39:45,509 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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 244
[2025-03-16 23:39:45,509 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 23:39:45,511 INFO  L225             Difference]: With dead ends: 481
[2025-03-16 23:39:45,511 INFO  L226             Difference]: Without dead ends: 300
[2025-03-16 23:39:45,512 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 241 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-03-16 23:39:45,512 INFO  L435           NwaCegarLoop]: 294 mSDtfsCounter, 136 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 428 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.9s IncrementalHoareTripleChecker+Time
[2025-03-16 23:39:45,512 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 428 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 23:39:45,513 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 300 states.
[2025-03-16 23:39:45,546 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 292.
[2025-03-16 23:39:45,547 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 292 states, 185 states have (on average 1.4108108108108108) internal successors, (261), 186 states have internal predecessors, (261), 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-03-16 23:39:45,549 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 461 transitions.
[2025-03-16 23:39:45,549 INFO  L78                 Accepts]: Start accepts. Automaton has 292 states and 461 transitions. Word has length 244
[2025-03-16 23:39:45,550 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 23:39:45,550 INFO  L471      AbstractCegarLoop]: Abstraction has 292 states and 461 transitions.
[2025-03-16 23:39:45,550 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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-03-16 23:39:45,550 INFO  L276                IsEmpty]: Start isEmpty. Operand 292 states and 461 transitions.
[2025-03-16 23:39:45,551 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 247
[2025-03-16 23:39:45,552 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 23:39:45,552 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-03-16 23:39:45,562 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:39:45,752 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-03-16 23:39:45,752 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 23:39:45,753 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 23:39:45,753 INFO  L85        PathProgramCache]: Analyzing trace with hash -1197667661, now seen corresponding path program 1 times
[2025-03-16 23:39:45,753 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-16 23:39:45,753 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923792108]
[2025-03-16 23:39:45,753 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 23:39:45,753 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-03-16 23:39:45,754 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-16 23:39:45,756 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-03-16 23:39:45,757 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:39:45,802 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes.
[2025-03-16 23:39:46,020 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements.
[2025-03-16 23:39:46,020 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 23:39:46,020 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 23:39:46,034 INFO  L256         TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-03-16 23:39:46,040 INFO  L279         TraceCheckSpWp]: Computing forward predicates...