./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
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_variablewrapping_wrapper-s_file-42.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 175c40674fb8455b1fc7ca299d32501cdcc37c8644c17a404e24211314abf953
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 16:50:53,797 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 16:50:53,849 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 16:50:53,852 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 16:50:53,854 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 16:50:53,876 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 16:50:53,878 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 16:50:53,878 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 16:50:53,878 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 16:50:53,878 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 16:50:53,879 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 16:50:53,879 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 16:50:53,879 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 16:50:53,879 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 16:50:53,879 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 16:50:53,879 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 16:50:53,880 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 16:50:53,880 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 16:50:53,880 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 16:50:53,880 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 16:50:53,880 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 16:50:53,880 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 16:50:53,881 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 16:50:53,881 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 16:50:53,881 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 16:50:53,881 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 16:50:53,881 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 16:50:53,881 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 16:50:53,881 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 16:50:53,881 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 16:50:53,881 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 16:50:53,881 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 16:50:53,881 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:50:53,881 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 16:50:53,881 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 16:50:53,882 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 16:50:53,882 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 16:50:53,882 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 16:50:53,882 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 16:50:53,882 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 16:50:53,882 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 16:50:53,882 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 16:50:53,882 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 16:50:53,883 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 -> 175c40674fb8455b1fc7ca299d32501cdcc37c8644c17a404e24211314abf953
[2025-03-08 16:50:54,106 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 16:50:54,114 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 16:50:54,115 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 16:50:54,116 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 16:50:54,116 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 16:50:54,118 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i
[2025-03-08 16:50:55,273 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fec4bb81/3f2da9f3d98540579f5629b5487a9ed9/FLAG18fe7b640
[2025-03-08 16:50:55,469 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 16:50:55,469 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i
[2025-03-08 16:50:55,478 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fec4bb81/3f2da9f3d98540579f5629b5487a9ed9/FLAG18fe7b640
[2025-03-08 16:50:55,494 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fec4bb81/3f2da9f3d98540579f5629b5487a9ed9
[2025-03-08 16:50:55,496 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 16:50:55,497 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 16:50:55,498 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 16:50:55,498 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 16:50:55,501 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 16:50:55,502 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:50:55" (1/1) ...
[2025-03-08 16:50:55,502 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23383db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55, skipping insertion in model container
[2025-03-08 16:50:55,502 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:50:55" (1/1) ...
[2025-03-08 16:50:55,515 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 16:50:55,618 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_variablewrapping_wrapper-s_file-42.i[916,929]
[2025-03-08 16:50:55,668 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:50:55,678 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 16:50:55,685 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_variablewrapping_wrapper-s_file-42.i[916,929]
[2025-03-08 16:50:55,727 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:50:55,741 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 16:50:55,742 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55 WrapperNode
[2025-03-08 16:50:55,742 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 16:50:55,742 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 16:50:55,742 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 16:50:55,742 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 16:50:55,746 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ...
[2025-03-08 16:50:55,754 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ...
[2025-03-08 16:50:55,787 INFO  L138                Inliner]: procedures = 30, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 433
[2025-03-08 16:50:55,788 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 16:50:55,788 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 16:50:55,788 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 16:50:55,788 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 16:50:55,794 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ...
[2025-03-08 16:50:55,794 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ...
[2025-03-08 16:50:55,800 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ...
[2025-03-08 16:50:55,810 WARN  L109           MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS
[2025-03-08 16:50:55,810 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ...
[2025-03-08 16:50:55,810 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ...
[2025-03-08 16:50:55,826 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ...
[2025-03-08 16:50:55,827 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ...
[2025-03-08 16:50:55,829 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ...
[2025-03-08 16:50:55,829 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ...
[2025-03-08 16:50:55,836 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 16:50:55,836 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 16:50:55,836 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 16:50:55,836 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 16:50:55,837 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (1/1) ...
[2025-03-08 16:50:55,845 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:50:55,854 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:50:55,865 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-08 16:50:55,868 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-08 16:50:55,885 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 16:50:55,885 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~real
[2025-03-08 16:50:55,885 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~int
[2025-03-08 16:50:55,886 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real
[2025-03-08 16:50:55,886 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2025-03-08 16:50:55,886 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real
[2025-03-08 16:50:55,886 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2025-03-08 16:50:55,886 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 16:50:55,886 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 16:50:55,886 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-03-08 16:50:55,886 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 16:50:55,886 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 16:50:55,975 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 16:50:55,976 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 16:50:56,324 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L98: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite84#1;havoc property_#t~mem73#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem83#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite108#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~short99#1;havoc property_#t~short101#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1;
[2025-03-08 16:50:56,356 INFO  L?                        ?]: Removed 122 outVars from TransFormulas that were not future-live.
[2025-03-08 16:50:56,356 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 16:50:56,366 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 16:50:56,369 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 16:50:56,370 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:50:56 BoogieIcfgContainer
[2025-03-08 16:50:56,370 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 16:50:56,372 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 16:50:56,372 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 16:50:56,375 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 16:50:56,376 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:50:55" (1/3) ...
[2025-03-08 16:50:56,376 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508f4649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:50:56, skipping insertion in model container
[2025-03-08 16:50:56,376 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:55" (2/3) ...
[2025-03-08 16:50:56,377 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508f4649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:50:56, skipping insertion in model container
[2025-03-08 16:50:56,377 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:50:56" (3/3) ...
[2025-03-08 16:50:56,378 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-42.i
[2025-03-08 16:50:56,388 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 16:50:56,389 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-42.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 16:50:56,429 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 16:50:56,436 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;@75bb1cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 16:50:56,438 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 16:50:56,440 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 86 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:50:56,449 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:50:56,450 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:50:56,451 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:50:56,451 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:50:56,455 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:50:56,455 INFO  L85        PathProgramCache]: Analyzing trace with hash 1738511439, now seen corresponding path program 1 times
[2025-03-08 16:50:56,460 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:50:56,460 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784867300]
[2025-03-08 16:50:56,460 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:50:56,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:50:56,553 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:50:56,587 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:50:56,588 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:50:56,588 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:50:56,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked.
[2025-03-08 16:50:56,740 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:50:56,741 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784867300]
[2025-03-08 16:50:56,741 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784867300] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:50:56,741 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524305622]
[2025-03-08 16:50:56,742 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:50:56,742 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:50:56,742 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:50:56,744 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-08 16:50:56,746 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-08 16:50:56,872 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:50:56,943 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:50:56,943 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:50:56,943 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:50:56,946 INFO  L256         TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 16:50:56,951 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:50:56,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked.
[2025-03-08 16:50:56,971 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:50:56,972 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [524305622] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:50:56,972 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:50:56,972 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 16:50:56,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481417178]
[2025-03-08 16:50:56,974 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:50:56,977 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 16:50:56,977 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:50:57,010 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 16:50:57,011 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:50:57,013 INFO  L87              Difference]: Start difference. First operand  has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 86 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11)
[2025-03-08 16:50:57,033 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:50:57,033 INFO  L93              Difference]: Finished difference Result 192 states and 290 transitions.
[2025-03-08 16:50:57,034 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 16:50:57,034 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103
[2025-03-08 16:50:57,035 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:50:57,038 INFO  L225             Difference]: With dead ends: 192
[2025-03-08 16:50:57,038 INFO  L226             Difference]: Without dead ends: 96
[2025-03-08 16:50:57,041 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-08 16:50:57,043 INFO  L435           NwaCegarLoop]: 135 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, 135 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-08 16:50:57,044 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:50:57,053 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2025-03-08 16:50:57,071 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96.
[2025-03-08 16:50:57,072 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:50:57,076 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions.
[2025-03-08 16:50:57,078 INFO  L78                 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 103
[2025-03-08 16:50:57,078 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:50:57,079 INFO  L471      AbstractCegarLoop]: Abstraction has 96 states and 135 transitions.
[2025-03-08 16:50:57,079 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11)
[2025-03-08 16:50:57,079 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions.
[2025-03-08 16:50:57,081 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:50:57,081 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:50:57,081 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:50:57,089 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-08 16:50:57,282 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-08 16:50:57,282 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:50:57,283 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:50:57,283 INFO  L85        PathProgramCache]: Analyzing trace with hash -1223003435, now seen corresponding path program 1 times
[2025-03-08 16:50:57,283 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:50:57,283 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758825861]
[2025-03-08 16:50:57,283 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:50:57,283 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:50:57,313 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:50:57,407 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:50:57,409 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:50:57,409 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:50:57,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:50:57,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:50:57,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758825861]
[2025-03-08 16:50:57,743 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758825861] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:50:57,743 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:50:57,743 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 16:50:57,743 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625206980]
[2025-03-08 16:50:57,743 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:50:57,744 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 16:50:57,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:50:57,744 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 16:50:57,744 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:50:57,744 INFO  L87              Difference]: Start difference. First operand 96 states and 135 transitions. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:50:57,871 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:50:57,871 INFO  L93              Difference]: Finished difference Result 189 states and 267 transitions.
[2025-03-08 16:50:57,874 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 16:50:57,874 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:50:57,874 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:50:57,875 INFO  L225             Difference]: With dead ends: 189
[2025-03-08 16:50:57,875 INFO  L226             Difference]: Without dead ends: 96
[2025-03-08 16:50:57,876 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:50:57,876 INFO  L435           NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 16:50:57,876 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 332 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 16:50:57,877 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2025-03-08 16:50:57,897 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96.
[2025-03-08 16:50:57,899 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:50:57,899 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions.
[2025-03-08 16:50:57,901 INFO  L78                 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 103
[2025-03-08 16:50:57,902 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:50:57,902 INFO  L471      AbstractCegarLoop]: Abstraction has 96 states and 134 transitions.
[2025-03-08 16:50:57,902 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:50:57,902 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions.
[2025-03-08 16:50:57,905 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:50:57,906 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:50:57,906 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:50:57,907 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 16:50:57,907 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:50:57,908 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:50:57,908 INFO  L85        PathProgramCache]: Analyzing trace with hash 994754518, now seen corresponding path program 1 times
[2025-03-08 16:50:57,908 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:50:57,908 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964945156]
[2025-03-08 16:50:57,908 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:50:57,909 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:50:57,934 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:50:57,970 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:50:57,970 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:50:57,971 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:50:58,184 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:50:58,184 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:50:58,184 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964945156]
[2025-03-08 16:50:58,184 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964945156] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:50:58,184 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:50:58,184 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 16:50:58,184 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807885901]
[2025-03-08 16:50:58,185 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:50:58,185 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 16:50:58,185 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:50:58,185 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 16:50:58,185 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:50:58,186 INFO  L87              Difference]: Start difference. First operand 96 states and 134 transitions. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:50:58,300 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:50:58,300 INFO  L93              Difference]: Finished difference Result 189 states and 265 transitions.
[2025-03-08 16:50:58,300 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 16:50:58,300 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:50:58,301 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:50:58,301 INFO  L225             Difference]: With dead ends: 189
[2025-03-08 16:50:58,301 INFO  L226             Difference]: Without dead ends: 96
[2025-03-08 16:50:58,302 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:50:58,302 INFO  L435           NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 16:50:58,302 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 16:50:58,303 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2025-03-08 16:50:58,306 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96.
[2025-03-08 16:50:58,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:50:58,307 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions.
[2025-03-08 16:50:58,307 INFO  L78                 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 103
[2025-03-08 16:50:58,307 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:50:58,307 INFO  L471      AbstractCegarLoop]: Abstraction has 96 states and 133 transitions.
[2025-03-08 16:50:58,307 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:50:58,308 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions.
[2025-03-08 16:50:58,309 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:50:58,309 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:50:58,310 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:50:58,310 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 16:50:58,310 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:50:58,311 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:50:58,312 INFO  L85        PathProgramCache]: Analyzing trace with hash 489195893, now seen corresponding path program 1 times
[2025-03-08 16:50:58,312 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:50:58,312 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079379451]
[2025-03-08 16:50:58,312 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:50:58,312 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:50:58,338 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:50:58,378 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:50:58,379 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:50:58,379 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:50:58,506 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:50:58,510 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:50:58,510 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079379451]
[2025-03-08 16:50:58,510 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079379451] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:50:58,510 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:50:58,510 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 16:50:58,511 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681148387]
[2025-03-08 16:50:58,511 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:50:58,511 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 16:50:58,511 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:50:58,511 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 16:50:58,511 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 16:50:58,511 INFO  L87              Difference]: Start difference. First operand 96 states and 133 transitions. Second operand  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:50:58,522 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:50:58,522 INFO  L93              Difference]: Finished difference Result 187 states and 261 transitions.
[2025-03-08 16:50:58,522 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 16:50:58,523 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:50:58,523 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:50:58,524 INFO  L225             Difference]: With dead ends: 187
[2025-03-08 16:50:58,524 INFO  L226             Difference]: Without dead ends: 94
[2025-03-08 16:50:58,524 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-08 16:50:58,525 INFO  L435           NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:50:58,525 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:50:58,525 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2025-03-08 16:50:58,528 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2025-03-08 16:50:58,528 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:50:58,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions.
[2025-03-08 16:50:58,529 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 103
[2025-03-08 16:50:58,529 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:50:58,529 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 130 transitions.
[2025-03-08 16:50:58,530 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:50:58,530 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions.
[2025-03-08 16:50:58,530 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:50:58,530 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:50:58,531 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:50:58,531 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 16:50:58,531 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:50:58,531 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:50:58,531 INFO  L85        PathProgramCache]: Analyzing trace with hash -1591412624, now seen corresponding path program 1 times
[2025-03-08 16:50:58,531 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:50:58,531 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341986192]
[2025-03-08 16:50:58,532 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:50:58,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:50:58,553 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:50:58,590 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:50:58,590 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:50:58,590 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:50:58,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:50:58,712 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:50:58,712 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341986192]
[2025-03-08 16:50:58,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341986192] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:50:58,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:50:58,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 16:50:58,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583007533]
[2025-03-08 16:50:58,712 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:50:58,712 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 16:50:58,712 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:50:58,713 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 16:50:58,713 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 16:50:58,713 INFO  L87              Difference]: Start difference. First operand 94 states and 130 transitions. Second operand  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:50:58,722 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:50:58,722 INFO  L93              Difference]: Finished difference Result 183 states and 255 transitions.
[2025-03-08 16:50:58,722 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 16:50:58,723 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:50:58,723 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:50:58,724 INFO  L225             Difference]: With dead ends: 183
[2025-03-08 16:50:58,725 INFO  L226             Difference]: Without dead ends: 92
[2025-03-08 16:50:58,725 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-08 16:50:58,726 INFO  L435           NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:50:58,728 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:50:58,728 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-03-08 16:50:58,733 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2025-03-08 16:50:58,736 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:50:58,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions.
[2025-03-08 16:50:58,737 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 103
[2025-03-08 16:50:58,737 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:50:58,737 INFO  L471      AbstractCegarLoop]: Abstraction has 92 states and 127 transitions.
[2025-03-08 16:50:58,737 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:50:58,738 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions.
[2025-03-08 16:50:58,738 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:50:58,738 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:50:58,738 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:50:58,739 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 16:50:58,739 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:50:58,739 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:50:58,739 INFO  L85        PathProgramCache]: Analyzing trace with hash 1748506709, now seen corresponding path program 1 times
[2025-03-08 16:50:58,739 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:50:58,739 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938578016]
[2025-03-08 16:50:58,739 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:50:58,739 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:50:58,760 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:50:58,793 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:50:58,794 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:50:58,794 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:50:59,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:50:59,048 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:50:59,048 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938578016]
[2025-03-08 16:50:59,048 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938578016] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:50:59,049 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:50:59,049 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 16:50:59,049 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421954840]
[2025-03-08 16:50:59,049 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:50:59,049 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 16:50:59,049 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:50:59,050 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 16:50:59,050 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:50:59,050 INFO  L87              Difference]: Start difference. First operand 92 states and 127 transitions. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:50:59,152 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:50:59,154 INFO  L93              Difference]: Finished difference Result 181 states and 251 transitions.
[2025-03-08 16:50:59,154 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 16:50:59,154 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:50:59,154 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:50:59,156 INFO  L225             Difference]: With dead ends: 181
[2025-03-08 16:50:59,156 INFO  L226             Difference]: Without dead ends: 92
[2025-03-08 16:50:59,156 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:50:59,157 INFO  L435           NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 16:50:59,158 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 317 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 16:50:59,158 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-03-08 16:50:59,161 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2025-03-08 16:50:59,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:50:59,164 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions.
[2025-03-08 16:50:59,164 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 103
[2025-03-08 16:50:59,165 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:50:59,165 INFO  L471      AbstractCegarLoop]: Abstraction has 92 states and 126 transitions.
[2025-03-08 16:50:59,165 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:50:59,165 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions.
[2025-03-08 16:50:59,165 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:50:59,165 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:50:59,166 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:50:59,166 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 16:50:59,166 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:50:59,166 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:50:59,166 INFO  L85        PathProgramCache]: Analyzing trace with hash -328702634, now seen corresponding path program 1 times
[2025-03-08 16:50:59,166 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:50:59,166 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986922994]
[2025-03-08 16:50:59,166 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:50:59,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:50:59,190 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:50:59,222 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:50:59,222 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:50:59,222 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:50:59,462 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:50:59,462 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:50:59,462 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986922994]
[2025-03-08 16:50:59,462 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986922994] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:50:59,462 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:50:59,462 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 16:50:59,463 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107231805]
[2025-03-08 16:50:59,463 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:50:59,463 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 16:50:59,463 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:50:59,464 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 16:50:59,464 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:50:59,464 INFO  L87              Difference]: Start difference. First operand 92 states and 126 transitions. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:50:59,565 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:50:59,565 INFO  L93              Difference]: Finished difference Result 181 states and 249 transitions.
[2025-03-08 16:50:59,565 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 16:50:59,565 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:50:59,566 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:50:59,566 INFO  L225             Difference]: With dead ends: 181
[2025-03-08 16:50:59,567 INFO  L226             Difference]: Without dead ends: 92
[2025-03-08 16:50:59,567 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:50:59,567 INFO  L435           NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 16:50:59,568 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 16:50:59,569 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-03-08 16:50:59,571 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2025-03-08 16:50:59,572 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:50:59,572 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 125 transitions.
[2025-03-08 16:50:59,573 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 125 transitions. Word has length 103
[2025-03-08 16:50:59,574 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:50:59,574 INFO  L471      AbstractCegarLoop]: Abstraction has 92 states and 125 transitions.
[2025-03-08 16:50:59,574 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:50:59,575 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 125 transitions.
[2025-03-08 16:50:59,575 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:50:59,575 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:50:59,575 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:50:59,575 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 16:50:59,575 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:50:59,576 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:50:59,576 INFO  L85        PathProgramCache]: Analyzing trace with hash -834261259, now seen corresponding path program 1 times
[2025-03-08 16:50:59,576 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:50:59,576 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750115510]
[2025-03-08 16:50:59,576 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:50:59,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:50:59,598 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:50:59,629 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:50:59,629 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:50:59,629 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:00,600 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:51:00,601 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:51:00,601 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750115510]
[2025-03-08 16:51:00,601 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750115510] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:51:00,601 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:51:00,601 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 16:51:00,601 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339780326]
[2025-03-08 16:51:00,601 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:00,601 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 16:51:00,602 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:51:00,602 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 16:51:00,602 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-08 16:51:00,602 INFO  L87              Difference]: Start difference. First operand 92 states and 125 transitions. Second operand  has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11)
[2025-03-08 16:51:00,862 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:00,863 INFO  L93              Difference]: Finished difference Result 185 states and 252 transitions.
[2025-03-08 16:51:00,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 16:51:00,863 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103
[2025-03-08 16:51:00,863 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:00,864 INFO  L225             Difference]: With dead ends: 185
[2025-03-08 16:51:00,864 INFO  L226             Difference]: Without dead ends: 96
[2025-03-08 16:51:00,864 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2025-03-08 16:51:00,864 INFO  L435           NwaCegarLoop]: 87 mSDtfsCounter, 59 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:00,865 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 428 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:51:00,865 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2025-03-08 16:51:00,868 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94.
[2025-03-08 16:51:00,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:51:00,868 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions.
[2025-03-08 16:51:00,869 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 103
[2025-03-08 16:51:00,869 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:00,869 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 127 transitions.
[2025-03-08 16:51:00,869 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11)
[2025-03-08 16:51:00,869 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions.
[2025-03-08 16:51:00,870 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:51:00,870 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:00,870 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:00,870 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 16:51:00,870 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:00,870 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:00,871 INFO  L85        PathProgramCache]: Analyzing trace with hash 1663754678, now seen corresponding path program 1 times
[2025-03-08 16:51:00,871 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:51:00,871 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320557073]
[2025-03-08 16:51:00,871 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:00,871 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:51:00,890 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:51:00,906 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:51:00,906 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:00,906 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:01,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2025-03-08 16:51:01,396 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:51:01,396 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320557073]
[2025-03-08 16:51:01,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320557073] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:51:01,396 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722606463]
[2025-03-08 16:51:01,396 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:01,396 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:51:01,396 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:51:01,398 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-08 16:51:01,399 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-08 16:51:01,513 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:51:01,566 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:51:01,567 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:01,567 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:01,569 INFO  L256         TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:01,573 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:01,615 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15
[2025-03-08 16:51:01,644 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15
[2025-03-08 16:51:01,672 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15
[2025-03-08 16:51:01,706 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:01,707 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37
[2025-03-08 16:51:01,737 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:01,737 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40
[2025-03-08 16:51:01,761 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:01,761 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 40
[2025-03-08 16:51:01,784 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:01,784 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40
[2025-03-08 16:51:01,806 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:01,807 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 30
[2025-03-08 16:51:01,811 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked.
[2025-03-08 16:51:01,811 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:51:02,024 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2025-03-08 16:51:02,024 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [722606463] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 16:51:02,024 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 16:51:02,024 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 12
[2025-03-08 16:51:02,025 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853219959]
[2025-03-08 16:51:02,025 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 16:51:02,025 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-08 16:51:02,025 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:51:02,025 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-08 16:51:02,025 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2025-03-08 16:51:02,026 INFO  L87              Difference]: Start difference. First operand 94 states and 127 transitions. Second operand  has 12 states, 9 states have (on average 8.11111111111111) internal successors, (73), 12 states have internal predecessors, (73), 5 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19)
[2025-03-08 16:51:02,437 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:02,437 INFO  L93              Difference]: Finished difference Result 195 states and 260 transitions.
[2025-03-08 16:51:02,438 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-08 16:51:02,438 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 9 states have (on average 8.11111111111111) internal successors, (73), 12 states have internal predecessors, (73), 5 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 103
[2025-03-08 16:51:02,438 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:02,439 INFO  L225             Difference]: With dead ends: 195
[2025-03-08 16:51:02,439 INFO  L226             Difference]: Without dead ends: 104
[2025-03-08 16:51:02,439 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 202 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306
[2025-03-08 16:51:02,439 INFO  L435           NwaCegarLoop]: 61 mSDtfsCounter, 142 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:02,440 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 328 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 16:51:02,440 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2025-03-08 16:51:02,449 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98.
[2025-03-08 16:51:02,449 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 84 states have internal predecessors, (107), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:51:02,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions.
[2025-03-08 16:51:02,451 INFO  L78                 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 103
[2025-03-08 16:51:02,451 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:02,451 INFO  L471      AbstractCegarLoop]: Abstraction has 98 states and 129 transitions.
[2025-03-08 16:51:02,451 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 9 states have (on average 8.11111111111111) internal successors, (73), 12 states have internal predecessors, (73), 5 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19)
[2025-03-08 16:51:02,451 INFO  L276                IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions.
[2025-03-08 16:51:02,452 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:51:02,452 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:02,452 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:02,461 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-08 16:51:02,652 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,SelfDestructingSolverStorable8
[2025-03-08 16:51:02,652 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:02,653 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:02,653 INFO  L85        PathProgramCache]: Analyzing trace with hash 237812513, now seen corresponding path program 1 times
[2025-03-08 16:51:02,653 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:51:02,653 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882462328]
[2025-03-08 16:51:02,653 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:02,653 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:51:02,674 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:51:02,703 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:51:02,703 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:02,703 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:03,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:51:03,158 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:51:03,158 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882462328]
[2025-03-08 16:51:03,158 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882462328] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:51:03,158 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:51:03,158 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 16:51:03,158 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800653196]
[2025-03-08 16:51:03,158 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:03,158 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 16:51:03,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:51:03,158 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 16:51:03,159 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2025-03-08 16:51:03,159 INFO  L87              Difference]: Start difference. First operand 98 states and 129 transitions. Second operand  has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:03,513 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:03,513 INFO  L93              Difference]: Finished difference Result 234 states and 308 transitions.
[2025-03-08 16:51:03,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-08 16:51:03,514 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:51:03,514 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:03,515 INFO  L225             Difference]: With dead ends: 234
[2025-03-08 16:51:03,515 INFO  L226             Difference]: Without dead ends: 139
[2025-03-08 16:51:03,515 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240
[2025-03-08 16:51:03,516 INFO  L435           NwaCegarLoop]: 119 mSDtfsCounter, 100 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:03,516 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 740 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 16:51:03,516 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2025-03-08 16:51:03,521 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 96.
[2025-03-08 16:51:03,522 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 82 states have internal predecessors, (103), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:51:03,522 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions.
[2025-03-08 16:51:03,522 INFO  L78                 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 103
[2025-03-08 16:51:03,523 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:03,523 INFO  L471      AbstractCegarLoop]: Abstraction has 96 states and 125 transitions.
[2025-03-08 16:51:03,523 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:03,523 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions.
[2025-03-08 16:51:03,524 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-03-08 16:51:03,524 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:03,524 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:03,524 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 16:51:03,524 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:03,524 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:03,524 INFO  L85        PathProgramCache]: Analyzing trace with hash -555380066, now seen corresponding path program 1 times
[2025-03-08 16:51:03,524 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:51:03,524 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858960350]
[2025-03-08 16:51:03,525 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:03,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:51:03,548 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-08 16:51:03,581 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-08 16:51:03,581 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:03,581 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 16:51:03,581 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-08 16:51:03,586 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-08 16:51:03,616 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-08 16:51:03,617 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:03,617 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 16:51:03,640 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-08 16:51:03,641 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-08 16:51:03,641 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-08 16:51:03,644 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 16:51:03,647 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:51:03,687 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 16:51:03,692 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:51:03 BoogieIcfgContainer
[2025-03-08 16:51:03,692 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 16:51:03,692 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 16:51:03,692 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 16:51:03,693 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 16:51:03,693 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:50:56" (3/4) ...
[2025-03-08 16:51:03,694 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-08 16:51:03,695 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 16:51:03,696 INFO  L158              Benchmark]: Toolchain (without parser) took 8198.74ms. Allocated memory was 201.3MB in the beginning and 369.1MB in the end (delta: 167.8MB). Free memory was 154.7MB in the beginning and 214.3MB in the end (delta: -59.6MB). Peak memory consumption was 104.6MB. Max. memory is 16.1GB.
[2025-03-08 16:51:03,697 INFO  L158              Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:51:03,697 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 243.78ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 139.0MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-08 16:51:03,697 INFO  L158              Benchmark]: Boogie Procedure Inliner took 45.30ms. Allocated memory is still 201.3MB. Free memory was 139.0MB in the beginning and 135.2MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:51:03,697 INFO  L158              Benchmark]: Boogie Preprocessor took 47.64ms. Allocated memory is still 201.3MB. Free memory was 135.2MB in the beginning and 132.2MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 16:51:03,697 INFO  L158              Benchmark]: IcfgBuilder took 533.84ms. Allocated memory is still 201.3MB. Free memory was 132.2MB in the beginning and 100.6MB in the end (delta: 31.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-08 16:51:03,697 INFO  L158              Benchmark]: TraceAbstraction took 7320.19ms. Allocated memory was 201.3MB in the beginning and 369.1MB in the end (delta: 167.8MB). Free memory was 100.2MB in the beginning and 214.4MB in the end (delta: -114.2MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB.
[2025-03-08 16:51:03,697 INFO  L158              Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 369.1MB. Free memory was 214.4MB in the beginning and 214.3MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:51:03,698 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.24ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 243.78ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 139.0MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 45.30ms. Allocated memory is still 201.3MB. Free memory was 139.0MB in the beginning and 135.2MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 47.64ms. Allocated memory is still 201.3MB. Free memory was 135.2MB in the beginning and 132.2MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 533.84ms. Allocated memory is still 201.3MB. Free memory was 132.2MB in the beginning and 100.6MB in the end (delta: 31.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 7320.19ms. Allocated memory was 201.3MB in the beginning and 369.1MB in the end (delta: 167.8MB). Free memory was 100.2MB in the beginning and 214.4MB in the end (delta: -114.2MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB.
 * Witness Printer took 2.81ms. Allocated memory is still 369.1MB. Free memory was 214.4MB in the beginning and 214.3MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 53, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 98. 
Possible FailurePath: 
[L35]                  unsigned char isInitial = 0;
[L36-L48]              struct WrapperStruct00 WrapperStruct00 = {
 -1,
 5,
 4,
 16.5,
 127.25,
 1,
 0,
 0,
 0,
 0,
 0
};
           VAL         [WrapperStruct00={4:0}, isInitial=0]
[L102]                 isInitial = 1
[L103]     FCALL       initially()
[L104]     COND TRUE   1
[L105]     FCALL       updateLastVariables()
[L106]     CALL        updateVariables()
[L77]                  WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar()
[L78]      EXPR        WrapperStruct00.var_1_9
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L78]      CALL        assume_abort_if_not(WrapperStruct00.var_1_9 >= 0)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L20]      COND FALSE  !(!cond)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L78]      RET         assume_abort_if_not(WrapperStruct00.var_1_9 >= 0)
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L79]      EXPR        WrapperStruct00.var_1_9
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L79]      CALL        assume_abort_if_not(WrapperStruct00.var_1_9 <= 127)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L20]      COND FALSE  !(!cond)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L79]      RET         assume_abort_if_not(WrapperStruct00.var_1_9 <= 127)
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L80]                  WrapperStruct00.var_1_11 = __VERIFIER_nondet_float()
[L81]      EXPR        WrapperStruct00.var_1_11
[L81]      EXPR        WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F
[L81]      EXPR        WrapperStruct00.var_1_11
[L81]      EXPR        WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L81]      EXPR        (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L81]      CALL        assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ))
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L20]      COND FALSE  !(!cond)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L81]      RET         assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ))
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L82]                  WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar()
[L83]      EXPR        WrapperStruct00.var_1_13
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L83]      CALL        assume_abort_if_not(WrapperStruct00.var_1_13 >= 0)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L20]      COND FALSE  !(!cond)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L83]      RET         assume_abort_if_not(WrapperStruct00.var_1_13 >= 0)
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L84]      EXPR        WrapperStruct00.var_1_13
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L84]      CALL        assume_abort_if_not(WrapperStruct00.var_1_13 <= 0)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L20]      COND FALSE  !(!cond)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L84]      RET         assume_abort_if_not(WrapperStruct00.var_1_13 <= 0)
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L85]                  WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar()
[L86]      EXPR        WrapperStruct00.var_1_15
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L86]      CALL        assume_abort_if_not(WrapperStruct00.var_1_15 >= 0)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L20]      COND FALSE  !(!cond)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L86]      RET         assume_abort_if_not(WrapperStruct00.var_1_15 >= 0)
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L87]      EXPR        WrapperStruct00.var_1_15
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L87]      CALL        assume_abort_if_not(WrapperStruct00.var_1_15 <= 0)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L20]      COND FALSE  !(!cond)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L87]      RET         assume_abort_if_not(WrapperStruct00.var_1_15 <= 0)
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L88]                  WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar()
[L89]      EXPR        WrapperStruct00.var_1_16
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L89]      CALL        assume_abort_if_not(WrapperStruct00.var_1_16 >= 0)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L20]      COND FALSE  !(!cond)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L89]      RET         assume_abort_if_not(WrapperStruct00.var_1_16 >= 0)
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L90]      EXPR        WrapperStruct00.var_1_16
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L90]      CALL        assume_abort_if_not(WrapperStruct00.var_1_16 <= 0)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L20]      COND FALSE  !(!cond)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L90]      RET         assume_abort_if_not(WrapperStruct00.var_1_16 <= 0)
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L91]                  WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar()
[L92]      EXPR        WrapperStruct00.var_1_18
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L92]      CALL        assume_abort_if_not(WrapperStruct00.var_1_18 >= 0)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L20]      COND FALSE  !(!cond)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L92]      RET         assume_abort_if_not(WrapperStruct00.var_1_18 >= 0)
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L93]      EXPR        WrapperStruct00.var_1_18
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L93]      CALL        assume_abort_if_not(WrapperStruct00.var_1_18 <= 0)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L20]      COND FALSE  !(!cond)
           VAL         [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1]
[L93]      RET         assume_abort_if_not(WrapperStruct00.var_1_18 <= 0)
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L106]     RET         updateVariables()
[L107]     CALL        step()
[L52]      EXPR        WrapperStruct00.var_1_9
[L52]                  WrapperStruct00.var_1_8 = (WrapperStruct00.var_1_9 + 100)
[L53]      EXPR        WrapperStruct00.var_1_11
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L53]      EXPR        ((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)
[L53]      EXPR        WrapperStruct00.var_1_11
[L53]      EXPR        ((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L53]                  WrapperStruct00.var_1_10 = ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)))
[L54]      EXPR        WrapperStruct00.var_1_8
[L54]      EXPR        WrapperStruct00.var_1_8
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L54]      COND FALSE  !(WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8)
[L57]      EXPR        WrapperStruct00.var_1_8
[L57]      EXPR        WrapperStruct00.var_1_8
[L57]      EXPR        WrapperStruct00.var_1_8
[L57]      EXPR        WrapperStruct00.var_1_8
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L57]      EXPR        (((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))
[L57]      EXPR        WrapperStruct00.var_1_8
[L57]      EXPR        WrapperStruct00.var_1_8
[L57]      EXPR        (((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L57]                  WrapperStruct00.var_1_1 = (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))
[L59]      EXPR        WrapperStruct00.var_1_11
[L59]      EXPR        WrapperStruct00.var_1_10
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L59]      COND FALSE  !(WrapperStruct00.var_1_11 <= WrapperStruct00.var_1_10)
[L64]      EXPR        WrapperStruct00.var_1_8
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L64]      COND TRUE   WrapperStruct00.var_1_8 <= 1000000
[L65]                  WrapperStruct00.var_1_17 = 0
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L70]      EXPR        WrapperStruct00.var_1_10
[L70]      EXPR        WrapperStruct00.var_1_11
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L70]      COND FALSE  !((- WrapperStruct00.var_1_10) > WrapperStruct00.var_1_11)
[L73]      EXPR        WrapperStruct00.var_1_1
[L73]      EXPR        WrapperStruct00.var_1_9
[L73]      EXPR        (WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16
[L73]      EXPR        WrapperStruct00.var_1_16
[L73]      EXPR        (WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L73]                  WrapperStruct00.var_1_12 = ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16)
[L107]     RET         step()
[L108]     CALL, EXPR  property()
[L98]      EXPR        WrapperStruct00.var_1_8
[L98]      EXPR        WrapperStruct00.var_1_8
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L98]      EXPR        (WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))
[L98]      EXPR        WrapperStruct00.var_1_1
[L98]      EXPR        WrapperStruct00.var_1_8
[L98]      EXPR        WrapperStruct00.var_1_8
[L98]      EXPR        WrapperStruct00.var_1_8
[L98]      EXPR        WrapperStruct00.var_1_8
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L98]      EXPR        (((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))
[L98]      EXPR        WrapperStruct00.var_1_8
[L98]      EXPR        WrapperStruct00.var_1_8
[L98]      EXPR        (((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L98]      EXPR        (WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L98]      EXPR        ((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))
[L98]      EXPR        WrapperStruct00.var_1_8
[L98]      EXPR        WrapperStruct00.var_1_9
[L98]      EXPR        ((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L98]      EXPR        (((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)))))
[L98]      EXPR        WrapperStruct00.var_1_10
[L98]      EXPR        WrapperStruct00.var_1_11
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L98]      EXPR        ((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)
[L98]      EXPR        WrapperStruct00.var_1_11
[L98]      EXPR        ((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L98]      EXPR        (((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)))))
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L98]      EXPR        ((((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)))))) && (((- WrapperStruct00.var_1_10) > WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || (WrapperStruct00.var_1_17 && (WrapperStruct00.var_1_15 || WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_12 == ((unsigned char) ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16))))
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L98]      EXPR        (((((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)))))) && (((- WrapperStruct00.var_1_10) > WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || (WrapperStruct00.var_1_17 && (WrapperStruct00.var_1_15 || WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_12 == ((unsigned char) ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16))))) && ((WrapperStruct00.var_1_11 <= WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_18)) : 1) : ((WrapperStruct00.var_1_8 <= 1000000) ? (WrapperStruct00.var_1_17 == ((unsigned char) 0)) : (WrapperStruct00.var_1_17 == ((unsigned char) 0))))
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L98-L99]              return (((((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)))))) && (((- WrapperStruct00.var_1_10) > WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || (WrapperStruct00.var_1_17 && (WrapperStruct00.var_1_15 || WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_12 == ((unsigned char) ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16))))) && ((WrapperStruct00.var_1_11 <= WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_18)) : 1) : ((WrapperStruct00.var_1_8 <= 1000000) ? (WrapperStruct00.var_1_17 == ((unsigned char) 0)) : (WrapperStruct00.var_1_17 == ((unsigned char) 0))))
;
[L108]     RET, EXPR   property()
[L108]     CALL        __VERIFIER_assert(property())
[L19]      COND TRUE   !(cond)
           VAL         [WrapperStruct00={4:0}, isInitial=1]
[L19]                  reach_error()
           VAL         [WrapperStruct00={4:0}, isInitial=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 99 locations, 153 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 11, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 3425 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2260 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1484 IncrementalHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 1165 mSDtfsCounter, 1484 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 340 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1341 NumberOfCodeBlocks, 1341 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1326 ConstructedInterpolants, 0 QuantifiedInterpolants, 3170 SizeOfPredicates, 4 NumberOfNonLiveVariables, 798 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 2786/2860 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2025-03-08 16:51:03,716 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_variablewrapping_wrapper-s_file-42.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 175c40674fb8455b1fc7ca299d32501cdcc37c8644c17a404e24211314abf953
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 16:51:05,521 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 16:51:05,634 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-08 16:51:05,643 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 16:51:05,643 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 16:51:05,665 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 16:51:05,665 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 16:51:05,665 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 16:51:05,666 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 16:51:05,666 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 16:51:05,666 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 16:51:05,666 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 16:51:05,666 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 16:51:05,666 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 16:51:05,666 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 16:51:05,666 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 16:51:05,666 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 16:51:05,666 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 16:51:05,666 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 16:51:05,666 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 16:51:05,666 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 16:51:05,667 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 16:51:05,667 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 16:51:05,667 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-08 16:51:05,667 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-08 16:51:05,667 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-08 16:51:05,667 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 16:51:05,667 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 16:51:05,667 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 16:51:05,667 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 16:51:05,667 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 16:51:05,667 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 16:51:05,667 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 16:51:05,667 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 16:51:05,667 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:51:05,667 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 16:51:05,667 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 16:51:05,667 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 16:51:05,668 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 16:51:05,668 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-08 16:51:05,668 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-08 16:51:05,668 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 16:51:05,668 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 16:51:05,668 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 16:51:05,668 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 16:51:05,668 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 -> 175c40674fb8455b1fc7ca299d32501cdcc37c8644c17a404e24211314abf953
[2025-03-08 16:51:05,908 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 16:51:05,914 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 16:51:05,915 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 16:51:05,916 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 16:51:05,918 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 16:51:05,919 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i
[2025-03-08 16:51:07,112 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98215a4e1/0a36627dd13c4c5885ed5444d271deb8/FLAGbaa7ee307
[2025-03-08 16:51:07,291 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 16:51:07,292 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i
[2025-03-08 16:51:07,297 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98215a4e1/0a36627dd13c4c5885ed5444d271deb8/FLAGbaa7ee307
[2025-03-08 16:51:07,319 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98215a4e1/0a36627dd13c4c5885ed5444d271deb8
[2025-03-08 16:51:07,321 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 16:51:07,322 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 16:51:07,323 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 16:51:07,323 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 16:51:07,326 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 16:51:07,327 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:51:07" (1/1) ...
[2025-03-08 16:51:07,328 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc3c2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:51:07, skipping insertion in model container
[2025-03-08 16:51:07,328 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:51:07" (1/1) ...
[2025-03-08 16:51:07,340 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 16:51:07,446 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_variablewrapping_wrapper-s_file-42.i[916,929]
[2025-03-08 16:51:07,504 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:51:07,516 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 16:51:07,524 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_variablewrapping_wrapper-s_file-42.i[916,929]
[2025-03-08 16:51:07,547 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:51:07,564 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 16:51:07,564 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:51:07 WrapperNode
[2025-03-08 16:51:07,564 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 16:51:07,565 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 16:51:07,565 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 16:51:07,565 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 16:51:07,569 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:51:07" (1/1) ...
[2025-03-08 16:51:07,580 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:51:07" (1/1) ...
[2025-03-08 16:51:07,615 INFO  L138                Inliner]: procedures = 34, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 432
[2025-03-08 16:51:07,616 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 16:51:07,616 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 16:51:07,617 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 16:51:07,617 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 16:51:07,625 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:51:07" (1/1) ...
[2025-03-08 16:51:07,625 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:51:07" (1/1) ...
[2025-03-08 16:51:07,629 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:51:07" (1/1) ...
[2025-03-08 16:51:07,654 INFO  L175           MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27].
[2025-03-08 16:51:07,655 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:51:07" (1/1) ...
[2025-03-08 16:51:07,655 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:51:07" (1/1) ...
[2025-03-08 16:51:07,677 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:51:07" (1/1) ...
[2025-03-08 16:51:07,679 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:51:07" (1/1) ...
[2025-03-08 16:51:07,682 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:51:07" (1/1) ...
[2025-03-08 16:51:07,683 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:51:07" (1/1) ...
[2025-03-08 16:51:07,689 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 16:51:07,693 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 16:51:07,693 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 16:51:07,693 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 16:51:07,694 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:51:07" (1/1) ...
[2025-03-08 16:51:07,700 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:51:07,709 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:51:07,719 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-08 16:51:07,721 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-08 16:51:07,740 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 16:51:07,741 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 16:51:07,741 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2025-03-08 16:51:07,741 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2025-03-08 16:51:07,841 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 16:51:07,843 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 16:51:08,231 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L98: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite84#1;havoc property_#t~mem73#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem83#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite108#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~short99#1;havoc property_#t~short101#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1;
[2025-03-08 16:51:08,267 INFO  L?                        ?]: Removed 122 outVars from TransFormulas that were not future-live.
[2025-03-08 16:51:08,267 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 16:51:08,292 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 16:51:08,292 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 16:51:08,292 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:51:08 BoogieIcfgContainer
[2025-03-08 16:51:08,292 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 16:51:08,295 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 16:51:08,295 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 16:51:08,298 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 16:51:08,298 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:51:07" (1/3) ...
[2025-03-08 16:51:08,298 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5851e7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:51:08, skipping insertion in model container
[2025-03-08 16:51:08,298 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:51:07" (2/3) ...
[2025-03-08 16:51:08,298 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5851e7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:51:08, skipping insertion in model container
[2025-03-08 16:51:08,298 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:51:08" (3/3) ...
[2025-03-08 16:51:08,302 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-42.i
[2025-03-08 16:51:08,312 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 16:51:08,313 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-42.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 16:51:08,349 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 16:51:08,356 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;@305e2dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 16:51:08,356 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 16:51:08,358 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 86 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:51:08,364 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:51:08,365 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:08,365 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:08,365 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:08,368 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:08,369 INFO  L85        PathProgramCache]: Analyzing trace with hash 1919334507, now seen corresponding path program 1 times
[2025-03-08 16:51:08,375 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:08,375 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580049996]
[2025-03-08 16:51:08,375 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:08,375 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-08 16:51:08,376 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:08,377 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-08 16:51:08,378 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-08 16:51:08,484 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:51:08,556 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:51:08,556 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:08,556 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:08,561 INFO  L256         TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:08,568 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:08,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked.
[2025-03-08 16:51:08,599 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:51:08,600 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:08,600 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580049996]
[2025-03-08 16:51:08,600 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [580049996] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:51:08,600 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:51:08,600 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 16:51:08,601 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706236658]
[2025-03-08 16:51:08,601 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:08,604 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 16:51:08,604 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:08,617 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 16:51:08,618 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:51:08,619 INFO  L87              Difference]: Start difference. First operand  has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 86 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:08,637 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:08,637 INFO  L93              Difference]: Finished difference Result 192 states and 290 transitions.
[2025-03-08 16:51:08,638 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 16:51:08,639 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:51:08,640 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:08,644 INFO  L225             Difference]: With dead ends: 192
[2025-03-08 16:51:08,644 INFO  L226             Difference]: Without dead ends: 96
[2025-03-08 16:51:08,647 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-08 16:51:08,651 INFO  L435           NwaCegarLoop]: 135 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, 135 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-08 16:51:08,652 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:51:08,662 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2025-03-08 16:51:08,677 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96.
[2025-03-08 16:51:08,678 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:51:08,680 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions.
[2025-03-08 16:51:08,682 INFO  L78                 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 103
[2025-03-08 16:51:08,683 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:08,683 INFO  L471      AbstractCegarLoop]: Abstraction has 96 states and 135 transitions.
[2025-03-08 16:51:08,683 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:08,683 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions.
[2025-03-08 16:51:08,686 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:51:08,687 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:08,687 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:08,693 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 (2)] Ended with exit code 0
[2025-03-08 16:51:08,891 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-08 16:51:08,891 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:08,892 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:08,892 INFO  L85        PathProgramCache]: Analyzing trace with hash -830829454, now seen corresponding path program 1 times
[2025-03-08 16:51:08,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:08,893 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196984819]
[2025-03-08 16:51:08,893 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:08,894 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-08 16:51:08,894 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:08,896 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-08 16:51:08,897 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-08 16:51:08,987 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:51:09,058 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:51:09,058 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:09,058 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:09,063 INFO  L256         TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:09,066 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:09,124 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9
[2025-03-08 16:51:09,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:51:09,157 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:51:09,157 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:09,157 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196984819]
[2025-03-08 16:51:09,157 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196984819] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:51:09,160 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:51:09,161 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 16:51:09,161 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907205150]
[2025-03-08 16:51:09,161 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:09,162 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 16:51:09,162 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:09,162 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 16:51:09,162 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 16:51:09,162 INFO  L87              Difference]: Start difference. First operand 96 states and 135 transitions. Second operand  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:09,183 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:09,184 INFO  L93              Difference]: Finished difference Result 187 states and 264 transitions.
[2025-03-08 16:51:09,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 16:51:09,184 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:51:09,184 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:09,185 INFO  L225             Difference]: With dead ends: 187
[2025-03-08 16:51:09,185 INFO  L226             Difference]: Without dead ends: 94
[2025-03-08 16:51:09,186 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-08 16:51:09,186 INFO  L435           NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:09,186 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:51:09,187 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2025-03-08 16:51:09,190 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2025-03-08 16:51:09,191 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:51:09,192 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions.
[2025-03-08 16:51:09,192 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 103
[2025-03-08 16:51:09,193 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:09,193 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 131 transitions.
[2025-03-08 16:51:09,193 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:09,193 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions.
[2025-03-08 16:51:09,194 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:51:09,194 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:09,195 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:09,199 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 (3)] Forceful destruction successful, exit code 0
[2025-03-08 16:51:09,397 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-08 16:51:09,397 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:09,398 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:09,398 INFO  L85        PathProgramCache]: Analyzing trace with hash -693680018, now seen corresponding path program 1 times
[2025-03-08 16:51:09,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:09,398 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946443798]
[2025-03-08 16:51:09,398 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:09,398 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-08 16:51:09,398 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:09,402 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-08 16:51:09,402 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-08 16:51:09,474 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:51:09,539 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:51:09,539 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:09,539 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:09,544 INFO  L256         TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:09,547 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:09,557 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9
[2025-03-08 16:51:09,569 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:51:09,570 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:51:09,570 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:09,570 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946443798]
[2025-03-08 16:51:09,570 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946443798] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:51:09,570 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:51:09,570 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 16:51:09,570 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504807265]
[2025-03-08 16:51:09,570 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:09,571 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 16:51:09,571 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:09,571 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 16:51:09,571 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 16:51:09,571 INFO  L87              Difference]: Start difference. First operand 94 states and 131 transitions. Second operand  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:09,594 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:09,594 INFO  L93              Difference]: Finished difference Result 183 states and 256 transitions.
[2025-03-08 16:51:09,598 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 16:51:09,598 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:51:09,598 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:09,599 INFO  L225             Difference]: With dead ends: 183
[2025-03-08 16:51:09,599 INFO  L226             Difference]: Without dead ends: 92
[2025-03-08 16:51:09,599 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-08 16:51:09,600 INFO  L435           NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:09,600 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:51:09,600 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-03-08 16:51:09,606 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2025-03-08 16:51:09,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:51:09,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions.
[2025-03-08 16:51:09,607 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 103
[2025-03-08 16:51:09,607 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:09,608 INFO  L471      AbstractCegarLoop]: Abstraction has 92 states and 127 transitions.
[2025-03-08 16:51:09,608 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:09,608 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions.
[2025-03-08 16:51:09,608 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:51:09,609 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:09,609 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:09,614 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-08 16:51:09,809 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-08 16:51:09,809 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:09,810 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:09,810 INFO  L85        PathProgramCache]: Analyzing trace with hash 2140680690, now seen corresponding path program 1 times
[2025-03-08 16:51:09,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:09,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766123247]
[2025-03-08 16:51:09,810 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:09,810 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-08 16:51:09,810 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:09,812 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-08 16:51:09,813 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-08 16:51:09,882 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:51:09,943 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:51:09,944 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:09,944 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:09,948 INFO  L256         TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:09,950 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:09,961 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17
[2025-03-08 16:51:09,993 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:51:09,994 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:51:09,994 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:09,994 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766123247]
[2025-03-08 16:51:09,994 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766123247] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:51:09,994 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:51:09,994 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 16:51:09,994 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408372105]
[2025-03-08 16:51:09,994 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:09,995 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 16:51:09,995 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:09,995 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 16:51:09,995 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 16:51:09,995 INFO  L87              Difference]: Start difference. First operand 92 states and 127 transitions. Second operand  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:10,010 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:10,011 INFO  L93              Difference]: Finished difference Result 181 states and 251 transitions.
[2025-03-08 16:51:10,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 16:51:10,011 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:51:10,012 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:10,014 INFO  L225             Difference]: With dead ends: 181
[2025-03-08 16:51:10,015 INFO  L226             Difference]: Without dead ends: 92
[2025-03-08 16:51:10,015 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-08 16:51:10,015 INFO  L435           NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:10,016 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:51:10,016 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-03-08 16:51:10,019 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2025-03-08 16:51:10,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:51:10,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions.
[2025-03-08 16:51:10,021 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 103
[2025-03-08 16:51:10,021 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:10,021 INFO  L471      AbstractCegarLoop]: Abstraction has 92 states and 126 transitions.
[2025-03-08 16:51:10,021 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:10,021 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions.
[2025-03-08 16:51:10,022 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:51:10,022 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:10,022 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:10,028 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-08 16:51:10,222 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-08 16:51:10,223 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:10,223 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:10,223 INFO  L85        PathProgramCache]: Analyzing trace with hash 1635122065, now seen corresponding path program 1 times
[2025-03-08 16:51:10,224 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:10,224 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332415385]
[2025-03-08 16:51:10,224 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:10,224 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-08 16:51:10,224 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:10,226 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-08 16:51:10,227 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-08 16:51:10,293 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:51:10,360 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:51:10,361 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:10,361 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:10,365 INFO  L256         TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:10,368 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:10,377 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17
[2025-03-08 16:51:10,398 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:51:10,398 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:51:10,398 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:10,398 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332415385]
[2025-03-08 16:51:10,398 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332415385] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:51:10,398 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:51:10,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 16:51:10,398 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457904998]
[2025-03-08 16:51:10,398 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:10,398 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 16:51:10,398 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:10,399 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 16:51:10,399 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 16:51:10,399 INFO  L87              Difference]: Start difference. First operand 92 states and 126 transitions. Second operand  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:10,415 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:10,415 INFO  L93              Difference]: Finished difference Result 181 states and 249 transitions.
[2025-03-08 16:51:10,415 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 16:51:10,415 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:51:10,416 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:10,416 INFO  L225             Difference]: With dead ends: 181
[2025-03-08 16:51:10,416 INFO  L226             Difference]: Without dead ends: 92
[2025-03-08 16:51:10,416 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-08 16:51:10,417 INFO  L435           NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:10,417 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:51:10,417 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-03-08 16:51:10,420 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2025-03-08 16:51:10,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:51:10,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 125 transitions.
[2025-03-08 16:51:10,421 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 125 transitions. Word has length 103
[2025-03-08 16:51:10,421 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:10,421 INFO  L471      AbstractCegarLoop]: Abstraction has 92 states and 125 transitions.
[2025-03-08 16:51:10,422 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:10,422 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 125 transitions.
[2025-03-08 16:51:10,422 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:51:10,422 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:10,422 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:10,428 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 (6)] Forceful destruction successful, exit code 0
[2025-03-08 16:51:10,623 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-08 16:51:10,623 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:10,623 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:10,623 INFO  L85        PathProgramCache]: Analyzing trace with hash -442087278, now seen corresponding path program 1 times
[2025-03-08 16:51:10,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:10,624 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094537913]
[2025-03-08 16:51:10,624 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:10,624 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-08 16:51:10,624 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:10,626 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-08 16:51:10,627 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-08 16:51:10,693 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:51:10,791 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:51:10,791 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:10,791 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:10,797 INFO  L256         TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 22 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:10,801 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:10,807 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2025-03-08 16:51:10,853 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25
[2025-03-08 16:51:10,969 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:10,969 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38
[2025-03-08 16:51:11,133 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:11,134 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51
[2025-03-08 16:51:11,374 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:11,374 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 78
[2025-03-08 16:51:11,478 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:11,478 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 81
[2025-03-08 16:51:11,557 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:11,558 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 81
[2025-03-08 16:51:11,628 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:11,628 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 92
[2025-03-08 16:51:11,749 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:11,749 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 102 treesize of output 48
[2025-03-08 16:51:11,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 162 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2025-03-08 16:51:11,770 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:51:11,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2025-03-08 16:51:11,945 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:11,945 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094537913]
[2025-03-08 16:51:11,945 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094537913] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 16:51:11,945 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-08 16:51:11,945 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15
[2025-03-08 16:51:11,945 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788874567]
[2025-03-08 16:51:11,945 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-08 16:51:11,945 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-03-08 16:51:11,945 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:11,946 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-03-08 16:51:11,946 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210
[2025-03-08 16:51:11,946 INFO  L87              Difference]: Start difference. First operand 92 states and 125 transitions. Second operand  has 15 states, 13 states have (on average 6.538461538461538) internal successors, (85), 15 states have internal predecessors, (85), 7 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18)
[2025-03-08 16:51:13,172 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:13,172 INFO  L93              Difference]: Finished difference Result 251 states and 331 transitions.
[2025-03-08 16:51:13,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2025-03-08 16:51:13,173 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 13 states have (on average 6.538461538461538) internal successors, (85), 15 states have internal predecessors, (85), 7 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) Word has length 103
[2025-03-08 16:51:13,173 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:13,174 INFO  L225             Difference]: With dead ends: 251
[2025-03-08 16:51:13,174 INFO  L226             Difference]: Without dead ends: 162
[2025-03-08 16:51:13,175 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756
[2025-03-08 16:51:13,176 INFO  L435           NwaCegarLoop]: 61 mSDtfsCounter, 467 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:13,176 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 320 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 16:51:13,176 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 162 states.
[2025-03-08 16:51:13,185 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 104.
[2025-03-08 16:51:13,185 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 104 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:51:13,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 133 transitions.
[2025-03-08 16:51:13,186 INFO  L78                 Accepts]: Start accepts. Automaton has 104 states and 133 transitions. Word has length 103
[2025-03-08 16:51:13,190 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:13,190 INFO  L471      AbstractCegarLoop]: Abstraction has 104 states and 133 transitions.
[2025-03-08 16:51:13,191 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 13 states have (on average 6.538461538461538) internal successors, (85), 15 states have internal predecessors, (85), 7 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18)
[2025-03-08 16:51:13,191 INFO  L276                IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions.
[2025-03-08 16:51:13,192 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:51:13,192 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:13,192 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:13,201 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 (7)] Ended with exit code 0
[2025-03-08 16:51:13,393 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-08 16:51:13,393 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:13,393 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:13,393 INFO  L85        PathProgramCache]: Analyzing trace with hash -1868029443, now seen corresponding path program 1 times
[2025-03-08 16:51:13,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:13,394 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083625372]
[2025-03-08 16:51:13,394 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:13,394 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-08 16:51:13,394 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:13,396 INFO  L229       MonitoredProcess]: Starting monitored process 8 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-08 16:51:13,397 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 (8)] Waiting until timeout for monitored process
[2025-03-08 16:51:13,464 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:51:13,576 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:51:13,576 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:13,576 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:13,582 INFO  L256         TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 33 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:13,588 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:13,593 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2025-03-08 16:51:13,625 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15
[2025-03-08 16:51:13,644 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15
[2025-03-08 16:51:13,670 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25
[2025-03-08 16:51:13,747 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:13,748 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38
[2025-03-08 16:51:13,866 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:13,867 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51
[2025-03-08 16:51:14,056 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:14,057 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 69
[2025-03-08 16:51:14,134 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:14,135 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 72
[2025-03-08 16:51:14,190 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:14,190 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 72
[2025-03-08 16:51:14,241 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:14,242 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 84 treesize of output 83
[2025-03-08 16:51:14,380 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:14,380 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 94 treesize of output 87
[2025-03-08 16:51:14,517 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:14,517 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 128 treesize of output 62
[2025-03-08 16:51:14,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 168 proven. 27 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2025-03-08 16:51:14,549 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:51:14,656 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:51:14,657 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:14,657 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083625372]
[2025-03-08 16:51:14,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083625372] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:51:14,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:51:14,657 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 14
[2025-03-08 16:51:14,657 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608627827]
[2025-03-08 16:51:14,657 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:14,657 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:51:14,657 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:14,658 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:51:14,658 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182
[2025-03-08 16:51:14,658 INFO  L87              Difference]: Start difference. First operand 104 states and 133 transitions. Second operand  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:14,899 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:14,899 INFO  L93              Difference]: Finished difference Result 209 states and 268 transitions.
[2025-03-08 16:51:14,900 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 16:51:14,900 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:51:14,900 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:14,901 INFO  L225             Difference]: With dead ends: 209
[2025-03-08 16:51:14,901 INFO  L226             Difference]: Without dead ends: 108
[2025-03-08 16:51:14,901 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240
[2025-03-08 16:51:14,901 INFO  L435           NwaCegarLoop]: 87 mSDtfsCounter, 58 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:14,902 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 286 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:51:14,902 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 108 states.
[2025-03-08 16:51:14,907 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106.
[2025-03-08 16:51:14,907 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 106 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 90 states have internal predecessors, (113), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:51:14,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 135 transitions.
[2025-03-08 16:51:14,908 INFO  L78                 Accepts]: Start accepts. Automaton has 106 states and 135 transitions. Word has length 103
[2025-03-08 16:51:14,908 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:14,908 INFO  L471      AbstractCegarLoop]: Abstraction has 106 states and 135 transitions.
[2025-03-08 16:51:14,908 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:14,908 INFO  L276                IsEmpty]: Start isEmpty. Operand 106 states and 135 transitions.
[2025-03-08 16:51:14,909 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-08 16:51:14,909 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:14,909 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:14,915 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 (8)] Forceful destruction successful, exit code 0
[2025-03-08 16:51:15,109 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-08 16:51:15,110 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:15,110 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:15,110 INFO  L85        PathProgramCache]: Analyzing trace with hash 629986494, now seen corresponding path program 1 times
[2025-03-08 16:51:15,110 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:15,110 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015522597]
[2025-03-08 16:51:15,110 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:15,110 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-08 16:51:15,110 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:15,112 INFO  L229       MonitoredProcess]: Starting monitored process 9 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-08 16:51:15,113 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 (9)] Waiting until timeout for monitored process
[2025-03-08 16:51:15,172 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-08 16:51:15,271 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-08 16:51:15,271 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:15,271 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:15,277 INFO  L256         TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 39 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:15,283 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:15,288 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2025-03-08 16:51:15,322 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15
[2025-03-08 16:51:15,339 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25
[2025-03-08 16:51:15,411 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:15,412 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28
[2025-03-08 16:51:15,469 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:15,469 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28
[2025-03-08 16:51:15,525 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:15,525 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38
[2025-03-08 16:51:15,648 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:15,649 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56
[2025-03-08 16:51:15,708 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:15,708 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59
[2025-03-08 16:51:15,777 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:15,777 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 73
[2025-03-08 16:51:15,871 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:15,871 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 100 treesize of output 87
[2025-03-08 16:51:15,989 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:15,990 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 127 treesize of output 102
[2025-03-08 16:51:16,108 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:16,108 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 137 treesize of output 63
[2025-03-08 16:51:16,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 128 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked.
[2025-03-08 16:51:16,182 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:51:16,322 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:51:16,322 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:16,322 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015522597]
[2025-03-08 16:51:16,322 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015522597] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:51:16,322 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:51:16,322 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 21
[2025-03-08 16:51:16,322 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652552311]
[2025-03-08 16:51:16,322 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:16,322 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 16:51:16,323 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:16,323 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 16:51:16,323 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420
[2025-03-08 16:51:16,323 INFO  L87              Difference]: Start difference. First operand 106 states and 135 transitions. Second operand  has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:16,894 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:16,894 INFO  L93              Difference]: Finished difference Result 258 states and 326 transitions.
[2025-03-08 16:51:16,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 16:51:16,894 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103
[2025-03-08 16:51:16,895 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:16,896 INFO  L225             Difference]: With dead ends: 258
[2025-03-08 16:51:16,896 INFO  L226             Difference]: Without dead ends: 155
[2025-03-08 16:51:16,896 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650
[2025-03-08 16:51:16,897 INFO  L435           NwaCegarLoop]: 120 mSDtfsCounter, 101 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:16,897 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 662 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 16:51:16,897 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 155 states.
[2025-03-08 16:51:16,903 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 104.
[2025-03-08 16:51:16,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 104 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 88 states have internal predecessors, (109), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-03-08 16:51:16,903 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions.
[2025-03-08 16:51:16,904 INFO  L78                 Accepts]: Start accepts. Automaton has 104 states and 131 transitions. Word has length 103
[2025-03-08 16:51:16,904 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:16,904 INFO  L471      AbstractCegarLoop]: Abstraction has 104 states and 131 transitions.
[2025-03-08 16:51:16,904 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:16,904 INFO  L276                IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions.
[2025-03-08 16:51:16,904 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-03-08 16:51:16,904 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:16,904 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:16,911 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 (9)] Ended with exit code 0
[2025-03-08 16:51:17,105 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-08 16:51:17,105 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:17,105 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:17,105 INFO  L85        PathProgramCache]: Analyzing trace with hash -1633306245, now seen corresponding path program 1 times
[2025-03-08 16:51:17,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:17,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131967869]
[2025-03-08 16:51:17,106 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:17,106 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-08 16:51:17,106 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:17,107 INFO  L229       MonitoredProcess]: Starting monitored process 10 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-08 16:51:17,109 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 (10)] Waiting until timeout for monitored process
[2025-03-08 16:51:17,170 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-08 16:51:17,297 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-08 16:51:17,297 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:17,297 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:17,303 INFO  L256         TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 35 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:17,307 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:17,328 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2025-03-08 16:51:17,506 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44
[2025-03-08 16:51:17,665 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:17,666 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 47
[2025-03-08 16:51:17,796 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:17,797 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 57
[2025-03-08 16:51:17,995 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:17,995 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 70
[2025-03-08 16:51:18,260 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 97
[2025-03-08 16:51:18,451 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:18,452 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 182 treesize of output 133
[2025-03-08 16:51:18,579 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:18,579 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 178 treesize of output 124
[2025-03-08 16:51:18,657 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:18,657 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 184 treesize of output 135
[2025-03-08 16:51:18,760 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:18,760 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 229 treesize of output 85
[2025-03-08 16:51:18,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2025-03-08 16:51:18,820 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:51:18,820 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:18,820 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131967869]
[2025-03-08 16:51:18,820 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131967869] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:51:18,820 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:51:18,820 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-03-08 16:51:18,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148277579]
[2025-03-08 16:51:18,820 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:18,820 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-03-08 16:51:18,821 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:18,821 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-03-08 16:51:18,821 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210
[2025-03-08 16:51:18,821 INFO  L87              Difference]: Start difference. First operand 104 states and 131 transitions. Second operand  has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 14 states have internal predecessors, (65), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11)
[2025-03-08 16:51:21,477 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:21,477 INFO  L93              Difference]: Finished difference Result 351 states and 441 transitions.
[2025-03-08 16:51:21,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-03-08 16:51:21,478 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 14 states have internal predecessors, (65), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 105
[2025-03-08 16:51:21,478 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:21,479 INFO  L225             Difference]: With dead ends: 351
[2025-03-08 16:51:21,479 INFO  L226             Difference]: Without dead ends: 250
[2025-03-08 16:51:21,479 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420
[2025-03-08 16:51:21,479 INFO  L435           NwaCegarLoop]: 86 mSDtfsCounter, 524 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:21,479 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 661 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-03-08 16:51:21,480 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 250 states.
[2025-03-08 16:51:21,496 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 201.
[2025-03-08 16:51:21,496 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 201 states, 169 states have (on average 1.2189349112426036) internal successors, (206), 170 states have internal predecessors, (206), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22)
[2025-03-08 16:51:21,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 250 transitions.
[2025-03-08 16:51:21,497 INFO  L78                 Accepts]: Start accepts. Automaton has 201 states and 250 transitions. Word has length 105
[2025-03-08 16:51:21,498 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:21,498 INFO  L471      AbstractCegarLoop]: Abstraction has 201 states and 250 transitions.
[2025-03-08 16:51:21,498 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 14 states have internal predecessors, (65), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11)
[2025-03-08 16:51:21,498 INFO  L276                IsEmpty]: Start isEmpty. Operand 201 states and 250 transitions.
[2025-03-08 16:51:21,498 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-03-08 16:51:21,498 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:21,499 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:21,510 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 (10)] Ended with exit code 0
[2025-03-08 16:51:21,699 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-08 16:51:21,699 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:21,699 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:21,699 INFO  L85        PathProgramCache]: Analyzing trace with hash 16830554, now seen corresponding path program 1 times
[2025-03-08 16:51:21,700 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:21,700 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141432277]
[2025-03-08 16:51:21,700 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:21,700 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-08 16:51:21,700 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:21,701 INFO  L229       MonitoredProcess]: Starting monitored process 11 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-08 16:51:21,702 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 (11)] Waiting until timeout for monitored process
[2025-03-08 16:51:21,765 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-08 16:51:21,816 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-08 16:51:21,816 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:21,816 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:21,819 INFO  L256         TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:21,821 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:21,830 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked.
[2025-03-08 16:51:21,830 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:51:21,830 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:21,831 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141432277]
[2025-03-08 16:51:21,831 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141432277] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:51:21,831 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:51:21,831 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 16:51:21,831 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596488487]
[2025-03-08 16:51:21,831 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:21,831 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 16:51:21,831 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:21,831 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 16:51:21,831 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:51:21,832 INFO  L87              Difference]: Start difference. First operand 201 states and 250 transitions. Second operand  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11)
[2025-03-08 16:51:21,864 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:21,864 INFO  L93              Difference]: Finished difference Result 399 states and 497 transitions.
[2025-03-08 16:51:21,864 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 16:51:21,865 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105
[2025-03-08 16:51:21,865 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:21,866 INFO  L225             Difference]: With dead ends: 399
[2025-03-08 16:51:21,866 INFO  L226             Difference]: Without dead ends: 201
[2025-03-08 16:51:21,867 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:51:21,867 INFO  L435           NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 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-08 16:51:21,867 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:51:21,867 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 201 states.
[2025-03-08 16:51:21,884 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201.
[2025-03-08 16:51:21,885 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 201 states, 169 states have (on average 1.21301775147929) internal successors, (205), 170 states have internal predecessors, (205), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22)
[2025-03-08 16:51:21,886 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 249 transitions.
[2025-03-08 16:51:21,886 INFO  L78                 Accepts]: Start accepts. Automaton has 201 states and 249 transitions. Word has length 105
[2025-03-08 16:51:21,886 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:21,886 INFO  L471      AbstractCegarLoop]: Abstraction has 201 states and 249 transitions.
[2025-03-08 16:51:21,886 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11)
[2025-03-08 16:51:21,886 INFO  L276                IsEmpty]: Start isEmpty. Operand 201 states and 249 transitions.
[2025-03-08 16:51:21,891 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2025-03-08 16:51:21,891 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:21,891 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:21,896 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 (11)] Ended with exit code 0
[2025-03-08 16:51:22,091 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-08 16:51:22,091 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:22,091 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:22,092 INFO  L85        PathProgramCache]: Analyzing trace with hash -1036545859, now seen corresponding path program 1 times
[2025-03-08 16:51:22,092 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:22,092 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529080458]
[2025-03-08 16:51:22,092 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:22,092 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-08 16:51:22,092 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:22,094 INFO  L229       MonitoredProcess]: Starting monitored process 12 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-08 16:51:22,094 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 (12)] Waiting until timeout for monitored process
[2025-03-08 16:51:22,160 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-03-08 16:51:22,280 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-03-08 16:51:22,280 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:22,280 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:22,286 INFO  L256         TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 40 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:22,290 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:22,309 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2025-03-08 16:51:22,430 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31
[2025-03-08 16:51:22,575 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:22,576 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 34
[2025-03-08 16:51:22,679 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:22,679 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44
[2025-03-08 16:51:22,839 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:22,839 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 57
[2025-03-08 16:51:23,048 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84
[2025-03-08 16:51:23,224 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:23,224 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 180 treesize of output 131
[2025-03-08 16:51:23,387 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:23,387 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 176 treesize of output 122
[2025-03-08 16:51:23,478 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:23,478 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 182 treesize of output 133
[2025-03-08 16:51:23,704 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:23,704 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 192 treesize of output 137
[2025-03-08 16:51:24,146 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:24,146 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 227 treesize of output 83
[2025-03-08 16:51:24,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 158 proven. 24 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2025-03-08 16:51:24,261 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:51:24,616 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:51:24,616 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:24,616 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529080458]
[2025-03-08 16:51:24,616 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529080458] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:51:24,616 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:51:24,616 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 23
[2025-03-08 16:51:24,616 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274713259]
[2025-03-08 16:51:24,616 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:24,616 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 16:51:24,616 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:24,617 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 16:51:24,617 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506
[2025-03-08 16:51:24,617 INFO  L87              Difference]: Start difference. First operand 201 states and 249 transitions. Second operand  has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:25,637 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:25,637 INFO  L93              Difference]: Finished difference Result 479 states and 595 transitions.
[2025-03-08 16:51:25,637 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 16:51:25,638 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107
[2025-03-08 16:51:25,638 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:25,639 INFO  L225             Difference]: With dead ends: 479
[2025-03-08 16:51:25,639 INFO  L226             Difference]: Without dead ends: 281
[2025-03-08 16:51:25,639 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756
[2025-03-08 16:51:25,640 INFO  L435           NwaCegarLoop]: 78 mSDtfsCounter, 72 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:25,640 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 485 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 16:51:25,640 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 281 states.
[2025-03-08 16:51:25,657 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 220.
[2025-03-08 16:51:25,657 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 220 states, 187 states have (on average 1.213903743315508) internal successors, (227), 188 states have internal predecessors, (227), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22)
[2025-03-08 16:51:25,658 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 271 transitions.
[2025-03-08 16:51:25,658 INFO  L78                 Accepts]: Start accepts. Automaton has 220 states and 271 transitions. Word has length 107
[2025-03-08 16:51:25,658 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:25,658 INFO  L471      AbstractCegarLoop]: Abstraction has 220 states and 271 transitions.
[2025-03-08 16:51:25,659 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:25,659 INFO  L276                IsEmpty]: Start isEmpty. Operand 220 states and 271 transitions.
[2025-03-08 16:51:25,659 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2025-03-08 16:51:25,660 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:25,660 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:25,667 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 (12)] Ended with exit code 0
[2025-03-08 16:51:25,860 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-08 16:51:25,861 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:25,861 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:25,861 INFO  L85        PathProgramCache]: Analyzing trace with hash -1233059364, now seen corresponding path program 1 times
[2025-03-08 16:51:25,861 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:25,861 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25938136]
[2025-03-08 16:51:25,861 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:25,861 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-08 16:51:25,861 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:25,863 INFO  L229       MonitoredProcess]: Starting monitored process 13 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-08 16:51:25,864 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 (13)] Waiting until timeout for monitored process
[2025-03-08 16:51:25,938 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-03-08 16:51:26,043 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-03-08 16:51:26,043 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:26,043 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:26,049 INFO  L256         TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 26 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:26,053 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:26,075 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2025-03-08 16:51:26,088 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10
[2025-03-08 16:51:26,133 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24
[2025-03-08 16:51:26,203 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:26,204 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27
[2025-03-08 16:51:26,269 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:26,269 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37
[2025-03-08 16:51:26,397 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 64
[2025-03-08 16:51:26,508 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:26,508 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 100 treesize of output 87
[2025-03-08 16:51:26,571 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:26,571 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 87
[2025-03-08 16:51:26,622 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:26,622 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 98
[2025-03-08 16:51:26,754 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:26,754 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 112 treesize of output 102
[2025-03-08 16:51:26,928 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:26,928 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 120 treesize of output 48
[2025-03-08 16:51:26,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked.
[2025-03-08 16:51:26,957 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:51:26,957 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:26,957 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25938136]
[2025-03-08 16:51:26,958 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [25938136] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:51:26,958 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:51:26,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 16:51:26,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013451345]
[2025-03-08 16:51:26,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:26,958 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 16:51:26,958 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:26,958 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 16:51:26,958 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90
[2025-03-08 16:51:26,958 INFO  L87              Difference]: Start difference. First operand 220 states and 271 transitions. Second operand  has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)
[2025-03-08 16:51:28,265 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:28,265 INFO  L93              Difference]: Finished difference Result 488 states and 601 transitions.
[2025-03-08 16:51:28,266 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 16:51:28,266 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 107
[2025-03-08 16:51:28,266 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:28,267 INFO  L225             Difference]: With dead ends: 488
[2025-03-08 16:51:28,267 INFO  L226             Difference]: Without dead ends: 271
[2025-03-08 16:51:28,267 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132
[2025-03-08 16:51:28,268 INFO  L435           NwaCegarLoop]: 69 mSDtfsCounter, 328 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:28,268 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 237 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-08 16:51:28,268 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 271 states.
[2025-03-08 16:51:28,282 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 217.
[2025-03-08 16:51:28,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 217 states, 184 states have (on average 1.2065217391304348) internal successors, (222), 185 states have internal predecessors, (222), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22)
[2025-03-08 16:51:28,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 266 transitions.
[2025-03-08 16:51:28,283 INFO  L78                 Accepts]: Start accepts. Automaton has 217 states and 266 transitions. Word has length 107
[2025-03-08 16:51:28,284 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:28,284 INFO  L471      AbstractCegarLoop]: Abstraction has 217 states and 266 transitions.
[2025-03-08 16:51:28,284 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)
[2025-03-08 16:51:28,284 INFO  L276                IsEmpty]: Start isEmpty. Operand 217 states and 266 transitions.
[2025-03-08 16:51:28,284 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2025-03-08 16:51:28,284 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:28,284 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:28,291 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 (13)] Ended with exit code 0
[2025-03-08 16:51:28,485 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-08 16:51:28,485 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:28,485 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:28,486 INFO  L85        PathProgramCache]: Analyzing trace with hash -1025229732, now seen corresponding path program 1 times
[2025-03-08 16:51:28,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:28,486 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257307442]
[2025-03-08 16:51:28,486 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:28,486 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-08 16:51:28,486 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:28,489 INFO  L229       MonitoredProcess]: Starting monitored process 14 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-08 16:51:28,490 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 (14)] Waiting until timeout for monitored process
[2025-03-08 16:51:28,563 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-03-08 16:51:28,663 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-03-08 16:51:28,663 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:28,663 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:28,669 INFO  L256         TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 30 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:28,673 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:28,690 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2025-03-08 16:51:28,701 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2025-03-08 16:51:28,712 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10
[2025-03-08 16:51:28,753 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14
[2025-03-08 16:51:28,795 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24
[2025-03-08 16:51:28,903 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51
[2025-03-08 16:51:29,026 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 75
[2025-03-08 16:51:29,119 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:29,119 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 116 treesize of output 95
[2025-03-08 16:51:29,304 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:29,304 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 173 treesize of output 121
[2025-03-08 16:51:29,485 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:29,485 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 188 treesize of output 124
[2025-03-08 16:51:29,810 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:29,810 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 196 treesize of output 70
[2025-03-08 16:51:29,858 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked.
[2025-03-08 16:51:29,858 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:51:29,858 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:29,858 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257307442]
[2025-03-08 16:51:29,858 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [257307442] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:51:29,858 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:51:29,858 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-03-08 16:51:29,858 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301642269]
[2025-03-08 16:51:29,858 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:29,858 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-08 16:51:29,859 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:29,859 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-08 16:51:29,859 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132
[2025-03-08 16:51:29,859 INFO  L87              Difference]: Start difference. First operand 217 states and 266 transitions. Second operand  has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)
[2025-03-08 16:51:32,358 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:32,358 INFO  L93              Difference]: Finished difference Result 529 states and 654 transitions.
[2025-03-08 16:51:32,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-08 16:51:32,359 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 107
[2025-03-08 16:51:32,359 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:32,361 INFO  L225             Difference]: With dead ends: 529
[2025-03-08 16:51:32,361 INFO  L226             Difference]: Without dead ends: 315
[2025-03-08 16:51:32,361 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182
[2025-03-08 16:51:32,361 INFO  L435           NwaCegarLoop]: 101 mSDtfsCounter, 263 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:32,361 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 608 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-03-08 16:51:32,362 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 315 states.
[2025-03-08 16:51:32,380 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 236.
[2025-03-08 16:51:32,380 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 236 states, 203 states have (on average 1.206896551724138) internal successors, (245), 204 states have internal predecessors, (245), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22)
[2025-03-08 16:51:32,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 289 transitions.
[2025-03-08 16:51:32,381 INFO  L78                 Accepts]: Start accepts. Automaton has 236 states and 289 transitions. Word has length 107
[2025-03-08 16:51:32,382 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:32,382 INFO  L471      AbstractCegarLoop]: Abstraction has 236 states and 289 transitions.
[2025-03-08 16:51:32,382 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)
[2025-03-08 16:51:32,382 INFO  L276                IsEmpty]: Start isEmpty. Operand 236 states and 289 transitions.
[2025-03-08 16:51:32,382 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2025-03-08 16:51:32,382 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:32,382 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:32,389 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 (14)] Forceful destruction successful, exit code 0
[2025-03-08 16:51:32,583 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-08 16:51:32,583 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:32,583 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:32,583 INFO  L85        PathProgramCache]: Analyzing trace with hash -1221743237, now seen corresponding path program 1 times
[2025-03-08 16:51:32,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:32,584 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984482520]
[2025-03-08 16:51:32,584 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:32,584 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-08 16:51:32,584 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:32,586 INFO  L229       MonitoredProcess]: Starting monitored process 15 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-08 16:51:32,587 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 (15)] Waiting until timeout for monitored process
[2025-03-08 16:51:32,659 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-03-08 16:51:32,776 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-03-08 16:51:32,776 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:32,776 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:32,782 INFO  L256         TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 17 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:32,785 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:32,885 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2025-03-08 16:51:32,909 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21
[2025-03-08 16:51:32,929 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:32,929 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41
[2025-03-08 16:51:32,977 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:32,977 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 44
[2025-03-08 16:51:33,039 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:33,039 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 26
[2025-03-08 16:51:33,103 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:51:33,103 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:51:33,103 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:33,103 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984482520]
[2025-03-08 16:51:33,103 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984482520] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:51:33,103 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:51:33,103 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 16:51:33,103 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715149441]
[2025-03-08 16:51:33,103 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:33,103 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 16:51:33,103 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:33,104 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 16:51:33,104 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2025-03-08 16:51:33,104 INFO  L87              Difference]: Start difference. First operand 236 states and 289 transitions. Second operand  has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:34,435 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:34,436 INFO  L93              Difference]: Finished difference Result 680 states and 823 transitions.
[2025-03-08 16:51:34,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-08 16:51:34,436 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107
[2025-03-08 16:51:34,436 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:34,439 INFO  L225             Difference]: With dead ends: 680
[2025-03-08 16:51:34,439 INFO  L226             Difference]: Without dead ends: 447
[2025-03-08 16:51:34,440 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342
[2025-03-08 16:51:34,440 INFO  L435           NwaCegarLoop]: 215 mSDtfsCounter, 289 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:34,440 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1201 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-08 16:51:34,442 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 447 states.
[2025-03-08 16:51:34,474 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 342.
[2025-03-08 16:51:34,474 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 342 states, 292 states have (on average 1.2089041095890412) internal successors, (353), 294 states have internal predecessors, (353), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34)
[2025-03-08 16:51:34,475 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 421 transitions.
[2025-03-08 16:51:34,476 INFO  L78                 Accepts]: Start accepts. Automaton has 342 states and 421 transitions. Word has length 107
[2025-03-08 16:51:34,476 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:34,476 INFO  L471      AbstractCegarLoop]: Abstraction has 342 states and 421 transitions.
[2025-03-08 16:51:34,476 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:34,476 INFO  L276                IsEmpty]: Start isEmpty. Operand 342 states and 421 transitions.
[2025-03-08 16:51:34,477 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2025-03-08 16:51:34,477 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:34,477 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:34,485 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 (15)] Ended with exit code 0
[2025-03-08 16:51:34,677 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-08 16:51:34,678 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:34,678 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:34,678 INFO  L85        PathProgramCache]: Analyzing trace with hash -1786923844, now seen corresponding path program 1 times
[2025-03-08 16:51:34,678 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:34,678 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671424039]
[2025-03-08 16:51:34,678 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:34,678 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-08 16:51:34,678 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:34,680 INFO  L229       MonitoredProcess]: Starting monitored process 16 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-08 16:51:34,681 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 (16)] Waiting until timeout for monitored process
[2025-03-08 16:51:34,754 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-03-08 16:51:34,850 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-03-08 16:51:34,850 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:34,850 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:34,855 INFO  L256         TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 31 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:34,859 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:34,880 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2025-03-08 16:51:34,894 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10
[2025-03-08 16:51:34,941 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14
[2025-03-08 16:51:34,979 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24
[2025-03-08 16:51:35,049 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:35,049 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37
[2025-03-08 16:51:35,163 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 64
[2025-03-08 16:51:35,291 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 88
[2025-03-08 16:51:35,401 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:35,402 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 126 treesize of output 108
[2025-03-08 16:51:35,618 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:35,619 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 147 treesize of output 122
[2025-03-08 16:51:35,824 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:35,824 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 162 treesize of output 125
[2025-03-08 16:51:36,077 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:36,077 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 170 treesize of output 62
[2025-03-08 16:51:36,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked.
[2025-03-08 16:51:36,117 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:51:36,117 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:36,117 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671424039]
[2025-03-08 16:51:36,117 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [671424039] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:51:36,117 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:51:36,117 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-03-08 16:51:36,117 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015998842]
[2025-03-08 16:51:36,118 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:36,118 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-08 16:51:36,118 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:36,118 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-08 16:51:36,118 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156
[2025-03-08 16:51:36,118 INFO  L87              Difference]: Start difference. First operand 342 states and 421 transitions. Second operand  has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)
[2025-03-08 16:51:38,551 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:38,551 INFO  L93              Difference]: Finished difference Result 709 states and 873 transitions.
[2025-03-08 16:51:38,552 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 16:51:38,553 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 107
[2025-03-08 16:51:38,553 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:38,554 INFO  L225             Difference]: With dead ends: 709
[2025-03-08 16:51:38,554 INFO  L226             Difference]: Without dead ends: 370
[2025-03-08 16:51:38,555 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182
[2025-03-08 16:51:38,555 INFO  L435           NwaCegarLoop]: 132 mSDtfsCounter, 278 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:38,555 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 672 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-03-08 16:51:38,555 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 370 states.
[2025-03-08 16:51:38,586 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 320.
[2025-03-08 16:51:38,586 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 320 states, 270 states have (on average 1.2037037037037037) internal successors, (325), 272 states have internal predecessors, (325), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34)
[2025-03-08 16:51:38,587 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 393 transitions.
[2025-03-08 16:51:38,587 INFO  L78                 Accepts]: Start accepts. Automaton has 320 states and 393 transitions. Word has length 107
[2025-03-08 16:51:38,587 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:38,588 INFO  L471      AbstractCegarLoop]: Abstraction has 320 states and 393 transitions.
[2025-03-08 16:51:38,588 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)
[2025-03-08 16:51:38,588 INFO  L276                IsEmpty]: Start isEmpty. Operand 320 states and 393 transitions.
[2025-03-08 16:51:38,590 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-08 16:51:38,590 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:38,590 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:38,597 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 (16)] Ended with exit code 0
[2025-03-08 16:51:38,790 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-08 16:51:38,791 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:38,791 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:38,791 INFO  L85        PathProgramCache]: Analyzing trace with hash 708340570, now seen corresponding path program 1 times
[2025-03-08 16:51:38,792 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:38,792 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559425781]
[2025-03-08 16:51:38,792 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:38,792 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-08 16:51:38,792 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:38,794 INFO  L229       MonitoredProcess]: Starting monitored process 17 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-08 16:51:38,796 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 (17)] Waiting until timeout for monitored process
[2025-03-08 16:51:38,872 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-08 16:51:38,975 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-08 16:51:38,976 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:38,976 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:38,981 INFO  L256         TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:38,984 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:38,986 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2025-03-08 16:51:39,013 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25
[2025-03-08 16:51:39,068 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:39,068 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38
[2025-03-08 16:51:39,154 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:39,154 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51
[2025-03-08 16:51:39,282 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:39,282 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 78
[2025-03-08 16:51:39,351 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:39,351 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 81
[2025-03-08 16:51:39,391 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:39,391 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 81
[2025-03-08 16:51:39,439 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:39,440 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 92
[2025-03-08 16:51:39,543 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:39,543 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 99 treesize of output 95
[2025-03-08 16:51:39,756 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:39,756 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 47
[2025-03-08 16:51:39,774 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 162 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2025-03-08 16:51:39,774 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:51:39,920 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2025-03-08 16:51:39,921 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:39,921 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559425781]
[2025-03-08 16:51:39,921 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [559425781] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 16:51:39,921 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-08 16:51:39,921 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15
[2025-03-08 16:51:39,921 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596255455]
[2025-03-08 16:51:39,921 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-08 16:51:39,921 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-03-08 16:51:39,921 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:39,921 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-03-08 16:51:39,922 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210
[2025-03-08 16:51:39,922 INFO  L87              Difference]: Start difference. First operand 320 states and 393 transitions. Second operand  has 15 states, 13 states have (on average 8.307692307692308) internal successors, (108), 15 states have internal predecessors, (108), 7 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18)
[2025-03-08 16:51:41,200 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:41,201 INFO  L93              Difference]: Finished difference Result 717 states and 875 transitions.
[2025-03-08 16:51:41,201 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2025-03-08 16:51:41,202 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 13 states have (on average 8.307692307692308) internal successors, (108), 15 states have internal predecessors, (108), 7 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) Word has length 111
[2025-03-08 16:51:41,202 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:41,203 INFO  L225             Difference]: With dead ends: 717
[2025-03-08 16:51:41,203 INFO  L226             Difference]: Without dead ends: 400
[2025-03-08 16:51:41,204 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756
[2025-03-08 16:51:41,204 INFO  L435           NwaCegarLoop]: 57 mSDtfsCounter, 203 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:41,204 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 308 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 16:51:41,205 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 400 states.
[2025-03-08 16:51:41,240 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 320.
[2025-03-08 16:51:41,241 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 320 states, 270 states have (on average 1.1925925925925926) internal successors, (322), 272 states have internal predecessors, (322), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34)
[2025-03-08 16:51:41,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 390 transitions.
[2025-03-08 16:51:41,242 INFO  L78                 Accepts]: Start accepts. Automaton has 320 states and 390 transitions. Word has length 111
[2025-03-08 16:51:41,242 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:41,242 INFO  L471      AbstractCegarLoop]: Abstraction has 320 states and 390 transitions.
[2025-03-08 16:51:41,242 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 13 states have (on average 8.307692307692308) internal successors, (108), 15 states have internal predecessors, (108), 7 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18)
[2025-03-08 16:51:41,242 INFO  L276                IsEmpty]: Start isEmpty. Operand 320 states and 390 transitions.
[2025-03-08 16:51:41,243 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-08 16:51:41,243 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:41,243 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:41,250 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 (17)] Ended with exit code 0
[2025-03-08 16:51:41,443 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-08 16:51:41,444 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:41,444 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:41,444 INFO  L85        PathProgramCache]: Analyzing trace with hash -956875377, now seen corresponding path program 1 times
[2025-03-08 16:51:41,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:41,444 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454259396]
[2025-03-08 16:51:41,445 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:41,445 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-08 16:51:41,445 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:41,446 INFO  L229       MonitoredProcess]: Starting monitored process 18 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-08 16:51:41,448 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 (18)] Waiting until timeout for monitored process
[2025-03-08 16:51:41,527 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-08 16:51:41,631 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-08 16:51:41,631 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:41,631 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:41,636 INFO  L256         TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 27 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:41,639 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:41,646 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2025-03-08 16:51:41,670 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25
[2025-03-08 16:51:41,726 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:41,727 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52
[2025-03-08 16:51:41,762 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:41,763 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 55
[2025-03-08 16:51:41,796 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:41,796 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 55
[2025-03-08 16:51:41,820 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:41,820 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 66
[2025-03-08 16:51:41,924 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:41,925 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 80
[2025-03-08 16:51:42,211 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:42,211 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 48
[2025-03-08 16:51:42,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked.
[2025-03-08 16:51:42,297 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:51:42,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:51:42,630 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:42,630 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454259396]
[2025-03-08 16:51:42,630 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454259396] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:51:42,630 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:51:42,630 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 21
[2025-03-08 16:51:42,630 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825392658]
[2025-03-08 16:51:42,630 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:42,630 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 16:51:42,630 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:42,631 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 16:51:42,631 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420
[2025-03-08 16:51:42,631 INFO  L87              Difference]: Start difference. First operand 320 states and 390 transitions. Second operand  has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:43,272 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:43,272 INFO  L93              Difference]: Finished difference Result 870 states and 1056 transitions.
[2025-03-08 16:51:43,273 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 16:51:43,273 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111
[2025-03-08 16:51:43,273 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:43,276 INFO  L225             Difference]: With dead ends: 870
[2025-03-08 16:51:43,276 INFO  L226             Difference]: Without dead ends: 553
[2025-03-08 16:51:43,276 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650
[2025-03-08 16:51:43,277 INFO  L435           NwaCegarLoop]: 164 mSDtfsCounter, 67 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:43,277 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1036 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 16:51:43,277 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 553 states.
[2025-03-08 16:51:43,324 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 400.
[2025-03-08 16:51:43,325 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 400 states, 345 states have (on average 1.1884057971014492) internal successors, (410), 348 states have internal predecessors, (410), 37 states have call successors, (37), 17 states have call predecessors, (37), 17 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37)
[2025-03-08 16:51:43,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 484 transitions.
[2025-03-08 16:51:43,326 INFO  L78                 Accepts]: Start accepts. Automaton has 400 states and 484 transitions. Word has length 111
[2025-03-08 16:51:43,326 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:43,327 INFO  L471      AbstractCegarLoop]: Abstraction has 400 states and 484 transitions.
[2025-03-08 16:51:43,327 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:43,327 INFO  L276                IsEmpty]: Start isEmpty. Operand 400 states and 484 transitions.
[2025-03-08 16:51:43,327 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-08 16:51:43,327 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:43,327 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:43,334 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 (18)] Ended with exit code 0
[2025-03-08 16:51:43,529 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-08 16:51:43,529 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:43,529 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:43,529 INFO  L85        PathProgramCache]: Analyzing trace with hash 1530637456, now seen corresponding path program 1 times
[2025-03-08 16:51:43,530 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:43,530 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858522471]
[2025-03-08 16:51:43,530 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:43,530 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-08 16:51:43,530 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:43,531 INFO  L229       MonitoredProcess]: Starting monitored process 19 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-08 16:51:43,532 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 (19)] Waiting until timeout for monitored process
[2025-03-08 16:51:43,612 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-08 16:51:43,679 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-08 16:51:43,679 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:43,679 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:43,684 INFO  L256         TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 19 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:43,686 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:43,844 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:43,844 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 39
[2025-03-08 16:51:43,859 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:51:43,860 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:51:43,860 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:43,860 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858522471]
[2025-03-08 16:51:43,860 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858522471] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:51:43,860 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:51:43,860 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 16:51:43,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279143901]
[2025-03-08 16:51:43,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:51:43,861 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 16:51:43,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:43,862 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 16:51:43,862 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-03-08 16:51:43,862 INFO  L87              Difference]: Start difference. First operand 400 states and 484 transitions. Second operand  has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:44,505 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:44,505 INFO  L93              Difference]: Finished difference Result 798 states and 966 transitions.
[2025-03-08 16:51:44,506 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 16:51:44,506 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111
[2025-03-08 16:51:44,506 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:44,509 INFO  L225             Difference]: With dead ends: 798
[2025-03-08 16:51:44,509 INFO  L226             Difference]: Without dead ends: 401
[2025-03-08 16:51:44,510 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2025-03-08 16:51:44,510 INFO  L435           NwaCegarLoop]: 101 mSDtfsCounter, 32 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:44,510 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 609 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 16:51:44,511 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 401 states.
[2025-03-08 16:51:44,562 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 399.
[2025-03-08 16:51:44,562 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 399 states, 344 states have (on average 1.1744186046511629) internal successors, (404), 347 states have internal predecessors, (404), 37 states have call successors, (37), 17 states have call predecessors, (37), 17 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37)
[2025-03-08 16:51:44,564 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 478 transitions.
[2025-03-08 16:51:44,564 INFO  L78                 Accepts]: Start accepts. Automaton has 399 states and 478 transitions. Word has length 111
[2025-03-08 16:51:44,565 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:44,565 INFO  L471      AbstractCegarLoop]: Abstraction has 399 states and 478 transitions.
[2025-03-08 16:51:44,565 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:51:44,565 INFO  L276                IsEmpty]: Start isEmpty. Operand 399 states and 478 transitions.
[2025-03-08 16:51:44,567 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-08 16:51:44,567 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:44,567 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:44,573 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 (19)] Ended with exit code 0
[2025-03-08 16:51:44,767 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-08 16:51:44,768 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:44,768 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:44,768 INFO  L85        PathProgramCache]: Analyzing trace with hash -1023882130, now seen corresponding path program 1 times
[2025-03-08 16:51:44,768 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:44,768 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424922035]
[2025-03-08 16:51:44,768 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:44,768 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-08 16:51:44,769 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:44,770 INFO  L229       MonitoredProcess]: Starting monitored process 20 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-08 16:51:44,771 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 (20)] Waiting until timeout for monitored process
[2025-03-08 16:51:44,852 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-08 16:51:44,964 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-08 16:51:44,964 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:44,964 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:44,970 INFO  L256         TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 27 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:44,973 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:44,976 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10
[2025-03-08 16:51:45,040 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29
[2025-03-08 16:51:45,127 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:45,128 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56
[2025-03-08 16:51:45,175 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:45,175 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54
[2025-03-08 16:51:45,210 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:45,210 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 54
[2025-03-08 16:51:45,243 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:45,244 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 65
[2025-03-08 16:51:45,401 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:45,401 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 78
[2025-03-08 16:51:45,747 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:45,747 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 47
[2025-03-08 16:51:45,824 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 125 proven. 6 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked.
[2025-03-08 16:51:45,824 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:51:46,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2025-03-08 16:51:46,283 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:46,283 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424922035]
[2025-03-08 16:51:46,283 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424922035] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 16:51:46,283 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-08 16:51:46,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 26
[2025-03-08 16:51:46,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336461491]
[2025-03-08 16:51:46,283 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-08 16:51:46,283 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2025-03-08 16:51:46,283 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:46,284 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2025-03-08 16:51:46,284 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650
[2025-03-08 16:51:46,284 INFO  L87              Difference]: Start difference. First operand 399 states and 478 transitions. Second operand  has 26 states, 24 states have (on average 4.375) internal successors, (105), 25 states have internal predecessors, (105), 6 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15)
[2025-03-08 16:51:49,193 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:49,194 INFO  L93              Difference]: Finished difference Result 1243 states and 1475 transitions.
[2025-03-08 16:51:49,194 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. 
[2025-03-08 16:51:49,194 INFO  L78                 Accepts]: Start accepts. Automaton has  has 26 states, 24 states have (on average 4.375) internal successors, (105), 25 states have internal predecessors, (105), 6 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) Word has length 111
[2025-03-08 16:51:49,194 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:49,197 INFO  L225             Difference]: With dead ends: 1243
[2025-03-08 16:51:49,197 INFO  L226             Difference]: Without dead ends: 847
[2025-03-08 16:51:49,198 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=401, Invalid=1669, Unknown=0, NotChecked=0, Total=2070
[2025-03-08 16:51:49,198 INFO  L435           NwaCegarLoop]: 90 mSDtfsCounter, 271 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:49,198 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1088 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-08 16:51:49,198 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 847 states.
[2025-03-08 16:51:49,241 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 395.
[2025-03-08 16:51:49,241 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 395 states, 340 states have (on average 1.173529411764706) internal successors, (399), 343 states have internal predecessors, (399), 37 states have call successors, (37), 17 states have call predecessors, (37), 17 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37)
[2025-03-08 16:51:49,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 473 transitions.
[2025-03-08 16:51:49,242 INFO  L78                 Accepts]: Start accepts. Automaton has 395 states and 473 transitions. Word has length 111
[2025-03-08 16:51:49,243 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:49,243 INFO  L471      AbstractCegarLoop]: Abstraction has 395 states and 473 transitions.
[2025-03-08 16:51:49,243 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 24 states have (on average 4.375) internal successors, (105), 25 states have internal predecessors, (105), 6 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15)
[2025-03-08 16:51:49,243 INFO  L276                IsEmpty]: Start isEmpty. Operand 395 states and 473 transitions.
[2025-03-08 16:51:49,244 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-08 16:51:49,244 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:49,244 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:49,252 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 (20)] Ended with exit code 0
[2025-03-08 16:51:49,444 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-08 16:51:49,445 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:49,445 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:49,445 INFO  L85        PathProgramCache]: Analyzing trace with hash -1856494456, now seen corresponding path program 1 times
[2025-03-08 16:51:49,445 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:49,445 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690064368]
[2025-03-08 16:51:49,445 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:49,445 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-08 16:51:49,446 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:49,447 INFO  L229       MonitoredProcess]: Starting monitored process 21 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-08 16:51:49,450 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 (21)] Waiting until timeout for monitored process
[2025-03-08 16:51:49,549 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-08 16:51:49,655 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-08 16:51:49,655 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:49,655 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:49,661 INFO  L256         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 32 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:49,664 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:49,667 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2025-03-08 16:51:49,690 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15
[2025-03-08 16:51:49,766 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:49,766 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 53
[2025-03-08 16:51:49,806 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:49,806 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 56
[2025-03-08 16:51:49,831 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:49,831 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 56
[2025-03-08 16:51:49,860 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:49,860 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 67
[2025-03-08 16:51:50,044 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:50,045 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 80
[2025-03-08 16:51:50,331 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:50,331 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 48
[2025-03-08 16:51:50,400 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 3 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked.
[2025-03-08 16:51:50,400 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:51:51,247 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked.
[2025-03-08 16:51:51,247 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:51,247 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690064368]
[2025-03-08 16:51:51,247 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [690064368] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 16:51:51,247 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-08 16:51:51,247 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35
[2025-03-08 16:51:51,247 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753182354]
[2025-03-08 16:51:51,247 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-08 16:51:51,248 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2025-03-08 16:51:51,248 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:51,248 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2025-03-08 16:51:51,248 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190
[2025-03-08 16:51:51,248 INFO  L87              Difference]: Start difference. First operand 395 states and 473 transitions. Second operand  has 35 states, 31 states have (on average 3.5161290322580645) internal successors, (109), 35 states have internal predecessors, (109), 7 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14)
[2025-03-08 16:51:54,525 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:51:54,526 INFO  L93              Difference]: Finished difference Result 1477 states and 1740 transitions.
[2025-03-08 16:51:54,526 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. 
[2025-03-08 16:51:54,527 INFO  L78                 Accepts]: Start accepts. Automaton has  has 35 states, 31 states have (on average 3.5161290322580645) internal successors, (109), 35 states have internal predecessors, (109), 7 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 111
[2025-03-08 16:51:54,527 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:51:54,530 INFO  L225             Difference]: With dead ends: 1477
[2025-03-08 16:51:54,530 INFO  L226             Difference]: Without dead ends: 1085
[2025-03-08 16:51:54,531 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=768, Invalid=3522, Unknown=0, NotChecked=0, Total=4290
[2025-03-08 16:51:54,532 INFO  L435           NwaCegarLoop]: 65 mSDtfsCounter, 647 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-08 16:51:54,532 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1066 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-08 16:51:54,532 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1085 states.
[2025-03-08 16:51:54,569 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 284.
[2025-03-08 16:51:54,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 284 states, 248 states have (on average 1.157258064516129) internal successors, (287), 249 states have internal predecessors, (287), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23)
[2025-03-08 16:51:54,570 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 333 transitions.
[2025-03-08 16:51:54,571 INFO  L78                 Accepts]: Start accepts. Automaton has 284 states and 333 transitions. Word has length 111
[2025-03-08 16:51:54,571 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:51:54,571 INFO  L471      AbstractCegarLoop]: Abstraction has 284 states and 333 transitions.
[2025-03-08 16:51:54,572 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 31 states have (on average 3.5161290322580645) internal successors, (109), 35 states have internal predecessors, (109), 7 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14)
[2025-03-08 16:51:54,572 INFO  L276                IsEmpty]: Start isEmpty. Operand 284 states and 333 transitions.
[2025-03-08 16:51:54,573 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2025-03-08 16:51:54,574 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:51:54,574 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:51:54,581 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 (21)] Ended with exit code 0
[2025-03-08 16:51:54,774 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-08 16:51:54,775 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:51:54,775 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:51:54,775 INFO  L85        PathProgramCache]: Analyzing trace with hash 435708436, now seen corresponding path program 1 times
[2025-03-08 16:51:54,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:51:54,775 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373287335]
[2025-03-08 16:51:54,775 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:51:54,775 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-08 16:51:54,776 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:51:54,777 INFO  L229       MonitoredProcess]: Starting monitored process 22 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-08 16:51:54,778 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 (22)] Waiting until timeout for monitored process
[2025-03-08 16:51:54,864 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes.
[2025-03-08 16:51:54,967 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements.
[2025-03-08 16:51:54,967 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:51:54,967 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:51:54,972 INFO  L256         TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 33 conjuncts are in the unsatisfiable core
[2025-03-08 16:51:54,975 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:51:54,977 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10
[2025-03-08 16:51:55,039 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29
[2025-03-08 16:51:55,213 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:55,213 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 61
[2025-03-08 16:51:55,280 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:55,281 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59
[2025-03-08 16:51:55,321 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:55,321 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 59
[2025-03-08 16:51:55,357 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:55,357 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 70
[2025-03-08 16:51:55,515 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:55,515 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 79 treesize of output 84
[2025-03-08 16:51:55,906 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:51:55,906 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 52
[2025-03-08 16:51:56,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 131 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked.
[2025-03-08 16:51:56,011 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:51:56,826 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked.
[2025-03-08 16:51:56,827 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:51:56,827 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373287335]
[2025-03-08 16:51:56,827 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373287335] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 16:51:56,827 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-08 16:51:56,827 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 38
[2025-03-08 16:51:56,827 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496401158]
[2025-03-08 16:51:56,827 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-08 16:51:56,827 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 38 states
[2025-03-08 16:51:56,827 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:51:56,828 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2025-03-08 16:51:56,828 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1174, Unknown=0, NotChecked=0, Total=1406
[2025-03-08 16:51:56,828 INFO  L87              Difference]: Start difference. First operand 284 states and 333 transitions. Second operand  has 38 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 36 states have internal predecessors, (115), 8 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15)
[2025-03-08 16:52:01,565 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:01,565 INFO  L93              Difference]: Finished difference Result 1019 states and 1188 transitions.
[2025-03-08 16:52:01,565 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. 
[2025-03-08 16:52:01,566 INFO  L78                 Accepts]: Start accepts. Automaton has  has 38 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 36 states have internal predecessors, (115), 8 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 113
[2025-03-08 16:52:01,566 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:01,568 INFO  L225             Difference]: With dead ends: 1019
[2025-03-08 16:52:01,568 INFO  L226             Difference]: Without dead ends: 738
[2025-03-08 16:52:01,569 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=905, Invalid=4207, Unknown=0, NotChecked=0, Total=5112
[2025-03-08 16:52:01,570 INFO  L435           NwaCegarLoop]: 99 mSDtfsCounter, 537 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 2640 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 2640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:01,570 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1420 Invalid, 2812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 2640 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time]
[2025-03-08 16:52:01,571 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 738 states.
[2025-03-08 16:52:01,609 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 322.
[2025-03-08 16:52:01,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 322 states, 286 states have (on average 1.1503496503496504) internal successors, (329), 287 states have internal predecessors, (329), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23)
[2025-03-08 16:52:01,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 375 transitions.
[2025-03-08 16:52:01,611 INFO  L78                 Accepts]: Start accepts. Automaton has 322 states and 375 transitions. Word has length 113
[2025-03-08 16:52:01,611 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:01,611 INFO  L471      AbstractCegarLoop]: Abstraction has 322 states and 375 transitions.
[2025-03-08 16:52:01,611 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 38 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 36 states have internal predecessors, (115), 8 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15)
[2025-03-08 16:52:01,611 INFO  L276                IsEmpty]: Start isEmpty. Operand 322 states and 375 transitions.
[2025-03-08 16:52:01,612 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2025-03-08 16:52:01,612 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:01,612 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:52:01,619 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 (22)] Ended with exit code 0
[2025-03-08 16:52:01,813 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-08 16:52:01,813 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:01,813 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:01,813 INFO  L85        PathProgramCache]: Analyzing trace with hash 1128810133, now seen corresponding path program 1 times
[2025-03-08 16:52:01,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:52:01,814 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040597735]
[2025-03-08 16:52:01,814 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:01,814 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-08 16:52:01,814 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:52:01,815 INFO  L229       MonitoredProcess]: Starting monitored process 23 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-08 16:52:01,817 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 (23)] Waiting until timeout for monitored process
[2025-03-08 16:52:01,909 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes.
[2025-03-08 16:52:02,004 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements.
[2025-03-08 16:52:02,004 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:02,004 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:02,009 INFO  L256         TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 38 conjuncts are in the unsatisfiable core
[2025-03-08 16:52:02,014 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:52:02,019 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41
[2025-03-08 16:52:02,066 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:02,067 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63
[2025-03-08 16:52:02,206 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:02,206 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66
[2025-03-08 16:52:02,332 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:02,332 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 76
[2025-03-08 16:52:02,539 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:02,540 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 80
[2025-03-08 16:52:02,745 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:02,746 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 70
[2025-03-08 16:52:03,021 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:03,022 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 81
[2025-03-08 16:52:03,207 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:03,207 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 87 treesize of output 95
[2025-03-08 16:52:03,282 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:03,283 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 97 treesize of output 99
[2025-03-08 16:52:03,358 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:03,359 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 93 treesize of output 99
[2025-03-08 16:52:03,547 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:03,548 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 92 treesize of output 109
[2025-03-08 16:52:03,923 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:03,923 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 125 treesize of output 59
[2025-03-08 16:52:04,037 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 27 proven. 168 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2025-03-08 16:52:04,037 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:52:04,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2025-03-08 16:52:04,775 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:52:04,775 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040597735]
[2025-03-08 16:52:04,775 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040597735] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 16:52:04,775 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-08 16:52:04,775 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 33
[2025-03-08 16:52:04,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662716447]
[2025-03-08 16:52:04,776 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-08 16:52:04,776 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2025-03-08 16:52:04,776 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:52:04,776 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2025-03-08 16:52:04,777 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056
[2025-03-08 16:52:04,777 INFO  L87              Difference]: Start difference. First operand 322 states and 375 transitions. Second operand  has 33 states, 31 states have (on average 4.32258064516129) internal successors, (134), 32 states have internal predecessors, (134), 10 states have call successors, (22), 6 states have call predecessors, (22), 8 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22)
[2025-03-08 16:52:11,514 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:11,514 INFO  L93              Difference]: Finished difference Result 2180 states and 2523 transitions.
[2025-03-08 16:52:11,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. 
[2025-03-08 16:52:11,517 INFO  L78                 Accepts]: Start accepts. Automaton has  has 33 states, 31 states have (on average 4.32258064516129) internal successors, (134), 32 states have internal predecessors, (134), 10 states have call successors, (22), 6 states have call predecessors, (22), 8 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) Word has length 113
[2025-03-08 16:52:11,517 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:11,526 INFO  L225             Difference]: With dead ends: 2180
[2025-03-08 16:52:11,526 INFO  L226             Difference]: Without dead ends: 1861
[2025-03-08 16:52:11,528 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=832, Invalid=4138, Unknown=0, NotChecked=0, Total=4970
[2025-03-08 16:52:11,530 INFO  L435           NwaCegarLoop]: 165 mSDtfsCounter, 713 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 3418 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 2485 SdHoareTripleChecker+Invalid, 3623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 3418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:11,530 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 2485 Invalid, 3623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 3418 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time]
[2025-03-08 16:52:11,531 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1861 states.
[2025-03-08 16:52:11,621 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 632.
[2025-03-08 16:52:11,622 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 632 states, 561 states have (on average 1.1497326203208555) internal successors, (645), 563 states have internal predecessors, (645), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46)
[2025-03-08 16:52:11,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 737 transitions.
[2025-03-08 16:52:11,624 INFO  L78                 Accepts]: Start accepts. Automaton has 632 states and 737 transitions. Word has length 113
[2025-03-08 16:52:11,624 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:11,624 INFO  L471      AbstractCegarLoop]: Abstraction has 632 states and 737 transitions.
[2025-03-08 16:52:11,624 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 31 states have (on average 4.32258064516129) internal successors, (134), 32 states have internal predecessors, (134), 10 states have call successors, (22), 6 states have call predecessors, (22), 8 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22)
[2025-03-08 16:52:11,624 INFO  L276                IsEmpty]: Start isEmpty. Operand 632 states and 737 transitions.
[2025-03-08 16:52:11,625 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2025-03-08 16:52:11,625 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:11,625 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:52:11,632 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 (23)] Ended with exit code 0
[2025-03-08 16:52:11,825 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-08 16:52:11,826 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:11,826 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:11,826 INFO  L85        PathProgramCache]: Analyzing trace with hash -809799987, now seen corresponding path program 1 times
[2025-03-08 16:52:11,826 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:52:11,826 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162644397]
[2025-03-08 16:52:11,826 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:11,826 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-08 16:52:11,827 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:52:11,828 INFO  L229       MonitoredProcess]: Starting monitored process 24 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-08 16:52:11,829 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 (24)] Waiting until timeout for monitored process
[2025-03-08 16:52:11,919 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes.
[2025-03-08 16:52:11,980 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements.
[2025-03-08 16:52:11,980 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:11,981 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:11,984 INFO  L256         TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-03-08 16:52:11,986 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:52:11,993 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10
[2025-03-08 16:52:12,015 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9
[2025-03-08 16:52:12,054 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:52:12,054 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:52:12,054 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:52:12,054 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162644397]
[2025-03-08 16:52:12,054 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [162644397] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:12,054 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:12,054 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-03-08 16:52:12,054 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899664435]
[2025-03-08 16:52:12,054 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:12,055 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-08 16:52:12,055 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:52:12,055 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-08 16:52:12,055 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-03-08 16:52:12,055 INFO  L87              Difference]: Start difference. First operand 632 states and 737 transitions. Second operand  has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:52:12,709 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:12,709 INFO  L93              Difference]: Finished difference Result 1756 states and 2065 transitions.
[2025-03-08 16:52:12,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-08 16:52:12,710 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113
[2025-03-08 16:52:12,710 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:12,713 INFO  L225             Difference]: With dead ends: 1756
[2025-03-08 16:52:12,713 INFO  L226             Difference]: Without dead ends: 1127
[2025-03-08 16:52:12,713 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342
[2025-03-08 16:52:12,714 INFO  L435           NwaCegarLoop]: 143 mSDtfsCounter, 99 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:12,714 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1175 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 16:52:12,714 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1127 states.
[2025-03-08 16:52:12,807 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 666.
[2025-03-08 16:52:12,808 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 666 states, 595 states have (on average 1.1512605042016806) internal successors, (685), 597 states have internal predecessors, (685), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46)
[2025-03-08 16:52:12,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 777 transitions.
[2025-03-08 16:52:12,810 INFO  L78                 Accepts]: Start accepts. Automaton has 666 states and 777 transitions. Word has length 113
[2025-03-08 16:52:12,811 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:12,811 INFO  L471      AbstractCegarLoop]: Abstraction has 666 states and 777 transitions.
[2025-03-08 16:52:12,811 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:52:12,811 INFO  L276                IsEmpty]: Start isEmpty. Operand 666 states and 777 transitions.
[2025-03-08 16:52:12,813 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2025-03-08 16:52:12,813 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:12,813 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:52:12,818 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 (24)] Ended with exit code 0
[2025-03-08 16:52:13,013 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-08 16:52:13,013 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:13,014 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:13,014 INFO  L85        PathProgramCache]: Analyzing trace with hash -1642018233, now seen corresponding path program 1 times
[2025-03-08 16:52:13,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:52:13,014 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678912160]
[2025-03-08 16:52:13,014 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:13,014 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-08 16:52:13,014 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:52:13,016 INFO  L229       MonitoredProcess]: Starting monitored process 25 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-08 16:52:13,017 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 (25)] Waiting until timeout for monitored process
[2025-03-08 16:52:13,110 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes.
[2025-03-08 16:52:13,202 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements.
[2025-03-08 16:52:13,202 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:13,204 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:13,210 INFO  L256         TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-03-08 16:52:13,214 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:52:13,220 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 21
[2025-03-08 16:52:13,241 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:13,242 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37
[2025-03-08 16:52:13,324 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:13,325 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40
[2025-03-08 16:52:13,380 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:13,380 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 31
[2025-03-08 16:52:13,429 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:13,429 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37
[2025-03-08 16:52:13,504 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:13,504 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40
[2025-03-08 16:52:13,571 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:13,571 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40
[2025-03-08 16:52:13,639 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:13,639 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 55
[2025-03-08 16:52:13,685 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:13,685 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 59
[2025-03-08 16:52:13,714 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:13,714 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 59
[2025-03-08 16:52:13,766 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:13,766 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 38
[2025-03-08 16:52:13,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 48 proven. 96 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked.
[2025-03-08 16:52:13,776 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:52:13,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:52:13,857 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:52:13,857 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678912160]
[2025-03-08 16:52:13,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678912160] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:52:13,857 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:52:13,857 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9
[2025-03-08 16:52:13,858 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35692819]
[2025-03-08 16:52:13,858 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:13,858 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 16:52:13,858 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:52:13,858 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 16:52:13,858 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-08 16:52:13,858 INFO  L87              Difference]: Start difference. First operand 666 states and 777 transitions. Second operand  has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:52:14,112 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:14,113 INFO  L93              Difference]: Finished difference Result 1292 states and 1507 transitions.
[2025-03-08 16:52:14,113 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 16:52:14,113 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113
[2025-03-08 16:52:14,113 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:14,115 INFO  L225             Difference]: With dead ends: 1292
[2025-03-08 16:52:14,115 INFO  L226             Difference]: Without dead ends: 629
[2025-03-08 16:52:14,116 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2025-03-08 16:52:14,116 INFO  L435           NwaCegarLoop]: 119 mSDtfsCounter, 70 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:14,116 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 295 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:52:14,117 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 629 states.
[2025-03-08 16:52:14,196 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 614.
[2025-03-08 16:52:14,197 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 614 states, 543 states have (on average 1.147329650092081) internal successors, (623), 545 states have internal predecessors, (623), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46)
[2025-03-08 16:52:14,198 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 715 transitions.
[2025-03-08 16:52:14,199 INFO  L78                 Accepts]: Start accepts. Automaton has 614 states and 715 transitions. Word has length 113
[2025-03-08 16:52:14,199 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:14,199 INFO  L471      AbstractCegarLoop]: Abstraction has 614 states and 715 transitions.
[2025-03-08 16:52:14,199 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:52:14,199 INFO  L276                IsEmpty]: Start isEmpty. Operand 614 states and 715 transitions.
[2025-03-08 16:52:14,200 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2025-03-08 16:52:14,200 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:14,200 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:52:14,207 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 (25)] Ended with exit code 0
[2025-03-08 16:52:14,404 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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-08 16:52:14,404 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:14,406 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:14,406 INFO  L85        PathProgramCache]: Analyzing trace with hash -1814905877, now seen corresponding path program 1 times
[2025-03-08 16:52:14,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:52:14,406 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267426007]
[2025-03-08 16:52:14,406 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:14,406 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-08 16:52:14,406 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:52:14,408 INFO  L229       MonitoredProcess]: Starting monitored process 26 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-08 16:52:14,410 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 (26)] Waiting until timeout for monitored process
[2025-03-08 16:52:14,506 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-03-08 16:52:14,620 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-03-08 16:52:14,620 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:14,620 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:14,626 INFO  L256         TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 25 conjuncts are in the unsatisfiable core
[2025-03-08 16:52:14,628 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:52:14,634 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2025-03-08 16:52:14,659 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:14,660 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39
[2025-03-08 16:52:14,683 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:14,683 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 42
[2025-03-08 16:52:14,700 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:14,700 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 42
[2025-03-08 16:52:14,722 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:14,722 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 53
[2025-03-08 16:52:14,773 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:14,773 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 56
[2025-03-08 16:52:14,930 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:14,931 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 44
[2025-03-08 16:52:14,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2025-03-08 16:52:14,984 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:52:14,984 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:52:14,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267426007]
[2025-03-08 16:52:14,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [267426007] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:14,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:14,985 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-03-08 16:52:14,985 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206169078]
[2025-03-08 16:52:14,985 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:14,985 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-08 16:52:14,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:52:14,985 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-08 16:52:14,985 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2025-03-08 16:52:14,986 INFO  L87              Difference]: Start difference. First operand 614 states and 715 transitions. Second operand  has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11)
[2025-03-08 16:52:15,987 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:15,987 INFO  L93              Difference]: Finished difference Result 912 states and 1053 transitions.
[2025-03-08 16:52:15,987 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2025-03-08 16:52:15,987 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115
[2025-03-08 16:52:15,988 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:15,990 INFO  L225             Difference]: With dead ends: 912
[2025-03-08 16:52:15,990 INFO  L226             Difference]: Without dead ends: 910
[2025-03-08 16:52:15,990 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756
[2025-03-08 16:52:15,990 INFO  L435           NwaCegarLoop]: 54 mSDtfsCounter, 209 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:15,991 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 489 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 16:52:15,991 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 910 states.
[2025-03-08 16:52:16,071 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 810.
[2025-03-08 16:52:16,072 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 810 states, 739 states have (on average 1.148849797023004) internal successors, (849), 741 states have internal predecessors, (849), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46)
[2025-03-08 16:52:16,073 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 941 transitions.
[2025-03-08 16:52:16,074 INFO  L78                 Accepts]: Start accepts. Automaton has 810 states and 941 transitions. Word has length 115
[2025-03-08 16:52:16,074 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:16,074 INFO  L471      AbstractCegarLoop]: Abstraction has 810 states and 941 transitions.
[2025-03-08 16:52:16,074 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11)
[2025-03-08 16:52:16,074 INFO  L276                IsEmpty]: Start isEmpty. Operand 810 states and 941 transitions.
[2025-03-08 16:52:16,075 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2025-03-08 16:52:16,075 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:16,075 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:52:16,082 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 (26)] Ended with exit code 0
[2025-03-08 16:52:16,276 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-08 16:52:16,276 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:16,276 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:16,277 INFO  L85        PathProgramCache]: Analyzing trace with hash 230932199, now seen corresponding path program 1 times
[2025-03-08 16:52:16,277 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:52:16,277 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586463822]
[2025-03-08 16:52:16,277 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:16,277 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-08 16:52:16,277 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:52:16,279 INFO  L229       MonitoredProcess]: Starting monitored process 27 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-08 16:52:16,280 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 (27)] Waiting until timeout for monitored process
[2025-03-08 16:52:16,377 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-03-08 16:52:16,450 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-03-08 16:52:16,450 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:16,450 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:16,455 INFO  L256         TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-03-08 16:52:16,458 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:52:16,614 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:16,614 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 45
[2025-03-08 16:52:16,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:52:16,667 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:52:16,667 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:52:16,667 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586463822]
[2025-03-08 16:52:16,667 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [586463822] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:16,667 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:16,667 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 16:52:16,667 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239175786]
[2025-03-08 16:52:16,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:16,667 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 16:52:16,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:52:16,667 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 16:52:16,668 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-03-08 16:52:16,668 INFO  L87              Difference]: Start difference. First operand 810 states and 941 transitions. Second operand  has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:52:17,754 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:17,754 INFO  L93              Difference]: Finished difference Result 1625 states and 1887 transitions.
[2025-03-08 16:52:17,755 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 16:52:17,755 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 115
[2025-03-08 16:52:17,755 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:17,757 INFO  L225             Difference]: With dead ends: 1625
[2025-03-08 16:52:17,757 INFO  L226             Difference]: Without dead ends: 818
[2025-03-08 16:52:17,758 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-03-08 16:52:17,759 INFO  L435           NwaCegarLoop]: 113 mSDtfsCounter, 31 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:17,759 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 542 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 16:52:17,759 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 818 states.
[2025-03-08 16:52:17,840 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 806.
[2025-03-08 16:52:17,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 806 states, 735 states have (on average 1.14421768707483) internal successors, (841), 737 states have internal predecessors, (841), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46)
[2025-03-08 16:52:17,843 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 933 transitions.
[2025-03-08 16:52:17,843 INFO  L78                 Accepts]: Start accepts. Automaton has 806 states and 933 transitions. Word has length 115
[2025-03-08 16:52:17,843 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:17,844 INFO  L471      AbstractCegarLoop]: Abstraction has 806 states and 933 transitions.
[2025-03-08 16:52:17,844 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:52:17,844 INFO  L276                IsEmpty]: Start isEmpty. Operand 806 states and 933 transitions.
[2025-03-08 16:52:17,845 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2025-03-08 16:52:17,845 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:17,845 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:52:17,851 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 (27)] Ended with exit code 0
[2025-03-08 16:52:18,045 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-08 16:52:18,046 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:18,046 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:18,046 INFO  L85        PathProgramCache]: Analyzing trace with hash -1464105940, now seen corresponding path program 1 times
[2025-03-08 16:52:18,046 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:52:18,046 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437617778]
[2025-03-08 16:52:18,046 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:18,046 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-08 16:52:18,047 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:52:18,048 INFO  L229       MonitoredProcess]: Starting monitored process 28 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-08 16:52:18,049 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 (28)] Waiting until timeout for monitored process
[2025-03-08 16:52:18,149 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-03-08 16:52:18,251 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-03-08 16:52:18,252 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:18,252 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:18,257 INFO  L256         TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-03-08 16:52:18,259 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:52:18,262 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2025-03-08 16:52:18,263 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2025-03-08 16:52:18,284 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:18,284 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 22
[2025-03-08 16:52:18,313 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:18,313 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13
[2025-03-08 16:52:18,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:52:18,323 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:52:18,323 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:52:18,323 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437617778]
[2025-03-08 16:52:18,323 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437617778] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:18,323 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:18,323 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 16:52:18,323 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152401511]
[2025-03-08 16:52:18,323 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:18,324 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 16:52:18,324 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:52:18,324 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 16:52:18,324 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 16:52:18,324 INFO  L87              Difference]: Start difference. First operand 806 states and 933 transitions. Second operand  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:52:18,859 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:18,859 INFO  L93              Difference]: Finished difference Result 1873 states and 2164 transitions.
[2025-03-08 16:52:18,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 16:52:18,860 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 115
[2025-03-08 16:52:18,860 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:18,862 INFO  L225             Difference]: With dead ends: 1873
[2025-03-08 16:52:18,862 INFO  L226             Difference]: Without dead ends: 1070
[2025-03-08 16:52:18,863 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-08 16:52:18,864 INFO  L435           NwaCegarLoop]: 174 mSDtfsCounter, 73 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:18,864 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 505 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 16:52:18,865 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1070 states.
[2025-03-08 16:52:18,943 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 800.
[2025-03-08 16:52:18,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 800 states, 729 states have (on average 1.139917695473251) internal successors, (831), 731 states have internal predecessors, (831), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46)
[2025-03-08 16:52:18,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 923 transitions.
[2025-03-08 16:52:18,946 INFO  L78                 Accepts]: Start accepts. Automaton has 800 states and 923 transitions. Word has length 115
[2025-03-08 16:52:18,946 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:18,946 INFO  L471      AbstractCegarLoop]: Abstraction has 800 states and 923 transitions.
[2025-03-08 16:52:18,946 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:52:18,946 INFO  L276                IsEmpty]: Start isEmpty. Operand 800 states and 923 transitions.
[2025-03-08 16:52:18,947 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2025-03-08 16:52:18,947 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:18,947 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:52:18,954 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 (28)] Forceful destruction successful, exit code 0
[2025-03-08 16:52:19,147 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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-08 16:52:19,148 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:19,148 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:19,148 INFO  L85        PathProgramCache]: Analyzing trace with hash 866663845, now seen corresponding path program 1 times
[2025-03-08 16:52:19,148 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:52:19,148 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949627786]
[2025-03-08 16:52:19,148 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:19,149 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-08 16:52:19,149 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:52:19,151 INFO  L229       MonitoredProcess]: Starting monitored process 29 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-08 16:52:19,152 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 (29)] Waiting until timeout for monitored process
[2025-03-08 16:52:19,253 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-03-08 16:52:19,365 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-03-08 16:52:19,365 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:19,365 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:19,371 INFO  L256         TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-03-08 16:52:19,374 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:52:19,378 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2025-03-08 16:52:19,404 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:19,404 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39
[2025-03-08 16:52:19,426 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:19,426 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 42
[2025-03-08 16:52:19,441 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:19,441 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 42
[2025-03-08 16:52:19,462 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:19,462 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 53
[2025-03-08 16:52:19,511 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:19,512 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 56
[2025-03-08 16:52:19,652 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:19,652 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 40
[2025-03-08 16:52:19,706 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2025-03-08 16:52:19,706 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:52:19,706 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:52:19,706 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949627786]
[2025-03-08 16:52:19,706 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949627786] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:19,706 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:19,706 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-03-08 16:52:19,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000389273]
[2025-03-08 16:52:19,706 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:19,707 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-08 16:52:19,707 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:52:19,707 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-08 16:52:19,707 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2025-03-08 16:52:19,707 INFO  L87              Difference]: Start difference. First operand 800 states and 923 transitions. Second operand  has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11)
[2025-03-08 16:52:20,587 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:20,588 INFO  L93              Difference]: Finished difference Result 902 states and 1029 transitions.
[2025-03-08 16:52:20,588 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2025-03-08 16:52:20,588 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115
[2025-03-08 16:52:20,588 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:20,591 INFO  L225             Difference]: With dead ends: 902
[2025-03-08 16:52:20,591 INFO  L226             Difference]: Without dead ends: 900
[2025-03-08 16:52:20,591 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506
[2025-03-08 16:52:20,591 INFO  L435           NwaCegarLoop]: 55 mSDtfsCounter, 149 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:20,591 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 488 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 16:52:20,592 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 900 states.
[2025-03-08 16:52:20,679 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 804.
[2025-03-08 16:52:20,680 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 804 states, 733 states have (on average 1.1391541609822646) internal successors, (835), 735 states have internal predecessors, (835), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46)
[2025-03-08 16:52:20,681 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 927 transitions.
[2025-03-08 16:52:20,682 INFO  L78                 Accepts]: Start accepts. Automaton has 804 states and 927 transitions. Word has length 115
[2025-03-08 16:52:20,682 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:20,682 INFO  L471      AbstractCegarLoop]: Abstraction has 804 states and 927 transitions.
[2025-03-08 16:52:20,682 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11)
[2025-03-08 16:52:20,682 INFO  L276                IsEmpty]: Start isEmpty. Operand 804 states and 927 transitions.
[2025-03-08 16:52:20,683 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2025-03-08 16:52:20,683 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:20,683 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:52:20,691 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 (29)] Forceful destruction successful, exit code 0
[2025-03-08 16:52:20,884 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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-08 16:52:20,887 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:20,887 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:20,887 INFO  L85        PathProgramCache]: Analyzing trace with hash 1217463782, now seen corresponding path program 1 times
[2025-03-08 16:52:20,887 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:52:20,887 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434711756]
[2025-03-08 16:52:20,888 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:20,888 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-08 16:52:20,888 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:52:20,889 INFO  L229       MonitoredProcess]: Starting monitored process 30 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-08 16:52:20,890 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 (30)] Waiting until timeout for monitored process
[2025-03-08 16:52:20,994 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-03-08 16:52:21,092 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-03-08 16:52:21,092 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:21,092 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:21,097 INFO  L256         TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 31 conjuncts are in the unsatisfiable core
[2025-03-08 16:52:21,101 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:52:21,104 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-08 16:52:21,105 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51
[2025-03-08 16:52:21,163 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:21,164 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 76
[2025-03-08 16:52:21,348 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:21,348 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 79
[2025-03-08 16:52:21,506 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:21,506 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 70
[2025-03-08 16:52:21,647 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:21,647 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 67
[2025-03-08 16:52:21,785 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:21,785 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 67
[2025-03-08 16:52:21,933 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:21,933 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 76
[2025-03-08 16:52:22,122 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:22,122 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 94
[2025-03-08 16:52:22,213 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:22,214 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 96 treesize of output 98
[2025-03-08 16:52:22,273 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:22,273 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 92 treesize of output 98
[2025-03-08 16:52:22,398 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:22,398 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 96 treesize of output 89
[2025-03-08 16:52:22,719 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:22,719 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 99 treesize of output 51
[2025-03-08 16:52:22,793 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 16 proven. 176 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2025-03-08 16:52:22,793 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:52:22,994 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked.
[2025-03-08 16:52:22,995 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:52:22,995 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434711756]
[2025-03-08 16:52:22,995 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [434711756] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:52:22,995 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:52:22,995 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20
[2025-03-08 16:52:22,995 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323186210]
[2025-03-08 16:52:22,995 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:22,995 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 16:52:22,995 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:52:22,995 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 16:52:22,995 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380
[2025-03-08 16:52:22,996 INFO  L87              Difference]: Start difference. First operand 804 states and 927 transitions. Second operand  has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:52:23,432 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:23,432 INFO  L93              Difference]: Finished difference Result 818 states and 940 transitions.
[2025-03-08 16:52:23,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 16:52:23,433 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 115
[2025-03-08 16:52:23,433 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:23,435 INFO  L225             Difference]: With dead ends: 818
[2025-03-08 16:52:23,435 INFO  L226             Difference]: Without dead ends: 816
[2025-03-08 16:52:23,435 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600
[2025-03-08 16:52:23,435 INFO  L435           NwaCegarLoop]: 121 mSDtfsCounter, 48 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:23,436 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 748 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 16:52:23,436 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 816 states.
[2025-03-08 16:52:23,522 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 801.
[2025-03-08 16:52:23,522 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 801 states, 730 states have (on average 1.1397260273972603) internal successors, (832), 732 states have internal predecessors, (832), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46)
[2025-03-08 16:52:23,523 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 924 transitions.
[2025-03-08 16:52:23,524 INFO  L78                 Accepts]: Start accepts. Automaton has 801 states and 924 transitions. Word has length 115
[2025-03-08 16:52:23,524 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:23,524 INFO  L471      AbstractCegarLoop]: Abstraction has 801 states and 924 transitions.
[2025-03-08 16:52:23,524 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)
[2025-03-08 16:52:23,524 INFO  L276                IsEmpty]: Start isEmpty. Operand 801 states and 924 transitions.
[2025-03-08 16:52:23,525 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2025-03-08 16:52:23,525 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:23,525 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:52:23,532 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 (30)] Ended with exit code 0
[2025-03-08 16:52:23,725 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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-08 16:52:23,726 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:23,726 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:23,726 INFO  L85        PathProgramCache]: Analyzing trace with hash 1352598319, now seen corresponding path program 1 times
[2025-03-08 16:52:23,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:52:23,726 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939681423]
[2025-03-08 16:52:23,726 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:23,726 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-08 16:52:23,726 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:52:23,728 INFO  L229       MonitoredProcess]: Starting monitored process 31 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-08 16:52:23,729 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 (31)] Waiting until timeout for monitored process
[2025-03-08 16:52:23,834 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-03-08 16:52:23,948 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-03-08 16:52:23,948 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:52:23,948 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:52:23,954 INFO  L256         TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 19 conjuncts are in the unsatisfiable core
[2025-03-08 16:52:23,956 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:52:23,959 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2025-03-08 16:52:23,986 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:23,986 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39
[2025-03-08 16:52:24,009 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:24,009 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 42
[2025-03-08 16:52:24,024 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:24,024 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 42
[2025-03-08 16:52:24,039 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:24,039 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 53
[2025-03-08 16:52:24,108 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 68
[2025-03-08 16:52:24,111 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-08 16:52:24,114 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:24,115 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 120
[2025-03-08 16:52:24,160 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 65
[2025-03-08 16:52:24,491 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 16:52:24,491 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 149 treesize of output 65
[2025-03-08 16:52:24,513 INFO  L134       CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2025-03-08 16:52:24,514 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:52:24,514 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:52:24,514 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939681423]
[2025-03-08 16:52:24,514 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939681423] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:52:24,514 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:52:24,514 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 16:52:24,514 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122472007]
[2025-03-08 16:52:24,514 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:52:24,514 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 16:52:24,514 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:52:24,514 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 16:52:24,514 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2025-03-08 16:52:24,515 INFO  L87              Difference]: Start difference. First operand 801 states and 924 transitions. Second operand  has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11)
[2025-03-08 16:52:25,259 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:52:25,259 INFO  L93              Difference]: Finished difference Result 1649 states and 1887 transitions.
[2025-03-08 16:52:25,259 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-03-08 16:52:25,259 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115
[2025-03-08 16:52:25,259 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:52:25,262 INFO  L225             Difference]: With dead ends: 1649
[2025-03-08 16:52:25,262 INFO  L226             Difference]: Without dead ends: 851
[2025-03-08 16:52:25,262 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272
[2025-03-08 16:52:25,263 INFO  L435           NwaCegarLoop]: 54 mSDtfsCounter, 142 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 16:52:25,263 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 290 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 16:52:25,263 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 851 states.
[2025-03-08 16:52:25,344 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 713.
[2025-03-08 16:52:25,345 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 713 states, 642 states have (on average 1.1339563862928348) internal successors, (728), 644 states have internal predecessors, (728), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46)
[2025-03-08 16:52:25,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 820 transitions.
[2025-03-08 16:52:25,346 INFO  L78                 Accepts]: Start accepts. Automaton has 713 states and 820 transitions. Word has length 115
[2025-03-08 16:52:25,346 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:52:25,346 INFO  L471      AbstractCegarLoop]: Abstraction has 713 states and 820 transitions.
[2025-03-08 16:52:25,346 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11)
[2025-03-08 16:52:25,346 INFO  L276                IsEmpty]: Start isEmpty. Operand 713 states and 820 transitions.
[2025-03-08 16:52:25,347 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2025-03-08 16:52:25,347 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:52:25,347 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:52:25,355 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 (31)] Ended with exit code 0
[2025-03-08 16:52:25,547 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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-08 16:52:25,548 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:52:25,548 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:52:25,548 INFO  L85        PathProgramCache]: Analyzing trace with hash -831078608, now seen corresponding path program 1 times
[2025-03-08 16:52:25,548 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:52:25,548 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041440259]
[2025-03-08 16:52:25,548 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:52:25,548 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-08 16:52:25,548 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:52:25,550 INFO  L229       MonitoredProcess]: Starting monitored process 32 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-08 16:52:25,551 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 (32)] Waiting until timeout for monitored process
[2025-03-08 16:52:25,659 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.