./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 8fc3dc66
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.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 20dc1fb0767de0807b7ef890f247a843538519c2d9a410bda6969ecc28831a46
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-17 03:15:57,196 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-17 03:15:57,250 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-17 03:15:57,253 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-17 03:15:57,254 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-17 03:15:57,271 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-17 03:15:57,272 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-17 03:15:57,272 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-17 03:15:57,272 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-17 03:15:57,272 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-17 03:15:57,272 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-17 03:15:57,272 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-17 03:15:57,273 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-17 03:15:57,274 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-17 03:15:57,274 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-17 03:15:57,274 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-17 03:15:57,275 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-17 03:15:57,275 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-17 03:15:57,275 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-17 03:15:57,275 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-17 03:15:57,275 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-17 03:15:57,275 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-17 03:15:57,275 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-17 03:15:57,275 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-17 03:15:57,275 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-17 03:15:57,275 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-17 03:15:57,275 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-17 03:15:57,275 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 -> 20dc1fb0767de0807b7ef890f247a843538519c2d9a410bda6969ecc28831a46
[2025-03-17 03:15:57,505 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-17 03:15:57,512 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-17 03:15:57,514 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-17 03:15:57,515 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-17 03:15:57,515 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-17 03:15:57,516 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i
[2025-03-17 03:15:58,701 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab74642e/2e71860be7254b1495e3cf6832fb7819/FLAG485f8f574
[2025-03-17 03:15:58,966 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-17 03:15:58,968 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i
[2025-03-17 03:15:58,976 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab74642e/2e71860be7254b1495e3cf6832fb7819/FLAG485f8f574
[2025-03-17 03:15:58,992 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab74642e/2e71860be7254b1495e3cf6832fb7819
[2025-03-17 03:15:58,994 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-17 03:15:58,995 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-17 03:15:58,997 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-17 03:15:58,997 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-17 03:15:59,000 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-17 03:15:59,002 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:15:58" (1/1) ...
[2025-03-17 03:15:59,003 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d75eb8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:59, skipping insertion in model container
[2025-03-17 03:15:59,004 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:15:58" (1/1) ...
[2025-03-17 03:15:59,021 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-17 03:15:59,126 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_loopvsstraightlinecode_100-while_file-36.i[916,929]
[2025-03-17 03:15:59,181 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-17 03:15:59,191 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-17 03:15:59,201 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_loopvsstraightlinecode_100-while_file-36.i[916,929]
[2025-03-17 03:15:59,245 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-17 03:15:59,260 INFO  L204         MainTranslator]: Completed translation
[2025-03-17 03:15:59,261 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:59 WrapperNode
[2025-03-17 03:15:59,261 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-17 03:15:59,262 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-17 03:15:59,263 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-17 03:15:59,263 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-17 03:15:59,267 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:59" (1/1) ...
[2025-03-17 03:15:59,281 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:59" (1/1) ...
[2025-03-17 03:15:59,326 INFO  L138                Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 331
[2025-03-17 03:15:59,326 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-17 03:15:59,327 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-17 03:15:59,327 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-17 03:15:59,327 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-17 03:15:59,333 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:59" (1/1) ...
[2025-03-17 03:15:59,334 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:59" (1/1) ...
[2025-03-17 03:15:59,344 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:59" (1/1) ...
[2025-03-17 03:15:59,364 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-17 03:15:59,364 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:59" (1/1) ...
[2025-03-17 03:15:59,364 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:59" (1/1) ...
[2025-03-17 03:15:59,377 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:59" (1/1) ...
[2025-03-17 03:15:59,382 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:59" (1/1) ...
[2025-03-17 03:15:59,385 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:59" (1/1) ...
[2025-03-17 03:15:59,386 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:59" (1/1) ...
[2025-03-17 03:15:59,389 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-17 03:15:59,393 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-17 03:15:59,393 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-17 03:15:59,393 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-17 03:15:59,394 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:59" (1/1) ...
[2025-03-17 03:15:59,402 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-17 03:15:59,417 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-17 03:15:59,429 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-17 03:15:59,432 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-17 03:15:59,450 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-17 03:15:59,450 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-17 03:15:59,450 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-17 03:15:59,450 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-17 03:15:59,451 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-17 03:15:59,451 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-17 03:15:59,525 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-17 03:15:59,527 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-17 03:15:59,960 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L202: havoc property_#t~bitwise26#1;havoc property_#t~ite28#1;havoc property_#t~bitwise27#1;havoc property_#t~short29#1;havoc property_#t~ite31#1;havoc property_#t~bitwise30#1;havoc property_#t~short32#1;havoc property_#t~ite34#1;havoc property_#t~bitwise33#1;havoc property_#t~short35#1;havoc property_#t~bitwise36#1;havoc property_#t~short37#1;
[2025-03-17 03:15:59,998 INFO  L?                        ?]: Removed 39 outVars from TransFormulas that were not future-live.
[2025-03-17 03:15:59,998 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-17 03:16:00,018 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-17 03:16:00,019 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-17 03:16:00,019 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:16:00 BoogieIcfgContainer
[2025-03-17 03:16:00,020 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-17 03:16:00,022 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-17 03:16:00,022 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-17 03:16:00,025 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-17 03:16:00,026 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:15:58" (1/3) ...
[2025-03-17 03:16:00,026 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8999d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:16:00, skipping insertion in model container
[2025-03-17 03:16:00,027 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:59" (2/3) ...
[2025-03-17 03:16:00,027 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8999d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:16:00, skipping insertion in model container
[2025-03-17 03:16:00,027 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:16:00" (3/3) ...
[2025-03-17 03:16:00,028 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-36.i
[2025-03-17 03:16:00,038 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-17 03:16:00,041 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-36.i that has 2 procedures, 136 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-17 03:16:00,088 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-17 03:16:00,098 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;@51d49265, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-17 03:16:00,098 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-17 03:16:00,101 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 136 states, 105 states have (on average 1.5047619047619047) internal successors, (158), 106 states have internal predecessors, (158), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-17 03:16:00,112 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 193
[2025-03-17 03:16:00,114 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:00,114 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:00,115 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:00,119 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:00,119 INFO  L85        PathProgramCache]: Analyzing trace with hash -873347196, now seen corresponding path program 1 times
[2025-03-17 03:16:00,124 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 03:16:00,125 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867568263]
[2025-03-17 03:16:00,125 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:00,127 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 03:16:00,196 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes.
[2025-03-17 03:16:00,219 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements.
[2025-03-17 03:16:00,221 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:00,222 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:00,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked.
[2025-03-17 03:16:00,409 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 03:16:00,409 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867568263]
[2025-03-17 03:16:00,410 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867568263] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-17 03:16:00,410 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931318446]
[2025-03-17 03:16:00,410 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:00,410 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-17 03:16:00,410 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-17 03:16:00,412 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-17 03:16:00,414 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-17 03:16:00,486 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes.
[2025-03-17 03:16:00,551 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements.
[2025-03-17 03:16:00,552 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:00,552 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:00,555 INFO  L256         TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-17 03:16:00,563 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-17 03:16:00,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked.
[2025-03-17 03:16:00,585 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-17 03:16:00,585 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931318446] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 03:16:00,585 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-17 03:16:00,585 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-17 03:16:00,588 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776438140]
[2025-03-17 03:16:00,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 03:16:00,591 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-17 03:16:00,591 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 03:16:00,606 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-17 03:16:00,607 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-17 03:16:00,609 INFO  L87              Difference]: Start difference. First operand  has 136 states, 105 states have (on average 1.5047619047619047) internal successors, (158), 106 states have internal predecessors, (158), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand  has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28)
[2025-03-17 03:16:00,648 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:00,649 INFO  L93              Difference]: Finished difference Result 269 states and 454 transitions.
[2025-03-17 03:16:00,651 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-17 03:16:00,652 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 192
[2025-03-17 03:16:00,652 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:00,657 INFO  L225             Difference]: With dead ends: 269
[2025-03-17 03:16:00,657 INFO  L226             Difference]: Without dead ends: 134
[2025-03-17 03:16:00,661 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 193 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-17 03:16:00,664 INFO  L435           NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-17 03:16:00,665 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-17 03:16:00,675 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 134 states.
[2025-03-17 03:16:00,699 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134.
[2025-03-17 03:16:00,701 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 134 states, 104 states have (on average 1.4807692307692308) internal successors, (154), 104 states have internal predecessors, (154), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-17 03:16:00,706 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 210 transitions.
[2025-03-17 03:16:00,708 INFO  L78                 Accepts]: Start accepts. Automaton has 134 states and 210 transitions. Word has length 192
[2025-03-17 03:16:00,709 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:00,709 INFO  L471      AbstractCegarLoop]: Abstraction has 134 states and 210 transitions.
[2025-03-17 03:16:00,710 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28)
[2025-03-17 03:16:00,710 INFO  L276                IsEmpty]: Start isEmpty. Operand 134 states and 210 transitions.
[2025-03-17 03:16:00,712 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 193
[2025-03-17 03:16:00,712 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:00,712 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:00,721 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-17 03:16:00,912 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-17 03:16:00,913 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:00,913 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:00,914 INFO  L85        PathProgramCache]: Analyzing trace with hash 1425146056, now seen corresponding path program 1 times
[2025-03-17 03:16:00,914 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 03:16:00,914 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117056580]
[2025-03-17 03:16:00,914 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:00,914 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 03:16:00,935 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes.
[2025-03-17 03:16:00,996 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements.
[2025-03-17 03:16:00,996 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:00,996 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:01,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-17 03:16:01,210 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 03:16:01,210 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117056580]
[2025-03-17 03:16:01,210 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117056580] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 03:16:01,210 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 03:16:01,210 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-17 03:16:01,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095102365]
[2025-03-17 03:16:01,210 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 03:16:01,211 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 03:16:01,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 03:16:01,212 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 03:16:01,212 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 03:16:01,212 INFO  L87              Difference]: Start difference. First operand 134 states and 210 transitions. Second operand  has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:01,307 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:01,307 INFO  L93              Difference]: Finished difference Result 267 states and 419 transitions.
[2025-03-17 03:16:01,308 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 03:16:01,308 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192
[2025-03-17 03:16:01,309 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:01,310 INFO  L225             Difference]: With dead ends: 267
[2025-03-17 03:16:01,310 INFO  L226             Difference]: Without dead ends: 134
[2025-03-17 03:16:01,310 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-17 03:16:01,311 INFO  L435           NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-17 03:16:01,311 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 353 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-17 03:16:01,312 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 134 states.
[2025-03-17 03:16:01,319 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134.
[2025-03-17 03:16:01,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 134 states, 104 states have (on average 1.4711538461538463) internal successors, (153), 104 states have internal predecessors, (153), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-17 03:16:01,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 209 transitions.
[2025-03-17 03:16:01,323 INFO  L78                 Accepts]: Start accepts. Automaton has 134 states and 209 transitions. Word has length 192
[2025-03-17 03:16:01,324 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:01,325 INFO  L471      AbstractCegarLoop]: Abstraction has 134 states and 209 transitions.
[2025-03-17 03:16:01,326 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:01,326 INFO  L276                IsEmpty]: Start isEmpty. Operand 134 states and 209 transitions.
[2025-03-17 03:16:01,330 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2025-03-17 03:16:01,330 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:01,330 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:01,330 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-17 03:16:01,331 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:01,331 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:01,332 INFO  L85        PathProgramCache]: Analyzing trace with hash -221931251, now seen corresponding path program 1 times
[2025-03-17 03:16:01,332 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 03:16:01,332 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603213642]
[2025-03-17 03:16:01,332 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:01,332 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 03:16:01,350 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-03-17 03:16:01,387 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-03-17 03:16:01,391 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:01,391 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:01,515 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-17 03:16:01,515 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 03:16:01,515 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603213642]
[2025-03-17 03:16:01,515 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603213642] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 03:16:01,515 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 03:16:01,515 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-17 03:16:01,515 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760135327]
[2025-03-17 03:16:01,516 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 03:16:01,516 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 03:16:01,516 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 03:16:01,516 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 03:16:01,517 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 03:16:01,517 INFO  L87              Difference]: Start difference. First operand 134 states and 209 transitions. Second operand  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:01,624 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:01,624 INFO  L93              Difference]: Finished difference Result 390 states and 611 transitions.
[2025-03-17 03:16:01,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 03:16:01,625 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 194
[2025-03-17 03:16:01,625 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:01,627 INFO  L225             Difference]: With dead ends: 390
[2025-03-17 03:16:01,627 INFO  L226             Difference]: Without dead ends: 257
[2025-03-17 03:16:01,628 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-17 03:16:01,628 INFO  L435           NwaCegarLoop]: 300 mSDtfsCounter, 178 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-17 03:16:01,629 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 459 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-17 03:16:01,629 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 257 states.
[2025-03-17 03:16:01,642 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254.
[2025-03-17 03:16:01,643 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 254 states, 195 states have (on average 1.441025641025641) internal successors, (281), 195 states have internal predecessors, (281), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56)
[2025-03-17 03:16:01,644 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 393 transitions.
[2025-03-17 03:16:01,645 INFO  L78                 Accepts]: Start accepts. Automaton has 254 states and 393 transitions. Word has length 194
[2025-03-17 03:16:01,645 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:01,645 INFO  L471      AbstractCegarLoop]: Abstraction has 254 states and 393 transitions.
[2025-03-17 03:16:01,645 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:01,646 INFO  L276                IsEmpty]: Start isEmpty. Operand 254 states and 393 transitions.
[2025-03-17 03:16:01,647 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2025-03-17 03:16:01,647 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:01,647 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:01,647 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-17 03:16:01,647 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:01,648 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:01,648 INFO  L85        PathProgramCache]: Analyzing trace with hash 1258860002, now seen corresponding path program 1 times
[2025-03-17 03:16:01,648 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 03:16:01,648 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78993135]
[2025-03-17 03:16:01,648 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:01,648 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 03:16:01,668 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-17 03:16:01,688 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-17 03:16:01,688 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:01,688 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:01,756 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-17 03:16:01,757 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 03:16:01,757 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78993135]
[2025-03-17 03:16:01,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78993135] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 03:16:01,757 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 03:16:01,757 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-17 03:16:01,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011303881]
[2025-03-17 03:16:01,757 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 03:16:01,758 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 03:16:01,758 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 03:16:01,758 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 03:16:01,758 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 03:16:01,759 INFO  L87              Difference]: Start difference. First operand 254 states and 393 transitions. Second operand  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:01,840 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:01,840 INFO  L93              Difference]: Finished difference Result 758 states and 1173 transitions.
[2025-03-17 03:16:01,840 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 03:16:01,841 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195
[2025-03-17 03:16:01,841 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:01,844 INFO  L225             Difference]: With dead ends: 758
[2025-03-17 03:16:01,844 INFO  L226             Difference]: Without dead ends: 505
[2025-03-17 03:16:01,845 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-17 03:16:01,845 INFO  L435           NwaCegarLoop]: 193 mSDtfsCounter, 198 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-17 03:16:01,846 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 380 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-17 03:16:01,846 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 505 states.
[2025-03-17 03:16:01,889 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 501.
[2025-03-17 03:16:01,890 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 501 states, 384 states have (on average 1.4270833333333333) internal successors, (548), 384 states have internal predecessors, (548), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112)
[2025-03-17 03:16:01,895 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 772 transitions.
[2025-03-17 03:16:01,896 INFO  L78                 Accepts]: Start accepts. Automaton has 501 states and 772 transitions. Word has length 195
[2025-03-17 03:16:01,897 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:01,897 INFO  L471      AbstractCegarLoop]: Abstraction has 501 states and 772 transitions.
[2025-03-17 03:16:01,897 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:01,898 INFO  L276                IsEmpty]: Start isEmpty. Operand 501 states and 772 transitions.
[2025-03-17 03:16:01,900 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2025-03-17 03:16:01,900 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:01,900 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:01,900 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-17 03:16:01,900 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:01,901 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:01,901 INFO  L85        PathProgramCache]: Analyzing trace with hash 965456995, now seen corresponding path program 1 times
[2025-03-17 03:16:01,901 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 03:16:01,901 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877133199]
[2025-03-17 03:16:01,901 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:01,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 03:16:01,915 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-17 03:16:01,939 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-17 03:16:01,939 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:01,939 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:02,086 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-17 03:16:02,087 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 03:16:02,087 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877133199]
[2025-03-17 03:16:02,087 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877133199] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 03:16:02,088 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 03:16:02,088 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-17 03:16:02,088 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194501529]
[2025-03-17 03:16:02,088 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 03:16:02,088 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 03:16:02,089 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 03:16:02,089 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 03:16:02,089 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 03:16:02,089 INFO  L87              Difference]: Start difference. First operand 501 states and 772 transitions. Second operand  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:02,243 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:02,244 INFO  L93              Difference]: Finished difference Result 1263 states and 1952 transitions.
[2025-03-17 03:16:02,244 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 03:16:02,244 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195
[2025-03-17 03:16:02,245 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:02,253 INFO  L225             Difference]: With dead ends: 1263
[2025-03-17 03:16:02,254 INFO  L226             Difference]: Without dead ends: 763
[2025-03-17 03:16:02,255 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-17 03:16:02,256 INFO  L435           NwaCegarLoop]: 268 mSDtfsCounter, 191 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-17 03:16:02,256 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 427 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-17 03:16:02,258 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 763 states.
[2025-03-17 03:16:02,308 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 759.
[2025-03-17 03:16:02,309 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 759 states, 584 states have (on average 1.4315068493150684) internal successors, (836), 584 states have internal predecessors, (836), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168)
[2025-03-17 03:16:02,313 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1172 transitions.
[2025-03-17 03:16:02,314 INFO  L78                 Accepts]: Start accepts. Automaton has 759 states and 1172 transitions. Word has length 195
[2025-03-17 03:16:02,314 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:02,314 INFO  L471      AbstractCegarLoop]: Abstraction has 759 states and 1172 transitions.
[2025-03-17 03:16:02,314 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:02,315 INFO  L276                IsEmpty]: Start isEmpty. Operand 759 states and 1172 transitions.
[2025-03-17 03:16:02,316 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2025-03-17 03:16:02,316 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:02,316 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:02,316 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-17 03:16:02,316 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:02,317 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:02,317 INFO  L85        PathProgramCache]: Analyzing trace with hash -878295074, now seen corresponding path program 1 times
[2025-03-17 03:16:02,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 03:16:02,317 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815741916]
[2025-03-17 03:16:02,317 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:02,317 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 03:16:02,333 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-17 03:16:02,352 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-17 03:16:02,352 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:02,353 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:02,527 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-17 03:16:02,527 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 03:16:02,527 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815741916]
[2025-03-17 03:16:02,527 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815741916] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 03:16:02,527 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 03:16:02,527 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-17 03:16:02,527 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93267152]
[2025-03-17 03:16:02,527 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 03:16:02,527 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-17 03:16:02,527 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 03:16:02,528 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-17 03:16:02,528 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-17 03:16:02,528 INFO  L87              Difference]: Start difference. First operand 759 states and 1172 transitions. Second operand  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:02,806 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:02,806 INFO  L93              Difference]: Finished difference Result 1541 states and 2378 transitions.
[2025-03-17 03:16:02,807 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-17 03:16:02,807 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195
[2025-03-17 03:16:02,807 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:02,812 INFO  L225             Difference]: With dead ends: 1541
[2025-03-17 03:16:02,813 INFO  L226             Difference]: Without dead ends: 777
[2025-03-17 03:16:02,816 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-17 03:16:02,817 INFO  L435           NwaCegarLoop]: 351 mSDtfsCounter, 305 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-17 03:16:02,818 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 659 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-17 03:16:02,819 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 777 states.
[2025-03-17 03:16:02,867 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 767.
[2025-03-17 03:16:02,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 767 states, 592 states have (on average 1.429054054054054) internal successors, (846), 592 states have internal predecessors, (846), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168)
[2025-03-17 03:16:02,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1182 transitions.
[2025-03-17 03:16:02,875 INFO  L78                 Accepts]: Start accepts. Automaton has 767 states and 1182 transitions. Word has length 195
[2025-03-17 03:16:02,876 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:02,876 INFO  L471      AbstractCegarLoop]: Abstraction has 767 states and 1182 transitions.
[2025-03-17 03:16:02,876 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:02,876 INFO  L276                IsEmpty]: Start isEmpty. Operand 767 states and 1182 transitions.
[2025-03-17 03:16:02,879 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2025-03-17 03:16:02,880 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:02,881 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:02,881 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-17 03:16:02,881 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:02,882 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:02,882 INFO  L85        PathProgramCache]: Analyzing trace with hash 366469407, now seen corresponding path program 1 times
[2025-03-17 03:16:02,882 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 03:16:02,882 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251095756]
[2025-03-17 03:16:02,882 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:02,882 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 03:16:02,895 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-17 03:16:02,956 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-17 03:16:02,957 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:02,957 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:03,093 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-17 03:16:03,093 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 03:16:03,093 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251095756]
[2025-03-17 03:16:03,093 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251095756] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 03:16:03,093 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 03:16:03,094 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-17 03:16:03,094 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905730453]
[2025-03-17 03:16:03,094 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 03:16:03,094 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 03:16:03,094 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 03:16:03,095 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 03:16:03,095 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 03:16:03,095 INFO  L87              Difference]: Start difference. First operand 767 states and 1182 transitions. Second operand  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:03,177 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:03,178 INFO  L93              Difference]: Finished difference Result 1533 states and 2363 transitions.
[2025-03-17 03:16:03,178 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 03:16:03,178 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195
[2025-03-17 03:16:03,179 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:03,182 INFO  L225             Difference]: With dead ends: 1533
[2025-03-17 03:16:03,182 INFO  L226             Difference]: Without dead ends: 767
[2025-03-17 03:16:03,184 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-17 03:16:03,184 INFO  L435           NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-17 03:16:03,184 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 354 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-17 03:16:03,189 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 767 states.
[2025-03-17 03:16:03,216 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767.
[2025-03-17 03:16:03,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 767 states, 592 states have (on average 1.4222972972972974) internal successors, (842), 592 states have internal predecessors, (842), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168)
[2025-03-17 03:16:03,221 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1178 transitions.
[2025-03-17 03:16:03,222 INFO  L78                 Accepts]: Start accepts. Automaton has 767 states and 1178 transitions. Word has length 195
[2025-03-17 03:16:03,222 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:03,222 INFO  L471      AbstractCegarLoop]: Abstraction has 767 states and 1178 transitions.
[2025-03-17 03:16:03,222 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:03,223 INFO  L276                IsEmpty]: Start isEmpty. Operand 767 states and 1178 transitions.
[2025-03-17 03:16:03,225 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2025-03-17 03:16:03,226 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:03,226 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:03,226 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-17 03:16:03,226 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:03,227 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:03,227 INFO  L85        PathProgramCache]: Analyzing trace with hash 2026008209, now seen corresponding path program 1 times
[2025-03-17 03:16:03,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 03:16:03,227 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247916678]
[2025-03-17 03:16:03,227 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:03,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 03:16:03,244 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-17 03:16:03,302 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-17 03:16:03,302 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:03,302 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:04,421 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-17 03:16:04,421 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 03:16:04,421 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247916678]
[2025-03-17 03:16:04,421 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247916678] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 03:16:04,421 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 03:16:04,421 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-03-17 03:16:04,421 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926687563]
[2025-03-17 03:16:04,421 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 03:16:04,422 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-17 03:16:04,422 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 03:16:04,422 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-17 03:16:04,422 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2025-03-17 03:16:04,422 INFO  L87              Difference]: Start difference. First operand 767 states and 1178 transitions. Second operand  has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:06,318 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:06,319 INFO  L93              Difference]: Finished difference Result 4483 states and 6782 transitions.
[2025-03-17 03:16:06,321 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-03-17 03:16:06,321 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196
[2025-03-17 03:16:06,322 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:06,337 INFO  L225             Difference]: With dead ends: 4483
[2025-03-17 03:16:06,338 INFO  L226             Difference]: Without dead ends: 3717
[2025-03-17 03:16:06,341 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380
[2025-03-17 03:16:06,342 INFO  L435           NwaCegarLoop]: 305 mSDtfsCounter, 1456 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-17 03:16:06,342 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 1873 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-17 03:16:06,345 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3717 states.
[2025-03-17 03:16:06,438 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 1601.
[2025-03-17 03:16:06,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1601 states, 1252 states have (on average 1.426517571884984) internal successors, (1786), 1252 states have internal predecessors, (1786), 336 states have call successors, (336), 12 states have call predecessors, (336), 12 states have return successors, (336), 336 states have call predecessors, (336), 336 states have call successors, (336)
[2025-03-17 03:16:06,447 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2458 transitions.
[2025-03-17 03:16:06,449 INFO  L78                 Accepts]: Start accepts. Automaton has 1601 states and 2458 transitions. Word has length 196
[2025-03-17 03:16:06,450 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:06,450 INFO  L471      AbstractCegarLoop]: Abstraction has 1601 states and 2458 transitions.
[2025-03-17 03:16:06,450 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:06,450 INFO  L276                IsEmpty]: Start isEmpty. Operand 1601 states and 2458 transitions.
[2025-03-17 03:16:06,452 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2025-03-17 03:16:06,452 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:06,452 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:06,452 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-17 03:16:06,452 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:06,453 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:06,453 INFO  L85        PathProgramCache]: Analyzing trace with hash -1039293711, now seen corresponding path program 1 times
[2025-03-17 03:16:06,453 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 03:16:06,453 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121583151]
[2025-03-17 03:16:06,453 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:06,453 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 03:16:06,464 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-17 03:16:06,529 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-17 03:16:06,529 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:06,529 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:06,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 27 proven. 54 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked.
[2025-03-17 03:16:06,688 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 03:16:06,688 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121583151]
[2025-03-17 03:16:06,688 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121583151] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-17 03:16:06,688 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818097393]
[2025-03-17 03:16:06,688 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:06,688 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-17 03:16:06,689 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-17 03:16:06,690 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-17 03:16:06,692 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-17 03:16:06,752 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-17 03:16:06,795 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-17 03:16:06,795 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:06,795 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:06,797 INFO  L256         TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-17 03:16:06,806 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-17 03:16:06,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 763 proven. 33 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked.
[2025-03-17 03:16:06,962 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-17 03:16:07,151 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 48 proven. 33 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked.
[2025-03-17 03:16:07,151 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [818097393] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-17 03:16:07,151 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-17 03:16:07,151 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10
[2025-03-17 03:16:07,151 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502364598]
[2025-03-17 03:16:07,152 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-17 03:16:07,152 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-17 03:16:07,152 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 03:16:07,153 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-17 03:16:07,153 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2025-03-17 03:16:07,153 INFO  L87              Difference]: Start difference. First operand 1601 states and 2458 transitions. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59)
[2025-03-17 03:16:07,664 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:07,664 INFO  L93              Difference]: Finished difference Result 3771 states and 5636 transitions.
[2025-03-17 03:16:07,665 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-03-17 03:16:07,665 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) Word has length 196
[2025-03-17 03:16:07,665 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:07,675 INFO  L225             Difference]: With dead ends: 3771
[2025-03-17 03:16:07,675 INFO  L226             Difference]: Without dead ends: 2125
[2025-03-17 03:16:07,679 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462
[2025-03-17 03:16:07,679 INFO  L435           NwaCegarLoop]: 146 mSDtfsCounter, 567 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-17 03:16:07,680 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 463 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-17 03:16:07,681 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2125 states.
[2025-03-17 03:16:07,761 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 987.
[2025-03-17 03:16:07,762 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 987 states, 766 states have (on average 1.3577023498694516) internal successors, (1040), 770 states have internal predecessors, (1040), 196 states have call successors, (196), 24 states have call predecessors, (196), 24 states have return successors, (196), 192 states have call predecessors, (196), 196 states have call successors, (196)
[2025-03-17 03:16:07,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1432 transitions.
[2025-03-17 03:16:07,768 INFO  L78                 Accepts]: Start accepts. Automaton has 987 states and 1432 transitions. Word has length 196
[2025-03-17 03:16:07,768 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:07,768 INFO  L471      AbstractCegarLoop]: Abstraction has 987 states and 1432 transitions.
[2025-03-17 03:16:07,768 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59)
[2025-03-17 03:16:07,768 INFO  L276                IsEmpty]: Start isEmpty. Operand 987 states and 1432 transitions.
[2025-03-17 03:16:07,770 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2025-03-17 03:16:07,770 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:07,770 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:07,777 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-17 03:16:07,970 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-17 03:16:07,971 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:07,971 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:07,971 INFO  L85        PathProgramCache]: Analyzing trace with hash 541188333, now seen corresponding path program 1 times
[2025-03-17 03:16:07,971 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 03:16:07,971 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710267921]
[2025-03-17 03:16:07,971 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:07,971 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 03:16:07,982 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-17 03:16:07,991 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-17 03:16:07,991 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:07,991 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:08,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-17 03:16:08,025 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 03:16:08,025 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710267921]
[2025-03-17 03:16:08,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710267921] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 03:16:08,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 03:16:08,026 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-17 03:16:08,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727282799]
[2025-03-17 03:16:08,026 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 03:16:08,026 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 03:16:08,026 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 03:16:08,027 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 03:16:08,027 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 03:16:08,027 INFO  L87              Difference]: Start difference. First operand 987 states and 1432 transitions. Second operand  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:08,116 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:08,116 INFO  L93              Difference]: Finished difference Result 2473 states and 3582 transitions.
[2025-03-17 03:16:08,117 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 03:16:08,117 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196
[2025-03-17 03:16:08,118 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:08,125 INFO  L225             Difference]: With dead ends: 2473
[2025-03-17 03:16:08,125 INFO  L226             Difference]: Without dead ends: 1487
[2025-03-17 03:16:08,127 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-17 03:16:08,128 INFO  L435           NwaCegarLoop]: 252 mSDtfsCounter, 107 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-17 03:16:08,129 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 431 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-17 03:16:08,130 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1487 states.
[2025-03-17 03:16:08,213 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1243.
[2025-03-17 03:16:08,214 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1243 states, 1022 states have (on average 1.3679060665362035) internal successors, (1398), 1026 states have internal predecessors, (1398), 196 states have call successors, (196), 24 states have call predecessors, (196), 24 states have return successors, (196), 192 states have call predecessors, (196), 196 states have call successors, (196)
[2025-03-17 03:16:08,218 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1790 transitions.
[2025-03-17 03:16:08,219 INFO  L78                 Accepts]: Start accepts. Automaton has 1243 states and 1790 transitions. Word has length 196
[2025-03-17 03:16:08,220 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:08,220 INFO  L471      AbstractCegarLoop]: Abstraction has 1243 states and 1790 transitions.
[2025-03-17 03:16:08,220 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:08,220 INFO  L276                IsEmpty]: Start isEmpty. Operand 1243 states and 1790 transitions.
[2025-03-17 03:16:08,222 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 198
[2025-03-17 03:16:08,222 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:08,222 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:08,222 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-17 03:16:08,222 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:08,222 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:08,222 INFO  L85        PathProgramCache]: Analyzing trace with hash 1700157211, now seen corresponding path program 1 times
[2025-03-17 03:16:08,222 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 03:16:08,222 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656901693]
[2025-03-17 03:16:08,222 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:08,222 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 03:16:08,236 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes.
[2025-03-17 03:16:08,244 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements.
[2025-03-17 03:16:08,245 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:08,245 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:08,357 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-17 03:16:08,357 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 03:16:08,357 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656901693]
[2025-03-17 03:16:08,357 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656901693] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 03:16:08,357 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 03:16:08,357 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-17 03:16:08,358 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604831843]
[2025-03-17 03:16:08,358 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 03:16:08,358 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 03:16:08,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 03:16:08,358 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 03:16:08,358 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 03:16:08,359 INFO  L87              Difference]: Start difference. First operand 1243 states and 1790 transitions. Second operand  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:08,534 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:08,535 INFO  L93              Difference]: Finished difference Result 2887 states and 4168 transitions.
[2025-03-17 03:16:08,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 03:16:08,535 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 197
[2025-03-17 03:16:08,536 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:08,544 INFO  L225             Difference]: With dead ends: 2887
[2025-03-17 03:16:08,544 INFO  L226             Difference]: Without dead ends: 1629
[2025-03-17 03:16:08,547 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-17 03:16:08,548 INFO  L435           NwaCegarLoop]: 223 mSDtfsCounter, 134 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-17 03:16:08,549 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 382 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-17 03:16:08,550 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1629 states.
[2025-03-17 03:16:08,645 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1243.
[2025-03-17 03:16:08,647 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1243 states, 1022 states have (on average 1.3679060665362035) internal successors, (1398), 1026 states have internal predecessors, (1398), 196 states have call successors, (196), 24 states have call predecessors, (196), 24 states have return successors, (196), 192 states have call predecessors, (196), 196 states have call successors, (196)
[2025-03-17 03:16:08,651 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1790 transitions.
[2025-03-17 03:16:08,653 INFO  L78                 Accepts]: Start accepts. Automaton has 1243 states and 1790 transitions. Word has length 197
[2025-03-17 03:16:08,653 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:08,654 INFO  L471      AbstractCegarLoop]: Abstraction has 1243 states and 1790 transitions.
[2025-03-17 03:16:08,654 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:08,655 INFO  L276                IsEmpty]: Start isEmpty. Operand 1243 states and 1790 transitions.
[2025-03-17 03:16:08,656 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2025-03-17 03:16:08,656 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:08,656 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:08,657 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-17 03:16:08,657 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:08,657 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:08,657 INFO  L85        PathProgramCache]: Analyzing trace with hash 2047138036, now seen corresponding path program 1 times
[2025-03-17 03:16:08,657 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 03:16:08,657 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724295488]
[2025-03-17 03:16:08,657 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:08,657 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 03:16:08,669 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-17 03:16:08,694 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-17 03:16:08,695 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:08,695 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:08,821 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-17 03:16:08,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 03:16:08,821 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724295488]
[2025-03-17 03:16:08,821 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724295488] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 03:16:08,821 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 03:16:08,821 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-17 03:16:08,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850954357]
[2025-03-17 03:16:08,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 03:16:08,822 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-17 03:16:08,822 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 03:16:08,822 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-17 03:16:08,822 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-17 03:16:08,823 INFO  L87              Difference]: Start difference. First operand 1243 states and 1790 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:09,059 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:09,060 INFO  L93              Difference]: Finished difference Result 3161 states and 4504 transitions.
[2025-03-17 03:16:09,060 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-17 03:16:09,060 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 198
[2025-03-17 03:16:09,061 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:09,069 INFO  L225             Difference]: With dead ends: 3161
[2025-03-17 03:16:09,069 INFO  L226             Difference]: Without dead ends: 1919
[2025-03-17 03:16:09,072 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-17 03:16:09,072 INFO  L435           NwaCegarLoop]: 185 mSDtfsCounter, 339 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-17 03:16:09,072 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 543 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-17 03:16:09,074 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1919 states.
[2025-03-17 03:16:09,169 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1636.
[2025-03-17 03:16:09,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1636 states, 1344 states have (on average 1.3519345238095237) internal successors, (1817), 1350 states have internal predecessors, (1817), 259 states have call successors, (259), 32 states have call predecessors, (259), 32 states have return successors, (259), 253 states have call predecessors, (259), 259 states have call successors, (259)
[2025-03-17 03:16:09,176 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2335 transitions.
[2025-03-17 03:16:09,178 INFO  L78                 Accepts]: Start accepts. Automaton has 1636 states and 2335 transitions. Word has length 198
[2025-03-17 03:16:09,179 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:09,179 INFO  L471      AbstractCegarLoop]: Abstraction has 1636 states and 2335 transitions.
[2025-03-17 03:16:09,179 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:09,179 INFO  L276                IsEmpty]: Start isEmpty. Operand 1636 states and 2335 transitions.
[2025-03-17 03:16:09,182 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 201
[2025-03-17 03:16:09,182 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:09,182 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:09,182 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-17 03:16:09,183 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:09,183 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:09,183 INFO  L85        PathProgramCache]: Analyzing trace with hash -209783242, now seen corresponding path program 1 times
[2025-03-17 03:16:09,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 03:16:09,183 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51296216]
[2025-03-17 03:16:09,183 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:09,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 03:16:09,194 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes.
[2025-03-17 03:16:09,240 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements.
[2025-03-17 03:16:09,241 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:09,241 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:09,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked.
[2025-03-17 03:16:09,399 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 03:16:09,399 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51296216]
[2025-03-17 03:16:09,399 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51296216] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-17 03:16:09,399 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098354787]
[2025-03-17 03:16:09,399 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:09,399 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-17 03:16:09,400 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-17 03:16:09,401 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-17 03:16:09,403 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-17 03:16:09,466 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes.
[2025-03-17 03:16:09,509 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements.
[2025-03-17 03:16:09,509 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:09,509 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:09,511 INFO  L256         TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-17 03:16:09,516 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-17 03:16:09,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked.
[2025-03-17 03:16:09,685 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-17 03:16:09,896 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked.
[2025-03-17 03:16:09,896 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098354787] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-17 03:16:09,896 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-17 03:16:09,897 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11
[2025-03-17 03:16:09,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602782133]
[2025-03-17 03:16:09,898 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-17 03:16:09,899 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-17 03:16:09,899 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 03:16:09,899 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-17 03:16:09,899 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110
[2025-03-17 03:16:09,900 INFO  L87              Difference]: Start difference. First operand 1636 states and 2335 transitions. Second operand  has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59)
[2025-03-17 03:16:10,558 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:10,559 INFO  L93              Difference]: Finished difference Result 5586 states and 7809 transitions.
[2025-03-17 03:16:10,559 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-03-17 03:16:10,560 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 200
[2025-03-17 03:16:10,561 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:10,578 INFO  L225             Difference]: With dead ends: 5586
[2025-03-17 03:16:10,579 INFO  L226             Difference]: Without dead ends: 3951
[2025-03-17 03:16:10,583 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=269, Unknown=0, NotChecked=0, Total=420
[2025-03-17 03:16:10,583 INFO  L435           NwaCegarLoop]: 173 mSDtfsCounter, 667 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-17 03:16:10,584 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 699 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-17 03:16:10,587 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3951 states.
[2025-03-17 03:16:10,716 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 1754.
[2025-03-17 03:16:10,719 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1754 states, 1471 states have (on average 1.3222297756628145) internal successors, (1945), 1483 states have internal predecessors, (1945), 242 states have call successors, (242), 40 states have call predecessors, (242), 40 states have return successors, (242), 230 states have call predecessors, (242), 242 states have call successors, (242)
[2025-03-17 03:16:10,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2429 transitions.
[2025-03-17 03:16:10,726 INFO  L78                 Accepts]: Start accepts. Automaton has 1754 states and 2429 transitions. Word has length 200
[2025-03-17 03:16:10,726 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:10,727 INFO  L471      AbstractCegarLoop]: Abstraction has 1754 states and 2429 transitions.
[2025-03-17 03:16:10,727 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59)
[2025-03-17 03:16:10,727 INFO  L276                IsEmpty]: Start isEmpty. Operand 1754 states and 2429 transitions.
[2025-03-17 03:16:10,728 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 201
[2025-03-17 03:16:10,728 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:10,729 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:10,736 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-17 03:16:10,929 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-17 03:16:10,930 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:10,930 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:10,930 INFO  L85        PathProgramCache]: Analyzing trace with hash 2007974711, now seen corresponding path program 1 times
[2025-03-17 03:16:10,931 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 03:16:10,931 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282608427]
[2025-03-17 03:16:10,931 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:10,931 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 03:16:10,940 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes.
[2025-03-17 03:16:11,034 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements.
[2025-03-17 03:16:11,035 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:11,036 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-17 03:16:11,038 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [434113733]
[2025-03-17 03:16:11,038 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:11,038 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-17 03:16:11,038 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-17 03:16:11,040 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-17 03:16:11,042 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-17 03:16:11,102 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes.
[2025-03-17 03:16:11,143 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements.
[2025-03-17 03:16:11,143 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:11,143 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-17 03:16:11,143 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-17 03:16:11,165 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes.
[2025-03-17 03:16:11,192 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements.
[2025-03-17 03:16:11,192 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:11,192 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-17 03:16:11,317 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-17 03:16:11,318 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-17 03:16:11,318 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-17 03:16:11,328 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-03-17 03:16:11,520 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-17 03:16:11,523 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-17 03:16:11,639 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-17 03:16:11,641 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:16:11 BoogieIcfgContainer
[2025-03-17 03:16:11,642 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-17 03:16:11,642 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-17 03:16:11,642 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-17 03:16:11,642 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-17 03:16:11,643 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:16:00" (3/4) ...
[2025-03-17 03:16:11,644 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-17 03:16:11,645 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-17 03:16:11,645 INFO  L158              Benchmark]: Toolchain (without parser) took 12650.54ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 121.5MB in the beginning and 286.2MB in the end (delta: -164.8MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB.
[2025-03-17 03:16:11,645 INFO  L158              Benchmark]: CDTParser took 0.90ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-17 03:16:11,645 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 264.85ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 104.4MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-17 03:16:11,646 INFO  L158              Benchmark]: Boogie Procedure Inliner took 64.04ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 99.3MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-17 03:16:11,646 INFO  L158              Benchmark]: Boogie Preprocessor took 65.83ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 93.0MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-17 03:16:11,646 INFO  L158              Benchmark]: IcfgBuilder took 626.57ms. Allocated memory is still 167.8MB. Free memory was 92.6MB in the beginning and 53.3MB in the end (delta: 39.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
[2025-03-17 03:16:11,646 INFO  L158              Benchmark]: TraceAbstraction took 11619.80ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 52.8MB in the beginning and 286.4MB in the end (delta: -233.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-17 03:16:11,646 INFO  L158              Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 394.3MB. Free memory was 286.4MB in the beginning and 286.2MB in the end (delta: 124.5kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-17 03:16:11,647 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.90ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 264.85ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 104.4MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 64.04ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 99.3MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 65.83ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 93.0MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 626.57ms. Allocated memory is still 167.8MB. Free memory was 92.6MB in the beginning and 53.3MB in the end (delta: 39.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
 * TraceAbstraction took 11619.80ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 52.8MB in the beginning and 286.4MB in the end (delta: -233.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * Witness Printer took 2.64ms. Allocated memory is still 394.3MB. Free memory was 286.4MB in the beginning and 286.2MB in the end (delta: 124.5kB). 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 shiftRight at line 107, overapproximation of shiftRight at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 202, overapproximation of someBinaryFLOATComparisonOperation at line 153, overapproximation of someBinaryFLOATComparisonOperation at line 157, overapproximation of someBinaryFLOATComparisonOperation at line 155, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 202, overapproximation of bitwiseOr at line 116, overapproximation of someUnaryDOUBLEoperation at line 22, overapproximation of someBinaryDOUBLEComparisonOperation at line 202, overapproximation of someBinaryDOUBLEComparisonOperation at line 189, overapproximation of someBinaryDOUBLEComparisonOperation at line 187. 
Possible FailurePath: 
[L21]                    unsigned char isInitial = 0;
[L22]                    float var_1_1 = -0.5;
[L23]                    unsigned char var_1_2 = 0;
[L24]                    float var_1_4 = 32.5;
[L25]                    float var_1_5 = 10.25;
[L26]                    float var_1_6 = 15.2;
[L27]                    unsigned short int var_1_7 = 1;
[L28]                    unsigned short int var_1_10 = 1;
[L29]                    signed short int var_1_12 = 8;
[L30]                    signed short int var_1_13 = -16;
[L31]                    unsigned long int var_1_16 = 0;
[L32]                    unsigned long int var_1_17 = 1790089366;
[L33]                    unsigned long int var_1_18 = 1816612959;
[L34]                    unsigned long int var_1_19 = 2;
[L35]                    unsigned char var_1_20 = 32;
[L36]                    unsigned char var_1_21 = 32;
[L37]                    unsigned short int var_1_22 = 256;
[L38]                    unsigned short int var_1_23 = 21380;
[L39]                    signed char var_1_25 = 8;
[L40]                    signed char var_1_26 = 0;
[L41]                    signed char var_1_27 = 32;
[L42]                    signed char var_1_28 = 32;
[L43]                    double var_1_29 = 99999999.2;
[L44]                    double var_1_31 = 64.25;
[L45]                    double var_1_32 = 100.6;
[L46]                    unsigned char var_1_33 = 0;
[L47]                    unsigned char var_1_34 = 0;
[L48]                    unsigned short int var_1_35 = 4;
[L49]                    unsigned long int last_1_var_1_16 = 0;
[L50]                    unsigned long int last_1_var_1_19 = 2;
[L51]                    unsigned char last_1_var_1_20 = 32;
[L52]                    signed char last_1_var_1_25 = 8;
[L53]                    unsigned char last_1_var_1_33 = 0;
[L206]                   isInitial = 1
[L207]       FCALL       initially()
[L208]       COND TRUE   1
[L209]       CALL        updateLastVariables()
[L195]                   last_1_var_1_16 = var_1_16
[L196]                   last_1_var_1_19 = var_1_19
[L197]                   last_1_var_1_20 = var_1_20
[L198]                   last_1_var_1_25 = var_1_25
[L199]                   last_1_var_1_33 = var_1_33
[L209]       RET         updateLastVariables()
[L210]       CALL        updateVariables()
[L149]                   var_1_2 = __VERIFIER_nondet_uchar()
[L150]       CALL        assume_abort_if_not(var_1_2 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1]
[L150]       RET         assume_abort_if_not(var_1_2 >= 0)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1]
[L151]       CALL        assume_abort_if_not(var_1_2 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1]
[L151]       RET         assume_abort_if_not(var_1_2 <= 1)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1]
[L152]                   var_1_4 = __VERIFIER_nondet_float()
[L153]       CALL        assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_5=41/4, var_1_6=76/5, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_5=41/4, var_1_6=76/5, var_1_7=1]
[L153]       RET         assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_5=41/4, var_1_6=76/5, var_1_7=1]
[L154]                   var_1_5 = __VERIFIER_nondet_float()
[L155]       CALL        assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=76/5, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=76/5, var_1_7=1]
[L155]       RET         assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=76/5, var_1_7=1]
[L156]                   var_1_6 = __VERIFIER_nondet_float()
[L157]       CALL        assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L157]       RET         assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L158]                   var_1_10 = __VERIFIER_nondet_ushort()
[L159]       CALL        assume_abort_if_not(var_1_10 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L159]       RET         assume_abort_if_not(var_1_10 >= 0)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L160]       CALL        assume_abort_if_not(var_1_10 <= 32767)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L160]       RET         assume_abort_if_not(var_1_10 <= 32767)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L161]                   var_1_12 = __VERIFIER_nondet_short()
[L162]       CALL        assume_abort_if_not(var_1_12 >= -32768)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L162]       RET         assume_abort_if_not(var_1_12 >= -32768)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L163]       CALL        assume_abort_if_not(var_1_12 <= 32767)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L163]       RET         assume_abort_if_not(var_1_12 <= 32767)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L164]       CALL        assume_abort_if_not(var_1_12 != 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L164]       RET         assume_abort_if_not(var_1_12 != 0)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L165]                   var_1_17 = __VERIFIER_nondet_ulong()
[L166]       CALL        assume_abort_if_not(var_1_17 >= 1610612735)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L166]       RET         assume_abort_if_not(var_1_17 >= 1610612735)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L167]       CALL        assume_abort_if_not(var_1_17 <= 2147483647)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L167]       RET         assume_abort_if_not(var_1_17 <= 2147483647)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L168]                   var_1_18 = __VERIFIER_nondet_ulong()
[L169]       CALL        assume_abort_if_not(var_1_18 >= 1610612735)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L169]       RET         assume_abort_if_not(var_1_18 >= 1610612735)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L170]       CALL        assume_abort_if_not(var_1_18 <= 2147483647)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L170]       RET         assume_abort_if_not(var_1_18 <= 2147483647)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L171]                   var_1_21 = __VERIFIER_nondet_uchar()
[L172]       CALL        assume_abort_if_not(var_1_21 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L172]       RET         assume_abort_if_not(var_1_21 >= 0)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L173]       CALL        assume_abort_if_not(var_1_21 <= 254)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L173]       RET         assume_abort_if_not(var_1_21 <= 254)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L174]                   var_1_23 = __VERIFIER_nondet_ushort()
[L175]       CALL        assume_abort_if_not(var_1_23 >= 16383)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L175]       RET         assume_abort_if_not(var_1_23 >= 16383)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L176]       CALL        assume_abort_if_not(var_1_23 <= 32767)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L176]       RET         assume_abort_if_not(var_1_23 <= 32767)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L177]                   var_1_26 = __VERIFIER_nondet_char()
[L178]       CALL        assume_abort_if_not(var_1_26 >= -63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L178]       RET         assume_abort_if_not(var_1_26 >= -63)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L179]       CALL        assume_abort_if_not(var_1_26 <= 63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L179]       RET         assume_abort_if_not(var_1_26 <= 63)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L180]                   var_1_27 = __VERIFIER_nondet_char()
[L181]       CALL        assume_abort_if_not(var_1_27 >= -63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L181]       RET         assume_abort_if_not(var_1_27 >= -63)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L182]       CALL        assume_abort_if_not(var_1_27 <= 63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L182]       RET         assume_abort_if_not(var_1_27 <= 63)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L183]                   var_1_28 = __VERIFIER_nondet_char()
[L184]       CALL        assume_abort_if_not(var_1_28 >= -127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L184]       RET         assume_abort_if_not(var_1_28 >= -127)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L185]       CALL        assume_abort_if_not(var_1_28 <= 126)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L185]       RET         assume_abort_if_not(var_1_28 <= 126)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L186]                   var_1_31 = __VERIFIER_nondet_double()
[L187]       CALL        assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L187]       RET         assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L188]                   var_1_32 = __VERIFIER_nondet_double()
[L189]       CALL        assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L189]       RET         assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L190]                   var_1_34 = __VERIFIER_nondet_uchar()
[L191]       CALL        assume_abort_if_not(var_1_34 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_35=4, var_1_7=1]
[L191]       RET         assume_abort_if_not(var_1_34 >= 0)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_35=4, var_1_7=1]
[L192]       CALL        assume_abort_if_not(var_1_34 <= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L192]       RET         assume_abort_if_not(var_1_34 <= 0)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L210]       RET         updateVariables()
[L211]       CALL        step()
[L57]        COND FALSE  !(\read(last_1_var_1_33))
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L66]        COND TRUE   var_1_6 == (- (99.4f * var_1_4))
[L67]                    var_1_25 = (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28)))
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L75]        EXPR        var_1_10 & last_1_var_1_25
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L75]                    unsigned long int stepLocal_3 = last_1_var_1_16 * (var_1_10 & last_1_var_1_25);
[L76]        COND FALSE  !(\read(last_1_var_1_33))
[L85]                    var_1_20 = 100
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_3=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L87]                    signed char stepLocal_2 = var_1_25;
[L88]                    unsigned short int stepLocal_1 = var_1_7;
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L89]        COND TRUE   stepLocal_2 <= last_1_var_1_16
[L90]                    var_1_16 = ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L96]                    unsigned long int stepLocal_5 = var_1_16;
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, stepLocal_5=3808567485, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1]
[L97]        COND FALSE  !(var_1_18 >= stepLocal_5)
[L104]                   var_1_29 = var_1_6
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=2, var_1_7=1]
[L106]                   var_1_35 = var_1_7
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L107]       EXPR        var_1_20 >> var_1_12
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L107]       EXPR        ((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L107]       EXPR        var_1_20 >> var_1_12
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L107]       EXPR        ((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=1, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L107]       COND TRUE   (var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))
[L108]                   var_1_13 = 8
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=1, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L112]       COND FALSE  !(var_1_13 >= var_1_18)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=1, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L115]                   signed short int stepLocal_6 = var_1_13;
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, stepLocal_6=8, var_1_10=0, var_1_12=1, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L116]       EXPR        var_1_20 ^ var_1_23
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, stepLocal_6=8, var_1_10=0, var_1_12=1, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L116]       COND FALSE  !((var_1_20 ^ var_1_23) > stepLocal_6)
[L121]       COND TRUE   \read(var_1_2)
[L122]                   var_1_33 = 0
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=1, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L127]                   unsigned long int stepLocal_0 = var_1_19;
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=1, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L128]       COND FALSE  !(\read(var_1_33))
[L135]                   var_1_1 = var_1_6
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=1, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L137]                   unsigned char stepLocal_4 = var_1_20;
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, stepLocal_4=100, var_1_10=0, var_1_12=1, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L138]       COND FALSE  !(stepLocal_4 < var_1_20)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=1, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L141]       COND FALSE  !(\read(var_1_33))
[L144]                   var_1_22 = 2
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=1, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L211]       RET         step()
[L212]       CALL, EXPR  property()
[L202]       EXPR        ((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L202]       EXPR        (((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100)))
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L202]       EXPR        (((((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100)))) && ((var_1_20 < var_1_20) ? (var_1_22 == ((unsigned short int) ((((((var_1_16 + 16) + (var_1_23 - var_1_21))) < (var_1_20)) ? (((var_1_16 + 16) + (var_1_23 - var_1_21))) : (var_1_20))))) : (var_1_33 ? (var_1_22 == ((unsigned short int) var_1_20)) : (var_1_22 == ((unsigned short int) 2))))) && ((var_1_6 == (- (99.4f * var_1_4))) ? (var_1_25 == ((signed char) (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))))) : (((last_1_var_1_20 ^ last_1_var_1_19) < last_1_var_1_20) ? (var_1_25 == ((signed char) var_1_27)) : (var_1_25 == ((signed char) var_1_26))))
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L202]       EXPR        (((((((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100)))) && ((var_1_20 < var_1_20) ? (var_1_22 == ((unsigned short int) ((((((var_1_16 + 16) + (var_1_23 - var_1_21))) < (var_1_20)) ? (((var_1_16 + 16) + (var_1_23 - var_1_21))) : (var_1_20))))) : (var_1_33 ? (var_1_22 == ((unsigned short int) var_1_20)) : (var_1_22 == ((unsigned short int) 2))))) && ((var_1_6 == (- (99.4f * var_1_4))) ? (var_1_25 == ((signed char) (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))))) : (((last_1_var_1_20 ^ last_1_var_1_19) < last_1_var_1_20) ? (var_1_25 == ((signed char) var_1_27)) : (var_1_25 == ((signed char) var_1_26))))) && ((var_1_18 >= var_1_16) ? (((- var_1_6) <= var_1_4) ? (var_1_29 == ((double) ((((var_1_5) > ((var_1_6 - var_1_4))) ? (var_1_5) : ((var_1_6 - var_1_4)))))) : (var_1_29 == ((double) (1.0000000000002E12 + ((((((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) > (var_1_32)) ? (((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) : (var_1_32))))))) : (var_1_29 == ((double) var_1_6)))) && (((var_1_20 ^ var_1_23) > var_1_13) ? ((! (var_1_18 == (var_1_20 + var_1_7))) ? (var_1_33 == ((unsigned char) var_1_34)) : 1) : (var_1_2 ? (var_1_33 == ((unsigned char) 0)) : (var_1_33 == ((unsigned char) var_1_34))))
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L202-L203]              return ((((((((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100)))) && ((var_1_20 < var_1_20) ? (var_1_22 == ((unsigned short int) ((((((var_1_16 + 16) + (var_1_23 - var_1_21))) < (var_1_20)) ? (((var_1_16 + 16) + (var_1_23 - var_1_21))) : (var_1_20))))) : (var_1_33 ? (var_1_22 == ((unsigned short int) var_1_20)) : (var_1_22 == ((unsigned short int) 2))))) && ((var_1_6 == (- (99.4f * var_1_4))) ? (var_1_25 == ((signed char) (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))))) : (((last_1_var_1_20 ^ last_1_var_1_19) < last_1_var_1_20) ? (var_1_25 == ((signed char) var_1_27)) : (var_1_25 == ((signed char) var_1_26))))) && ((var_1_18 >= var_1_16) ? (((- var_1_6) <= var_1_4) ? (var_1_29 == ((double) ((((var_1_5) > ((var_1_6 - var_1_4))) ? (var_1_5) : ((var_1_6 - var_1_4)))))) : (var_1_29 == ((double) (1.0000000000002E12 + ((((((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) > (var_1_32)) ? (((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) : (var_1_32))))))) : (var_1_29 == ((double) var_1_6)))) && (((var_1_20 ^ var_1_23) > var_1_13) ? ((! (var_1_18 == (var_1_20 + var_1_7))) ? (var_1_33 == ((unsigned char) var_1_34)) : 1) : (var_1_2 ? (var_1_33 == ((unsigned char) 0)) : (var_1_33 == ((unsigned char) var_1_34))))) && (var_1_35 == ((unsigned short int) var_1_7))
;
[L212]       RET, EXPR   property()
[L212]       CALL        __VERIFIER_assert(property())
[L19]        COND TRUE   !(cond)
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]
[L19]                    reach_error()
             VAL         [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=1, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=63, var_1_27=-63, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 136 locations, 242 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 14, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4169 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4142 mSDsluCounter, 7223 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4232 mSDsCounter, 909 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2924 IncrementalHoareTripleChecker+Invalid, 3833 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 909 mSolverCounterUnsat, 2991 mSDtfsCounter, 2924 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1085 GetRequests, 1015 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1754occurred in iteration=13, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 6385 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 3529 NumberOfCodeBlocks, 3529 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3507 ConstructedInterpolants, 0 QuantifiedInterpolants, 6800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1364 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 26907/27216 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-17 03:16:11,671 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_loopvsstraightlinecode_100-while_file-36.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 20dc1fb0767de0807b7ef890f247a843538519c2d9a410bda6969ecc28831a46
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-17 03:16:13,477 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-17 03:16:13,540 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-17 03:16:13,547 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-17 03:16:13,547 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-17 03:16:13,568 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-17 03:16:13,569 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-17 03:16:13,569 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-17 03:16:13,569 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-17 03:16:13,569 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-17 03:16:13,569 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-17 03:16:13,569 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-17 03:16:13,571 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-17 03:16:13,571 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-17 03:16:13,571 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-17 03:16:13,572 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-17 03:16:13,572 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-17 03:16:13,572 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-17 03:16:13,572 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-17 03:16:13,572 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-17 03:16:13,573 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-17 03:16:13,573 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-17 03:16:13,573 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-17 03:16:13,573 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-17 03:16:13,573 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-17 03:16:13,573 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-17 03:16:13,573 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-17 03:16:13,573 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-17 03:16:13,573 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-17 03:16:13,573 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-17 03:16:13,574 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-17 03:16:13,574 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-17 03:16:13,574 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-17 03:16:13,574 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-17 03:16:13,574 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-17 03:16:13,574 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-17 03:16:13,575 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-17 03:16:13,575 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-17 03:16:13,575 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-17 03:16:13,575 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-17 03:16:13,575 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-17 03:16:13,575 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-17 03:16:13,575 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-17 03:16:13,575 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-17 03:16:13,575 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-17 03:16:13,576 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 -> 20dc1fb0767de0807b7ef890f247a843538519c2d9a410bda6969ecc28831a46
[2025-03-17 03:16:13,825 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-17 03:16:13,832 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-17 03:16:13,833 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-17 03:16:13,834 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-17 03:16:13,834 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-17 03:16:13,835 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i
[2025-03-17 03:16:15,018 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94063d119/ff4eab7b5816421bb07e70d0171a8926/FLAG5276e51cc
[2025-03-17 03:16:15,263 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-17 03:16:15,264 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i
[2025-03-17 03:16:15,275 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94063d119/ff4eab7b5816421bb07e70d0171a8926/FLAG5276e51cc
[2025-03-17 03:16:15,573 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94063d119/ff4eab7b5816421bb07e70d0171a8926
[2025-03-17 03:16:15,574 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-17 03:16:15,576 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-17 03:16:15,577 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-17 03:16:15,577 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-17 03:16:15,580 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-17 03:16:15,580 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:16:15" (1/1) ...
[2025-03-17 03:16:15,581 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2cd8d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:15, skipping insertion in model container
[2025-03-17 03:16:15,581 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:16:15" (1/1) ...
[2025-03-17 03:16:15,598 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-17 03:16:15,697 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_loopvsstraightlinecode_100-while_file-36.i[916,929]
[2025-03-17 03:16:15,753 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-17 03:16:15,764 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-17 03:16:15,771 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_loopvsstraightlinecode_100-while_file-36.i[916,929]
[2025-03-17 03:16:15,798 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-17 03:16:15,813 INFO  L204         MainTranslator]: Completed translation
[2025-03-17 03:16:15,814 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:15 WrapperNode
[2025-03-17 03:16:15,815 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-17 03:16:15,815 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-17 03:16:15,815 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-17 03:16:15,816 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-17 03:16:15,820 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:15" (1/1) ...
[2025-03-17 03:16:15,830 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:15" (1/1) ...
[2025-03-17 03:16:15,862 INFO  L138                Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198
[2025-03-17 03:16:15,866 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-17 03:16:15,866 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-17 03:16:15,866 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-17 03:16:15,867 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-17 03:16:15,876 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:15" (1/1) ...
[2025-03-17 03:16:15,877 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:15" (1/1) ...
[2025-03-17 03:16:15,881 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:15" (1/1) ...
[2025-03-17 03:16:15,895 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-17 03:16:15,899 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:15" (1/1) ...
[2025-03-17 03:16:15,899 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:15" (1/1) ...
[2025-03-17 03:16:15,909 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:15" (1/1) ...
[2025-03-17 03:16:15,912 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:15" (1/1) ...
[2025-03-17 03:16:15,914 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:15" (1/1) ...
[2025-03-17 03:16:15,915 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:15" (1/1) ...
[2025-03-17 03:16:15,917 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-17 03:16:15,921 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-17 03:16:15,921 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-17 03:16:15,921 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-17 03:16:15,923 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:15" (1/1) ...
[2025-03-17 03:16:15,927 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-17 03:16:15,936 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-17 03:16:15,948 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-17 03:16:15,951 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-17 03:16:15,969 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-17 03:16:15,969 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-17 03:16:15,969 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-17 03:16:15,970 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-17 03:16:15,970 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-17 03:16:15,970 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-17 03:16:16,041 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-17 03:16:16,043 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-17 03:16:20,650 INFO  L?                        ?]: Removed 20 outVars from TransFormulas that were not future-live.
[2025-03-17 03:16:20,651 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-17 03:16:20,670 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-17 03:16:20,671 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-17 03:16:20,671 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:16:20 BoogieIcfgContainer
[2025-03-17 03:16:20,671 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-17 03:16:20,673 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-17 03:16:20,673 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-17 03:16:20,680 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-17 03:16:20,680 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:16:15" (1/3) ...
[2025-03-17 03:16:20,680 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af1cab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:16:20, skipping insertion in model container
[2025-03-17 03:16:20,680 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:15" (2/3) ...
[2025-03-17 03:16:20,681 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af1cab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:16:20, skipping insertion in model container
[2025-03-17 03:16:20,681 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:16:20" (3/3) ...
[2025-03-17 03:16:20,682 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-36.i
[2025-03-17 03:16:20,691 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-17 03:16:20,693 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-36.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-17 03:16:20,732 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-17 03:16:20,741 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;@53fd55ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-17 03:16:20,741 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-17 03:16:20,746 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 85 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-17 03:16:20,755 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 180
[2025-03-17 03:16:20,755 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:20,756 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:20,756 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:20,761 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:20,761 INFO  L85        PathProgramCache]: Analyzing trace with hash 695060771, now seen corresponding path program 1 times
[2025-03-17 03:16:20,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-17 03:16:20,770 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085323831]
[2025-03-17 03:16:20,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:20,771 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-17 03:16:20,771 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-17 03:16:20,775 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-17 03:16:20,776 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-17 03:16:20,855 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes.
[2025-03-17 03:16:21,118 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements.
[2025-03-17 03:16:21,118 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:21,118 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:21,133 INFO  L256         TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-17 03:16:21,140 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-17 03:16:21,179 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked.
[2025-03-17 03:16:21,179 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-17 03:16:21,179 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-17 03:16:21,179 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085323831]
[2025-03-17 03:16:21,180 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085323831] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 03:16:21,180 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 03:16:21,180 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-17 03:16:21,182 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207053302]
[2025-03-17 03:16:21,182 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 03:16:21,185 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-17 03:16:21,185 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-17 03:16:21,197 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-17 03:16:21,198 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-17 03:16:21,199 INFO  L87              Difference]: Start difference. First operand  has 85 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand  has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28)
[2025-03-17 03:16:21,221 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:21,221 INFO  L93              Difference]: Finished difference Result 167 states and 296 transitions.
[2025-03-17 03:16:21,222 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-17 03:16:21,223 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 179
[2025-03-17 03:16:21,223 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:21,227 INFO  L225             Difference]: With dead ends: 167
[2025-03-17 03:16:21,227 INFO  L226             Difference]: Without dead ends: 83
[2025-03-17 03:16:21,229 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 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-17 03:16:21,231 INFO  L435           NwaCegarLoop]: 131 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, 131 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-17 03:16:21,232 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-17 03:16:21,242 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2025-03-17 03:16:21,258 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2025-03-17 03:16:21,259 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-17 03:16:21,262 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 131 transitions.
[2025-03-17 03:16:21,263 INFO  L78                 Accepts]: Start accepts. Automaton has 83 states and 131 transitions. Word has length 179
[2025-03-17 03:16:21,264 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:21,264 INFO  L471      AbstractCegarLoop]: Abstraction has 83 states and 131 transitions.
[2025-03-17 03:16:21,264 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28)
[2025-03-17 03:16:21,264 INFO  L276                IsEmpty]: Start isEmpty. Operand 83 states and 131 transitions.
[2025-03-17 03:16:21,267 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 180
[2025-03-17 03:16:21,267 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:21,267 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:21,278 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-17 03:16:21,468 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-17 03:16:21,468 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:21,469 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:21,469 INFO  L85        PathProgramCache]: Analyzing trace with hash 1941295455, now seen corresponding path program 1 times
[2025-03-17 03:16:21,470 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-17 03:16:21,470 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784147113]
[2025-03-17 03:16:21,470 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:21,470 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-17 03:16:21,470 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-17 03:16:21,472 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-17 03:16:21,474 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-17 03:16:21,526 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes.
[2025-03-17 03:16:21,775 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements.
[2025-03-17 03:16:21,775 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:21,775 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:21,786 INFO  L256         TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-17 03:16:21,790 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-17 03:16:23,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 788 proven. 84 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked.
[2025-03-17 03:16:23,464 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-17 03:16:24,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked.
[2025-03-17 03:16:24,520 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-17 03:16:24,520 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784147113]
[2025-03-17 03:16:24,520 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [784147113] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-17 03:16:24,520 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-17 03:16:24,520 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13
[2025-03-17 03:16:24,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794648693]
[2025-03-17 03:16:24,520 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-17 03:16:24,522 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-17 03:16:24,522 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-17 03:16:24,522 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-17 03:16:24,522 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156
[2025-03-17 03:16:24,523 INFO  L87              Difference]: Start difference. First operand 83 states and 131 transitions. Second operand  has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44)
[2025-03-17 03:16:30,356 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-17 03:16:31,503 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:31,503 INFO  L93              Difference]: Finished difference Result 258 states and 389 transitions.
[2025-03-17 03:16:31,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2025-03-17 03:16:31,504 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) Word has length 179
[2025-03-17 03:16:31,505 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:31,507 INFO  L225             Difference]: With dead ends: 258
[2025-03-17 03:16:31,507 INFO  L226             Difference]: Without dead ends: 176
[2025-03-17 03:16:31,508 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506
[2025-03-17 03:16:31,509 INFO  L435           NwaCegarLoop]: 113 mSDtfsCounter, 264 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time
[2025-03-17 03:16:31,510 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 471 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time]
[2025-03-17 03:16:31,510 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 176 states.
[2025-03-17 03:16:31,523 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 128.
[2025-03-17 03:16:31,524 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 128 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 84 states have internal predecessors, (111), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40)
[2025-03-17 03:16:31,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions.
[2025-03-17 03:16:31,525 INFO  L78                 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 179
[2025-03-17 03:16:31,526 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:31,526 INFO  L471      AbstractCegarLoop]: Abstraction has 128 states and 191 transitions.
[2025-03-17 03:16:31,526 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44)
[2025-03-17 03:16:31,526 INFO  L276                IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions.
[2025-03-17 03:16:31,528 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 180
[2025-03-17 03:16:31,528 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:31,528 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:31,539 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2025-03-17 03:16:31,729 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-17 03:16:31,729 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:31,729 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:31,730 INFO  L85        PathProgramCache]: Analyzing trace with hash 144344096, now seen corresponding path program 1 times
[2025-03-17 03:16:31,730 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-17 03:16:31,730 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262163750]
[2025-03-17 03:16:31,730 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:31,730 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-17 03:16:31,730 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-17 03:16:31,732 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-17 03:16:31,733 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-17 03:16:31,771 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes.
[2025-03-17 03:16:32,018 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements.
[2025-03-17 03:16:32,018 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:32,018 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:32,030 INFO  L256         TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-17 03:16:32,034 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-17 03:16:32,156 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-17 03:16:32,156 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-17 03:16:32,156 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-17 03:16:32,156 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262163750]
[2025-03-17 03:16:32,156 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [262163750] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 03:16:32,156 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 03:16:32,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-17 03:16:32,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837325099]
[2025-03-17 03:16:32,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 03:16:32,157 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-17 03:16:32,157 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-17 03:16:32,159 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-17 03:16:32,159 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-17 03:16:32,159 INFO  L87              Difference]: Start difference. First operand 128 states and 191 transitions. Second operand  has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:36,379 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-17 03:16:37,891 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:37,891 INFO  L93              Difference]: Finished difference Result 382 states and 571 transitions.
[2025-03-17 03:16:37,892 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-17 03:16:37,892 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179
[2025-03-17 03:16:37,893 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:37,895 INFO  L225             Difference]: With dead ends: 382
[2025-03-17 03:16:37,895 INFO  L226             Difference]: Without dead ends: 255
[2025-03-17 03:16:37,896 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-17 03:16:37,897 INFO  L435           NwaCegarLoop]: 210 mSDtfsCounter, 112 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time
[2025-03-17 03:16:37,897 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 377 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time]
[2025-03-17 03:16:37,897 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 255 states.
[2025-03-17 03:16:37,923 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252.
[2025-03-17 03:16:37,924 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 252 states, 163 states have (on average 1.3251533742331287) internal successors, (216), 165 states have internal predecessors, (216), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80)
[2025-03-17 03:16:37,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions.
[2025-03-17 03:16:37,926 INFO  L78                 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 179
[2025-03-17 03:16:37,927 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:37,927 INFO  L471      AbstractCegarLoop]: Abstraction has 252 states and 376 transitions.
[2025-03-17 03:16:37,927 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:37,927 INFO  L276                IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions.
[2025-03-17 03:16:37,931 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2025-03-17 03:16:37,931 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:37,931 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:37,945 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 (4)] Forceful destruction successful, exit code 0
[2025-03-17 03:16:38,132 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-17 03:16:38,132 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:38,133 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:38,133 INFO  L85        PathProgramCache]: Analyzing trace with hash 182531781, now seen corresponding path program 1 times
[2025-03-17 03:16:38,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-17 03:16:38,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058938194]
[2025-03-17 03:16:38,133 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:38,133 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-17 03:16:38,133 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-17 03:16:38,137 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-17 03:16:38,137 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-17 03:16:38,174 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes.
[2025-03-17 03:16:38,410 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements.
[2025-03-17 03:16:38,410 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:38,410 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:38,421 INFO  L256         TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-17 03:16:38,424 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-17 03:16:38,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked.
[2025-03-17 03:16:38,675 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-17 03:16:38,675 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-17 03:16:38,676 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058938194]
[2025-03-17 03:16:38,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058938194] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 03:16:38,676 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 03:16:38,676 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-17 03:16:38,676 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019012919]
[2025-03-17 03:16:38,676 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 03:16:38,676 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-17 03:16:38,676 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-17 03:16:38,677 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-17 03:16:38,677 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-17 03:16:38,677 INFO  L87              Difference]: Start difference. First operand 252 states and 376 transitions. Second operand  has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:43,622 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-17 03:16:47,627 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-17 03:16:50,235 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-17 03:16:50,249 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:16:50,249 INFO  L93              Difference]: Finished difference Result 519 states and 761 transitions.
[2025-03-17 03:16:50,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-17 03:16:50,286 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180
[2025-03-17 03:16:50,287 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:16:50,289 INFO  L225             Difference]: With dead ends: 519
[2025-03-17 03:16:50,289 INFO  L226             Difference]: Without dead ends: 268
[2025-03-17 03:16:50,290 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-03-17 03:16:50,290 INFO  L435           NwaCegarLoop]: 90 mSDtfsCounter, 129 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 115 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time
[2025-03-17 03:16:50,290 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 214 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 160 Invalid, 2 Unknown, 0 Unchecked, 11.4s Time]
[2025-03-17 03:16:50,291 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 268 states.
[2025-03-17 03:16:50,316 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 256.
[2025-03-17 03:16:50,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 256 states, 165 states have (on average 1.2484848484848485) internal successors, (206), 167 states have internal predecessors, (206), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80)
[2025-03-17 03:16:50,318 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 366 transitions.
[2025-03-17 03:16:50,319 INFO  L78                 Accepts]: Start accepts. Automaton has 256 states and 366 transitions. Word has length 180
[2025-03-17 03:16:50,319 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:16:50,319 INFO  L471      AbstractCegarLoop]: Abstraction has 256 states and 366 transitions.
[2025-03-17 03:16:50,320 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-17 03:16:50,320 INFO  L276                IsEmpty]: Start isEmpty. Operand 256 states and 366 transitions.
[2025-03-17 03:16:50,321 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2025-03-17 03:16:50,321 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:16:50,321 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:16:50,333 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-17 03:16:50,521 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-17 03:16:50,522 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:16:50,522 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:16:50,522 INFO  L85        PathProgramCache]: Analyzing trace with hash 182561572, now seen corresponding path program 1 times
[2025-03-17 03:16:50,523 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-17 03:16:50,523 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439434803]
[2025-03-17 03:16:50,523 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:16:50,523 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-17 03:16:50,523 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-17 03:16:50,525 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-17 03:16:50,527 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-17 03:16:50,557 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes.
[2025-03-17 03:16:50,812 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements.
[2025-03-17 03:16:50,812 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:16:50,812 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:16:50,827 INFO  L256         TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-17 03:16:50,830 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-17 03:16:56,824 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 352 proven. 141 refuted. 0 times theorem prover too weak. 1019 trivial. 0 not checked.
[2025-03-17 03:16:56,824 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-17 03:17:06,851 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-17 03:17:06,852 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439434803]
[2025-03-17 03:17:06,852 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439434803] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-17 03:17:06,852 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [561024276]
[2025-03-17 03:17:06,852 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:17:06,852 INFO  L173          SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2025-03-17 03:17:06,852 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4
[2025-03-17 03:17:06,854 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2025-03-17 03:17:06,855 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process
[2025-03-17 03:17:06,905 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes.
[2025-03-17 03:17:07,800 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements.
[2025-03-17 03:17:07,800 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:17:07,800 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:17:07,839 INFO  L256         TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-03-17 03:17:07,842 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-17 03:17:14,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 352 proven. 141 refuted. 0 times theorem prover too weak. 1019 trivial. 0 not checked.
[2025-03-17 03:17:14,542 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-17 03:17:22,928 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleCvc4 [561024276] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-17 03:17:22,928 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-17 03:17:22,928 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8
[2025-03-17 03:17:22,928 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039360370]
[2025-03-17 03:17:22,928 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-17 03:17:22,928 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-17 03:17:22,928 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-17 03:17:22,929 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-17 03:17:22,929 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-03-17 03:17:22,929 INFO  L87              Difference]: Start difference. First operand 256 states and 366 transitions. Second operand  has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28)
[2025-03-17 03:17:28,706 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-17 03:17:29,994 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-17 03:17:30,096 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 03:17:30,096 INFO  L93              Difference]: Finished difference Result 555 states and 767 transitions.
[2025-03-17 03:17:30,130 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-17 03:17:30,131 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 180
[2025-03-17 03:17:30,131 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 03:17:30,133 INFO  L225             Difference]: With dead ends: 555
[2025-03-17 03:17:30,133 INFO  L226             Difference]: Without dead ends: 300
[2025-03-17 03:17:30,134 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182
[2025-03-17 03:17:30,134 INFO  L435           NwaCegarLoop]: 89 mSDtfsCounter, 97 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time
[2025-03-17 03:17:30,134 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 271 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 219 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time]
[2025-03-17 03:17:30,135 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 300 states.
[2025-03-17 03:17:30,155 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 288.
[2025-03-17 03:17:30,156 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 288 states, 189 states have (on average 1.1957671957671958) internal successors, (226), 191 states have internal predecessors, (226), 80 states have call successors, (80), 18 states have call predecessors, (80), 18 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80)
[2025-03-17 03:17:30,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 386 transitions.
[2025-03-17 03:17:30,158 INFO  L78                 Accepts]: Start accepts. Automaton has 288 states and 386 transitions. Word has length 180
[2025-03-17 03:17:30,159 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 03:17:30,159 INFO  L471      AbstractCegarLoop]: Abstraction has 288 states and 386 transitions.
[2025-03-17 03:17:30,159 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28)
[2025-03-17 03:17:30,159 INFO  L276                IsEmpty]: Start isEmpty. Operand 288 states and 386 transitions.
[2025-03-17 03:17:30,160 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 182
[2025-03-17 03:17:30,160 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 03:17:30,161 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:17:30,177 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0
[2025-03-17 03:17:30,372 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0
[2025-03-17 03:17:30,561 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-17 03:17:30,561 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 03:17:30,562 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 03:17:30,562 INFO  L85        PathProgramCache]: Analyzing trace with hash -755130853, now seen corresponding path program 1 times
[2025-03-17 03:17:30,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-17 03:17:30,563 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053321273]
[2025-03-17 03:17:30,563 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 03:17:30,563 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-17 03:17:30,563 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-17 03:17:30,564 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-17 03:17:30,565 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-17 03:17:30,591 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes.
[2025-03-17 03:17:30,816 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements.
[2025-03-17 03:17:30,816 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 03:17:30,816 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 03:17:30,828 INFO  L256         TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 38 conjuncts are in the unsatisfiable core
[2025-03-17 03:17:30,834 INFO  L279         TraceCheckSpWp]: Computing forward predicates...