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


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.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 1380cfc36c62c1d753945810f92d4eba7bc79d804922edbd332f86c5fd94ebd5
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 13:17:36,988 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 13:17:37,040 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 13:17:37,046 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 13:17:37,047 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 13:17:37,062 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 13:17:37,063 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 13:17:37,063 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 13:17:37,063 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 13:17:37,064 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 13:17:37,064 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 13:17:37,065 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 13:17:37,065 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 13:17:37,065 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 13:17:37,065 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 13:17:37,065 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 13:17:37,065 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 13:17:37,065 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 13:17:37,066 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 13:17:37,066 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 13:17:37,066 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 13:17:37,066 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 13:17:37,066 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 13:17:37,066 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 13:17:37,066 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 13:17:37,066 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 13:17:37,066 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 13:17:37,066 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 13:17:37,067 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 13:17:37,067 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 13:17:37,067 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 13:17:37,067 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 13:17:37,067 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 13:17:37,067 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 13:17:37,067 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 13:17:37,067 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 13:17:37,068 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 13:17:37,068 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 13:17:37,068 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 13:17:37,068 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 13:17:37,068 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 13:17:37,068 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 13:17:37,068 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 13:17:37,068 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 -> 1380cfc36c62c1d753945810f92d4eba7bc79d804922edbd332f86c5fd94ebd5
[2025-03-08 13:17:37,281 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 13:17:37,290 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 13:17:37,292 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 13:17:37,292 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 13:17:37,294 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 13:17:37,295 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i
[2025-03-08 13:17:38,499 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27627a66b/221a6ea5d9bc4494bd25e198408759a5/FLAG0dfc5835d
[2025-03-08 13:17:38,752 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 13:17:38,752 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i
[2025-03-08 13:17:38,771 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27627a66b/221a6ea5d9bc4494bd25e198408759a5/FLAG0dfc5835d
[2025-03-08 13:17:38,788 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27627a66b/221a6ea5d9bc4494bd25e198408759a5
[2025-03-08 13:17:38,790 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 13:17:38,791 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 13:17:38,792 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 13:17:38,792 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 13:17:38,796 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 13:17:38,797 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:17:38" (1/1) ...
[2025-03-08 13:17:38,797 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd28bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:38, skipping insertion in model container
[2025-03-08 13:17:38,797 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:17:38" (1/1) ...
[2025-03-08 13:17:38,814 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 13:17:38,914 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i[919,932]
[2025-03-08 13:17:38,971 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 13:17:38,984 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 13:17:38,994 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i[919,932]
[2025-03-08 13:17:39,029 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 13:17:39,041 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 13:17:39,042 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:39 WrapperNode
[2025-03-08 13:17:39,042 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 13:17:39,043 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 13:17:39,043 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 13:17:39,043 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 13:17:39,048 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:39" (1/1) ...
[2025-03-08 13:17:39,056 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:39" (1/1) ...
[2025-03-08 13:17:39,097 INFO  L138                Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 276
[2025-03-08 13:17:39,098 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 13:17:39,098 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 13:17:39,098 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 13:17:39,098 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 13:17:39,104 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:39" (1/1) ...
[2025-03-08 13:17:39,105 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:39" (1/1) ...
[2025-03-08 13:17:39,110 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:39" (1/1) ...
[2025-03-08 13:17:39,134 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-08 13:17:39,134 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:39" (1/1) ...
[2025-03-08 13:17:39,135 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:39" (1/1) ...
[2025-03-08 13:17:39,144 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:39" (1/1) ...
[2025-03-08 13:17:39,147 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:39" (1/1) ...
[2025-03-08 13:17:39,149 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:39" (1/1) ...
[2025-03-08 13:17:39,155 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:39" (1/1) ...
[2025-03-08 13:17:39,162 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 13:17:39,163 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 13:17:39,163 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 13:17:39,163 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 13:17:39,164 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:39" (1/1) ...
[2025-03-08 13:17:39,168 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 13:17:39,177 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 13:17:39,189 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 13:17:39,191 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 13:17:39,211 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 13:17:39,211 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 13:17:39,211 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 13:17:39,211 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 13:17:39,211 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 13:17:39,211 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 13:17:39,283 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 13:17:39,284 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 13:17:39,701 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L187: havoc property_#t~bitwise26#1;havoc property_#t~short27#1;havoc property_#t~bitwise28#1;havoc property_#t~short29#1;
[2025-03-08 13:17:39,734 INFO  L?                        ?]: Removed 21 outVars from TransFormulas that were not future-live.
[2025-03-08 13:17:39,735 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 13:17:39,760 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 13:17:39,760 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 13:17:39,762 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:17:39 BoogieIcfgContainer
[2025-03-08 13:17:39,762 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 13:17:39,764 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 13:17:39,764 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 13:17:39,767 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 13:17:39,768 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:17:38" (1/3) ...
[2025-03-08 13:17:39,768 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325d2958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:17:39, skipping insertion in model container
[2025-03-08 13:17:39,769 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:39" (2/3) ...
[2025-03-08 13:17:39,769 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325d2958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:17:39, skipping insertion in model container
[2025-03-08 13:17:39,769 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:17:39" (3/3) ...
[2025-03-08 13:17:39,770 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i
[2025-03-08 13:17:39,781 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 13:17:39,783 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i that has 2 procedures, 117 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 13:17:39,841 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 13:17:39,848 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;@59c7b855, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 13:17:39,848 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 13:17:39,851 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 117 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2025-03-08 13:17:39,859 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 210
[2025-03-08 13:17:39,859 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:17:39,860 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:39,860 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:17:39,863 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:17:39,864 INFO  L85        PathProgramCache]: Analyzing trace with hash -479152351, now seen corresponding path program 1 times
[2025-03-08 13:17:39,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:17:39,869 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309420524]
[2025-03-08 13:17:39,869 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:39,869 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:17:39,933 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes.
[2025-03-08 13:17:39,949 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements.
[2025-03-08 13:17:39,950 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:39,950 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:40,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked.
[2025-03-08 13:17:40,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:17:40,137 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309420524]
[2025-03-08 13:17:40,138 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309420524] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 13:17:40,138 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861890722]
[2025-03-08 13:17:40,138 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:40,138 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 13:17:40,138 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 13:17:40,164 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 13:17:40,165 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 13:17:40,253 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes.
[2025-03-08 13:17:40,324 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements.
[2025-03-08 13:17:40,324 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:40,324 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:40,327 INFO  L256         TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 13:17:40,336 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 13:17:40,370 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked.
[2025-03-08 13:17:40,370 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 13:17:40,372 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861890722] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:17:40,372 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 13:17:40,372 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 13:17:40,374 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898384702]
[2025-03-08 13:17:40,374 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:17:40,378 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 13:17:40,378 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:17:40,392 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 13:17:40,392 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 13:17:40,394 INFO  L87              Difference]: Start difference. First operand  has 117 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand  has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32)
[2025-03-08 13:17:40,432 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:17:40,432 INFO  L93              Difference]: Finished difference Result 228 states and 395 transitions.
[2025-03-08 13:17:40,433 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 13:17:40,434 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 209
[2025-03-08 13:17:40,434 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:17:40,438 INFO  L225             Difference]: With dead ends: 228
[2025-03-08 13:17:40,439 INFO  L226             Difference]: Without dead ends: 114
[2025-03-08 13:17:40,442 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 13:17:40,444 INFO  L435           NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 13:17:40,444 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 13:17:40,453 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2025-03-08 13:17:40,473 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114.
[2025-03-08 13:17:40,474 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 114 states, 80 states have (on average 1.4375) internal successors, (115), 80 states have internal predecessors, (115), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2025-03-08 13:17:40,480 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 179 transitions.
[2025-03-08 13:17:40,482 INFO  L78                 Accepts]: Start accepts. Automaton has 114 states and 179 transitions. Word has length 209
[2025-03-08 13:17:40,482 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:17:40,482 INFO  L471      AbstractCegarLoop]: Abstraction has 114 states and 179 transitions.
[2025-03-08 13:17:40,482 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32)
[2025-03-08 13:17:40,482 INFO  L276                IsEmpty]: Start isEmpty. Operand 114 states and 179 transitions.
[2025-03-08 13:17:40,484 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 210
[2025-03-08 13:17:40,485 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:17:40,485 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:40,493 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-08 13:17:40,690 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-08 13:17:40,692 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:17:40,692 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:17:40,692 INFO  L85        PathProgramCache]: Analyzing trace with hash -1538203845, now seen corresponding path program 1 times
[2025-03-08 13:17:40,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:17:40,692 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135128921]
[2025-03-08 13:17:40,692 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:40,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:17:40,708 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes.
[2025-03-08 13:17:40,782 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements.
[2025-03-08 13:17:40,782 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:40,783 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:41,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-03-08 13:17:41,014 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:17:41,014 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135128921]
[2025-03-08 13:17:41,014 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135128921] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:17:41,015 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:17:41,015 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 13:17:41,015 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478104312]
[2025-03-08 13:17:41,015 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:17:41,016 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 13:17:41,016 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:17:41,017 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 13:17:41,017 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 13:17:41,018 INFO  L87              Difference]: Start difference. First operand 114 states and 179 transitions. Second operand  has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:41,078 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:17:41,078 INFO  L93              Difference]: Finished difference Result 225 states and 355 transitions.
[2025-03-08 13:17:41,078 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 13:17:41,079 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209
[2025-03-08 13:17:41,079 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:17:41,080 INFO  L225             Difference]: With dead ends: 225
[2025-03-08 13:17:41,080 INFO  L226             Difference]: Without dead ends: 114
[2025-03-08 13:17:41,081 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 13:17:41,082 INFO  L435           NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 13:17:41,082 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 503 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 13:17:41,083 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2025-03-08 13:17:41,090 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114.
[2025-03-08 13:17:41,091 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 114 states, 80 states have (on average 1.425) internal successors, (114), 80 states have internal predecessors, (114), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2025-03-08 13:17:41,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 178 transitions.
[2025-03-08 13:17:41,092 INFO  L78                 Accepts]: Start accepts. Automaton has 114 states and 178 transitions. Word has length 209
[2025-03-08 13:17:41,094 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:17:41,094 INFO  L471      AbstractCegarLoop]: Abstraction has 114 states and 178 transitions.
[2025-03-08 13:17:41,094 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:41,094 INFO  L276                IsEmpty]: Start isEmpty. Operand 114 states and 178 transitions.
[2025-03-08 13:17:41,099 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 211
[2025-03-08 13:17:41,099 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:17:41,099 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:41,099 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 13:17:41,099 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:17:41,100 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:17:41,100 INFO  L85        PathProgramCache]: Analyzing trace with hash 955712466, now seen corresponding path program 1 times
[2025-03-08 13:17:41,100 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:17:41,100 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481824085]
[2025-03-08 13:17:41,100 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:41,100 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:17:41,118 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes.
[2025-03-08 13:17:41,150 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements.
[2025-03-08 13:17:41,150 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:41,150 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:41,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-03-08 13:17:41,417 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:17:41,417 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481824085]
[2025-03-08 13:17:41,417 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481824085] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:17:41,417 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:17:41,417 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 13:17:41,417 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774683367]
[2025-03-08 13:17:41,417 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:17:41,418 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 13:17:41,418 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:17:41,418 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 13:17:41,418 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 13:17:41,420 INFO  L87              Difference]: Start difference. First operand 114 states and 178 transitions. Second operand  has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:41,626 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:17:41,626 INFO  L93              Difference]: Finished difference Result 337 states and 529 transitions.
[2025-03-08 13:17:41,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 13:17:41,626 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 210
[2025-03-08 13:17:41,627 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:17:41,629 INFO  L225             Difference]: With dead ends: 337
[2025-03-08 13:17:41,629 INFO  L226             Difference]: Without dead ends: 226
[2025-03-08 13:17:41,629 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-08 13:17:41,630 INFO  L435           NwaCegarLoop]: 159 mSDtfsCounter, 151 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 13:17:41,630 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 474 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 13:17:41,630 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 226 states.
[2025-03-08 13:17:41,664 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 209.
[2025-03-08 13:17:41,665 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 209 states, 142 states have (on average 1.4225352112676057) internal successors, (202), 142 states have internal predecessors, (202), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64)
[2025-03-08 13:17:41,668 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 330 transitions.
[2025-03-08 13:17:41,668 INFO  L78                 Accepts]: Start accepts. Automaton has 209 states and 330 transitions. Word has length 210
[2025-03-08 13:17:41,668 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:17:41,669 INFO  L471      AbstractCegarLoop]: Abstraction has 209 states and 330 transitions.
[2025-03-08 13:17:41,669 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:41,669 INFO  L276                IsEmpty]: Start isEmpty. Operand 209 states and 330 transitions.
[2025-03-08 13:17:41,670 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 212
[2025-03-08 13:17:41,671 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:17:41,671 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:41,671 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 13:17:41,671 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:17:41,671 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:17:41,672 INFO  L85        PathProgramCache]: Analyzing trace with hash -788929854, now seen corresponding path program 1 times
[2025-03-08 13:17:41,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:17:41,672 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581198314]
[2025-03-08 13:17:41,672 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:41,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:17:41,687 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes.
[2025-03-08 13:17:41,721 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements.
[2025-03-08 13:17:41,722 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:41,722 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:41,939 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-03-08 13:17:41,939 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:17:41,939 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581198314]
[2025-03-08 13:17:41,939 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581198314] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:17:41,940 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:17:41,940 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 13:17:41,940 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521030725]
[2025-03-08 13:17:41,940 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:17:41,940 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 13:17:41,940 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:17:41,941 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 13:17:41,941 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 13:17:41,941 INFO  L87              Difference]: Start difference. First operand 209 states and 330 transitions. Second operand  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:42,185 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:17:42,185 INFO  L93              Difference]: Finished difference Result 469 states and 734 transitions.
[2025-03-08 13:17:42,186 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 13:17:42,186 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211
[2025-03-08 13:17:42,187 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:17:42,189 INFO  L225             Difference]: With dead ends: 469
[2025-03-08 13:17:42,189 INFO  L226             Difference]: Without dead ends: 343
[2025-03-08 13:17:42,192 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 13:17:42,194 INFO  L435           NwaCegarLoop]: 181 mSDtfsCounter, 189 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 13:17:42,194 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 500 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 13:17:42,195 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 343 states.
[2025-03-08 13:17:42,251 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 325.
[2025-03-08 13:17:42,252 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 325 states, 225 states have (on average 1.4177777777777778) internal successors, (319), 225 states have internal predecessors, (319), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96)
[2025-03-08 13:17:42,254 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 511 transitions.
[2025-03-08 13:17:42,257 INFO  L78                 Accepts]: Start accepts. Automaton has 325 states and 511 transitions. Word has length 211
[2025-03-08 13:17:42,258 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:17:42,258 INFO  L471      AbstractCegarLoop]: Abstraction has 325 states and 511 transitions.
[2025-03-08 13:17:42,258 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:42,258 INFO  L276                IsEmpty]: Start isEmpty. Operand 325 states and 511 transitions.
[2025-03-08 13:17:42,261 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-08 13:17:42,261 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:17:42,262 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:42,262 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 13:17:42,262 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:17:42,262 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:17:42,262 INFO  L85        PathProgramCache]: Analyzing trace with hash 1653604463, now seen corresponding path program 1 times
[2025-03-08 13:17:42,262 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:17:42,262 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413554730]
[2025-03-08 13:17:42,262 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:42,262 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:17:42,282 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 13:17:42,300 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 13:17:42,301 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:42,301 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:42,601 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-03-08 13:17:42,601 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:17:42,601 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413554730]
[2025-03-08 13:17:42,601 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413554730] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:17:42,601 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:17:42,601 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 13:17:42,601 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553517052]
[2025-03-08 13:17:42,601 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:17:42,602 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 13:17:42,602 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:17:42,603 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 13:17:42,603 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 13:17:42,603 INFO  L87              Difference]: Start difference. First operand 325 states and 511 transitions. Second operand  has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:42,959 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:17:42,959 INFO  L93              Difference]: Finished difference Result 862 states and 1338 transitions.
[2025-03-08 13:17:42,961 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-08 13:17:42,961 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212
[2025-03-08 13:17:42,961 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:17:42,967 INFO  L225             Difference]: With dead ends: 862
[2025-03-08 13:17:42,967 INFO  L226             Difference]: Without dead ends: 631
[2025-03-08 13:17:42,968 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182
[2025-03-08 13:17:42,968 INFO  L435           NwaCegarLoop]: 282 mSDtfsCounter, 401 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 13:17:42,971 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1047 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 13:17:42,973 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 631 states.
[2025-03-08 13:17:43,026 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 565.
[2025-03-08 13:17:43,027 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 565 states, 399 states have (on average 1.4260651629072683) internal successors, (569), 399 states have internal predecessors, (569), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160)
[2025-03-08 13:17:43,030 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 889 transitions.
[2025-03-08 13:17:43,031 INFO  L78                 Accepts]: Start accepts. Automaton has 565 states and 889 transitions. Word has length 212
[2025-03-08 13:17:43,031 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:17:43,031 INFO  L471      AbstractCegarLoop]: Abstraction has 565 states and 889 transitions.
[2025-03-08 13:17:43,031 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:43,031 INFO  L276                IsEmpty]: Start isEmpty. Operand 565 states and 889 transitions.
[2025-03-08 13:17:43,032 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-08 13:17:43,032 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:17:43,033 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:43,033 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 13:17:43,033 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:17:43,033 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:17:43,033 INFO  L85        PathProgramCache]: Analyzing trace with hash 1457090958, now seen corresponding path program 1 times
[2025-03-08 13:17:43,033 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:17:43,033 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034146442]
[2025-03-08 13:17:43,033 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:43,033 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:17:43,044 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 13:17:43,068 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 13:17:43,068 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:43,068 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:43,207 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-03-08 13:17:43,207 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:17:43,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034146442]
[2025-03-08 13:17:43,208 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034146442] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:17:43,208 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:17:43,208 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 13:17:43,208 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879958690]
[2025-03-08 13:17:43,208 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:17:43,208 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 13:17:43,208 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:17:43,209 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 13:17:43,209 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:17:43,209 INFO  L87              Difference]: Start difference. First operand 565 states and 889 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:43,275 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:17:43,275 INFO  L93              Difference]: Finished difference Result 1053 states and 1655 transitions.
[2025-03-08 13:17:43,276 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 13:17:43,276 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212
[2025-03-08 13:17:43,276 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:17:43,279 INFO  L225             Difference]: With dead ends: 1053
[2025-03-08 13:17:43,279 INFO  L226             Difference]: Without dead ends: 565
[2025-03-08 13:17:43,281 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-08 13:17:43,281 INFO  L435           NwaCegarLoop]: 172 mSDtfsCounter, 77 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 13:17:43,281 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 329 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 13:17:43,282 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 565 states.
[2025-03-08 13:17:43,342 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565.
[2025-03-08 13:17:43,343 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 565 states, 399 states have (on average 1.4235588972431077) internal successors, (568), 399 states have internal predecessors, (568), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160)
[2025-03-08 13:17:43,346 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 888 transitions.
[2025-03-08 13:17:43,347 INFO  L78                 Accepts]: Start accepts. Automaton has 565 states and 888 transitions. Word has length 212
[2025-03-08 13:17:43,347 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:17:43,347 INFO  L471      AbstractCegarLoop]: Abstraction has 565 states and 888 transitions.
[2025-03-08 13:17:43,348 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:43,348 INFO  L276                IsEmpty]: Start isEmpty. Operand 565 states and 888 transitions.
[2025-03-08 13:17:43,349 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-08 13:17:43,349 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:17:43,349 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:43,349 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 13:17:43,349 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:17:43,350 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:17:43,350 INFO  L85        PathProgramCache]: Analyzing trace with hash -1593111857, now seen corresponding path program 1 times
[2025-03-08 13:17:43,350 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:17:43,350 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300185307]
[2025-03-08 13:17:43,350 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:43,350 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:17:43,361 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 13:17:43,391 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 13:17:43,391 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:43,391 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:43,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-03-08 13:17:43,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:17:43,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300185307]
[2025-03-08 13:17:43,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300185307] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:17:43,622 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:17:43,622 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 13:17:43,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728529272]
[2025-03-08 13:17:43,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:17:43,623 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 13:17:43,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:17:43,623 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 13:17:43,623 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 13:17:43,624 INFO  L87              Difference]: Start difference. First operand 565 states and 888 transitions. Second operand  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:43,846 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:17:43,847 INFO  L93              Difference]: Finished difference Result 1109 states and 1727 transitions.
[2025-03-08 13:17:43,847 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 13:17:43,847 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212
[2025-03-08 13:17:43,848 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:17:43,851 INFO  L225             Difference]: With dead ends: 1109
[2025-03-08 13:17:43,852 INFO  L226             Difference]: Without dead ends: 627
[2025-03-08 13:17:43,853 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-08 13:17:43,853 INFO  L435           NwaCegarLoop]: 159 mSDtfsCounter, 141 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 13:17:43,854 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 470 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 13:17:43,854 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 627 states.
[2025-03-08 13:17:43,904 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 573.
[2025-03-08 13:17:43,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 573 states, 407 states have (on average 1.4127764127764129) internal successors, (575), 407 states have internal predecessors, (575), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160)
[2025-03-08 13:17:43,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 895 transitions.
[2025-03-08 13:17:43,909 INFO  L78                 Accepts]: Start accepts. Automaton has 573 states and 895 transitions. Word has length 212
[2025-03-08 13:17:43,909 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:17:43,909 INFO  L471      AbstractCegarLoop]: Abstraction has 573 states and 895 transitions.
[2025-03-08 13:17:43,909 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:43,909 INFO  L276                IsEmpty]: Start isEmpty. Operand 573 states and 895 transitions.
[2025-03-08 13:17:43,911 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 214
[2025-03-08 13:17:43,913 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:17:43,914 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:43,914 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 13:17:43,914 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:17:43,914 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:17:43,914 INFO  L85        PathProgramCache]: Analyzing trace with hash -1507467373, now seen corresponding path program 1 times
[2025-03-08 13:17:43,914 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:17:43,915 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608829463]
[2025-03-08 13:17:43,915 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:43,915 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:17:43,939 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-03-08 13:17:43,962 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-03-08 13:17:43,962 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:43,962 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:44,179 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-03-08 13:17:44,180 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:17:44,180 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608829463]
[2025-03-08 13:17:44,180 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608829463] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:17:44,180 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:17:44,180 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 13:17:44,180 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89096664]
[2025-03-08 13:17:44,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:17:44,180 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 13:17:44,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:17:44,181 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 13:17:44,181 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 13:17:44,181 INFO  L87              Difference]: Start difference. First operand 573 states and 895 transitions. Second operand  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:44,502 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:17:44,502 INFO  L93              Difference]: Finished difference Result 1388 states and 2154 transitions.
[2025-03-08 13:17:44,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 13:17:44,505 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213
[2025-03-08 13:17:44,505 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:17:44,510 INFO  L225             Difference]: With dead ends: 1388
[2025-03-08 13:17:44,510 INFO  L226             Difference]: Without dead ends: 894
[2025-03-08 13:17:44,512 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 13:17:44,513 INFO  L435           NwaCegarLoop]: 198 mSDtfsCounter, 194 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 13:17:44,513 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 648 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 13:17:44,515 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 894 states.
[2025-03-08 13:17:44,581 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 806.
[2025-03-08 13:17:44,582 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 806 states, 574 states have (on average 1.411149825783972) internal successors, (810), 574 states have internal predecessors, (810), 224 states have call successors, (224), 7 states have call predecessors, (224), 7 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224)
[2025-03-08 13:17:44,585 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1258 transitions.
[2025-03-08 13:17:44,586 INFO  L78                 Accepts]: Start accepts. Automaton has 806 states and 1258 transitions. Word has length 213
[2025-03-08 13:17:44,586 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:17:44,587 INFO  L471      AbstractCegarLoop]: Abstraction has 806 states and 1258 transitions.
[2025-03-08 13:17:44,587 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:44,587 INFO  L276                IsEmpty]: Start isEmpty. Operand 806 states and 1258 transitions.
[2025-03-08 13:17:44,588 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 214
[2025-03-08 13:17:44,588 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:17:44,588 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:44,588 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 13:17:44,588 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:17:44,589 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:17:44,589 INFO  L85        PathProgramCache]: Analyzing trace with hash 749443634, now seen corresponding path program 1 times
[2025-03-08 13:17:44,589 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:17:44,589 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086947535]
[2025-03-08 13:17:44,589 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:44,589 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:17:44,605 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-03-08 13:17:44,616 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-03-08 13:17:44,616 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:44,616 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:44,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-03-08 13:17:44,837 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:17:44,837 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086947535]
[2025-03-08 13:17:44,837 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086947535] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:17:44,837 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:17:44,837 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 13:17:44,838 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776928579]
[2025-03-08 13:17:44,838 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:17:44,838 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 13:17:44,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:17:44,838 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 13:17:44,838 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 13:17:44,839 INFO  L87              Difference]: Start difference. First operand 806 states and 1258 transitions. Second operand  has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:45,002 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:17:45,003 INFO  L93              Difference]: Finished difference Result 1624 states and 2534 transitions.
[2025-03-08 13:17:45,003 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 13:17:45,003 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213
[2025-03-08 13:17:45,004 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:17:45,009 INFO  L225             Difference]: With dead ends: 1624
[2025-03-08 13:17:45,009 INFO  L226             Difference]: Without dead ends: 954
[2025-03-08 13:17:45,011 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 13:17:45,011 INFO  L435           NwaCegarLoop]: 166 mSDtfsCounter, 40 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 13:17:45,011 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 805 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 13:17:45,012 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 954 states.
[2025-03-08 13:17:45,070 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 884.
[2025-03-08 13:17:45,072 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 884 states, 652 states have (on average 1.406441717791411) internal successors, (917), 652 states have internal predecessors, (917), 224 states have call successors, (224), 7 states have call predecessors, (224), 7 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224)
[2025-03-08 13:17:45,076 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1365 transitions.
[2025-03-08 13:17:45,077 INFO  L78                 Accepts]: Start accepts. Automaton has 884 states and 1365 transitions. Word has length 213
[2025-03-08 13:17:45,077 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:17:45,078 INFO  L471      AbstractCegarLoop]: Abstraction has 884 states and 1365 transitions.
[2025-03-08 13:17:45,078 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:45,078 INFO  L276                IsEmpty]: Start isEmpty. Operand 884 states and 1365 transitions.
[2025-03-08 13:17:45,079 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 219
[2025-03-08 13:17:45,079 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:17:45,079 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:45,080 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 13:17:45,080 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:17:45,080 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:17:45,080 INFO  L85        PathProgramCache]: Analyzing trace with hash 298850070, now seen corresponding path program 1 times
[2025-03-08 13:17:45,080 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:17:45,080 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784344449]
[2025-03-08 13:17:45,080 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:45,080 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:17:45,095 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes.
[2025-03-08 13:17:45,162 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements.
[2025-03-08 13:17:45,162 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:45,162 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:45,274 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 60 proven. 33 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked.
[2025-03-08 13:17:45,275 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:17:45,275 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784344449]
[2025-03-08 13:17:45,275 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784344449] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 13:17:45,275 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999000238]
[2025-03-08 13:17:45,275 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:45,275 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 13:17:45,275 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 13:17:45,277 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 13:17:45,278 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-08 13:17:45,343 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes.
[2025-03-08 13:17:45,415 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements.
[2025-03-08 13:17:45,415 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:45,415 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:45,417 INFO  L256         TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-08 13:17:45,425 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 13:17:45,560 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 951 proven. 33 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked.
[2025-03-08 13:17:45,560 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 13:17:45,734 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 60 proven. 33 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked.
[2025-03-08 13:17:45,735 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [999000238] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 13:17:45,735 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 13:17:45,735 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8
[2025-03-08 13:17:45,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075707881]
[2025-03-08 13:17:45,735 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 13:17:45,735 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 13:17:45,735 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:17:45,736 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 13:17:45,736 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-03-08 13:17:45,736 INFO  L87              Difference]: Start difference. First operand 884 states and 1365 transitions. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55)
[2025-03-08 13:17:45,975 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:17:45,975 INFO  L93              Difference]: Finished difference Result 1747 states and 2667 transitions.
[2025-03-08 13:17:45,976 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 13:17:45,976 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 218
[2025-03-08 13:17:45,976 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:17:45,981 INFO  L225             Difference]: With dead ends: 1747
[2025-03-08 13:17:45,981 INFO  L226             Difference]: Without dead ends: 926
[2025-03-08 13:17:45,984 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110
[2025-03-08 13:17:45,984 INFO  L435           NwaCegarLoop]: 125 mSDtfsCounter, 215 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 13:17:45,984 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 312 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 13:17:45,985 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 926 states.
[2025-03-08 13:17:46,032 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 912.
[2025-03-08 13:17:46,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 912 states, 673 states have (on average 1.3521545319465083) internal successors, (910), 673 states have internal predecessors, (910), 224 states have call successors, (224), 14 states have call predecessors, (224), 14 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224)
[2025-03-08 13:17:46,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1358 transitions.
[2025-03-08 13:17:46,039 INFO  L78                 Accepts]: Start accepts. Automaton has 912 states and 1358 transitions. Word has length 218
[2025-03-08 13:17:46,039 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:17:46,039 INFO  L471      AbstractCegarLoop]: Abstraction has 912 states and 1358 transitions.
[2025-03-08 13:17:46,039 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55)
[2025-03-08 13:17:46,039 INFO  L276                IsEmpty]: Start isEmpty. Operand 912 states and 1358 transitions.
[2025-03-08 13:17:46,041 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 222
[2025-03-08 13:17:46,041 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:17:46,041 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:46,048 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-08 13:17:46,241 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,SelfDestructingSolverStorable9
[2025-03-08 13:17:46,242 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:17:46,242 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:17:46,242 INFO  L85        PathProgramCache]: Analyzing trace with hash -955220919, now seen corresponding path program 1 times
[2025-03-08 13:17:46,242 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:17:46,242 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268379405]
[2025-03-08 13:17:46,242 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:46,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:17:46,260 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes.
[2025-03-08 13:17:46,266 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements.
[2025-03-08 13:17:46,266 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:46,266 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:46,316 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-03-08 13:17:46,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:17:46,317 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268379405]
[2025-03-08 13:17:46,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268379405] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:17:46,317 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:17:46,317 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 13:17:46,317 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111521196]
[2025-03-08 13:17:46,317 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:17:46,317 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 13:17:46,318 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:17:46,318 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 13:17:46,318 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:17:46,318 INFO  L87              Difference]: Start difference. First operand 912 states and 1358 transitions. Second operand  has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:46,443 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:17:46,443 INFO  L93              Difference]: Finished difference Result 2466 states and 3651 transitions.
[2025-03-08 13:17:46,443 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 13:17:46,444 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 221
[2025-03-08 13:17:46,444 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:17:46,451 INFO  L225             Difference]: With dead ends: 2466
[2025-03-08 13:17:46,451 INFO  L226             Difference]: Without dead ends: 1626
[2025-03-08 13:17:46,453 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:17:46,454 INFO  L435           NwaCegarLoop]: 224 mSDtfsCounter, 137 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 13:17:46,454 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 373 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 13:17:46,455 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1626 states.
[2025-03-08 13:17:46,564 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1618.
[2025-03-08 13:17:46,566 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1618 states, 1234 states have (on average 1.3500810372771475) internal successors, (1666), 1240 states have internal predecessors, (1666), 356 states have call successors, (356), 27 states have call predecessors, (356), 27 states have return successors, (356), 350 states have call predecessors, (356), 356 states have call successors, (356)
[2025-03-08 13:17:46,572 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2378 transitions.
[2025-03-08 13:17:46,573 INFO  L78                 Accepts]: Start accepts. Automaton has 1618 states and 2378 transitions. Word has length 221
[2025-03-08 13:17:46,573 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:17:46,573 INFO  L471      AbstractCegarLoop]: Abstraction has 1618 states and 2378 transitions.
[2025-03-08 13:17:46,574 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:46,574 INFO  L276                IsEmpty]: Start isEmpty. Operand 1618 states and 2378 transitions.
[2025-03-08 13:17:46,575 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 222
[2025-03-08 13:17:46,575 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:17:46,575 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:46,575 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 13:17:46,575 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:17:46,576 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:17:46,576 INFO  L85        PathProgramCache]: Analyzing trace with hash -625455158, now seen corresponding path program 1 times
[2025-03-08 13:17:46,576 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:17:46,576 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279864480]
[2025-03-08 13:17:46,576 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:46,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:17:46,587 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes.
[2025-03-08 13:17:46,639 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements.
[2025-03-08 13:17:46,639 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:46,639 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:46,748 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 66 proven. 27 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked.
[2025-03-08 13:17:46,748 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:17:46,748 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279864480]
[2025-03-08 13:17:46,748 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279864480] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 13:17:46,749 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048485828]
[2025-03-08 13:17:46,749 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:46,749 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 13:17:46,749 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 13:17:46,751 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-08 13:17:46,755 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-08 13:17:46,816 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes.
[2025-03-08 13:17:46,882 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements.
[2025-03-08 13:17:46,882 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:46,883 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:46,885 INFO  L256         TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-08 13:17:46,890 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 13:17:46,987 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 867 proven. 27 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked.
[2025-03-08 13:17:46,987 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 13:17:47,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 66 proven. 27 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked.
[2025-03-08 13:17:47,138 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048485828] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 13:17:47,138 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 13:17:47,138 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8
[2025-03-08 13:17:47,138 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022530327]
[2025-03-08 13:17:47,138 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 13:17:47,139 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 13:17:47,139 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:17:47,139 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 13:17:47,139 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-03-08 13:17:47,139 INFO  L87              Difference]: Start difference. First operand 1618 states and 2378 transitions. Second operand  has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51)
[2025-03-08 13:17:47,417 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:17:47,418 INFO  L93              Difference]: Finished difference Result 2541 states and 3688 transitions.
[2025-03-08 13:17:47,418 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 13:17:47,418 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 221
[2025-03-08 13:17:47,420 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:17:47,426 INFO  L225             Difference]: With dead ends: 2541
[2025-03-08 13:17:47,427 INFO  L226             Difference]: Without dead ends: 996
[2025-03-08 13:17:47,431 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110
[2025-03-08 13:17:47,431 INFO  L435           NwaCegarLoop]: 122 mSDtfsCounter, 311 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 13:17:47,431 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 301 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 13:17:47,432 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 996 states.
[2025-03-08 13:17:47,485 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 968.
[2025-03-08 13:17:47,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 968 states, 715 states have (on average 1.302097902097902) internal successors, (931), 715 states have internal predecessors, (931), 224 states have call successors, (224), 28 states have call predecessors, (224), 28 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224)
[2025-03-08 13:17:47,490 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1379 transitions.
[2025-03-08 13:17:47,492 INFO  L78                 Accepts]: Start accepts. Automaton has 968 states and 1379 transitions. Word has length 221
[2025-03-08 13:17:47,492 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:17:47,492 INFO  L471      AbstractCegarLoop]: Abstraction has 968 states and 1379 transitions.
[2025-03-08 13:17:47,493 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51)
[2025-03-08 13:17:47,493 INFO  L276                IsEmpty]: Start isEmpty. Operand 968 states and 1379 transitions.
[2025-03-08 13:17:47,494 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 224
[2025-03-08 13:17:47,494 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:17:47,494 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:47,501 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-08 13:17:47,695 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 13:17:47,695 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:17:47,695 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:17:47,696 INFO  L85        PathProgramCache]: Analyzing trace with hash -882293300, now seen corresponding path program 1 times
[2025-03-08 13:17:47,696 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:17:47,696 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119672463]
[2025-03-08 13:17:47,696 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:47,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:17:47,709 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes.
[2025-03-08 13:17:47,719 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements.
[2025-03-08 13:17:47,722 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:47,722 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:47,779 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-03-08 13:17:47,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:17:47,780 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119672463]
[2025-03-08 13:17:47,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119672463] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:17:47,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:17:47,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 13:17:47,781 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789480002]
[2025-03-08 13:17:47,781 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:17:47,782 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 13:17:47,782 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:17:47,782 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 13:17:47,783 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:17:47,783 INFO  L87              Difference]: Start difference. First operand 968 states and 1379 transitions. Second operand  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:47,849 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:17:47,850 INFO  L93              Difference]: Finished difference Result 1862 states and 2660 transitions.
[2025-03-08 13:17:47,850 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 13:17:47,850 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 223
[2025-03-08 13:17:47,851 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:17:47,856 INFO  L225             Difference]: With dead ends: 1862
[2025-03-08 13:17:47,856 INFO  L226             Difference]: Without dead ends: 975
[2025-03-08 13:17:47,858 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:17:47,860 INFO  L435           NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 13:17:47,860 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 13:17:47,861 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 975 states.
[2025-03-08 13:17:47,910 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975.
[2025-03-08 13:17:47,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 975 states, 722 states have (on average 1.299168975069252) internal successors, (938), 722 states have internal predecessors, (938), 224 states have call successors, (224), 28 states have call predecessors, (224), 28 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224)
[2025-03-08 13:17:47,914 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1386 transitions.
[2025-03-08 13:17:47,916 INFO  L78                 Accepts]: Start accepts. Automaton has 975 states and 1386 transitions. Word has length 223
[2025-03-08 13:17:47,917 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:17:47,917 INFO  L471      AbstractCegarLoop]: Abstraction has 975 states and 1386 transitions.
[2025-03-08 13:17:47,917 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:47,917 INFO  L276                IsEmpty]: Start isEmpty. Operand 975 states and 1386 transitions.
[2025-03-08 13:17:47,919 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 224
[2025-03-08 13:17:47,919 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:17:47,920 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:47,920 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-08 13:17:47,921 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:17:47,921 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:17:47,921 INFO  L85        PathProgramCache]: Analyzing trace with hash 1402570155, now seen corresponding path program 1 times
[2025-03-08 13:17:47,921 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:17:47,921 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388802018]
[2025-03-08 13:17:47,921 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:47,922 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:17:47,930 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes.
[2025-03-08 13:17:47,986 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements.
[2025-03-08 13:17:47,986 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:47,986 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-08 13:17:47,989 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1824721532]
[2025-03-08 13:17:47,989 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:47,989 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 13:17:47,989 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 13:17:47,991 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-08 13:17:47,993 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-08 13:17:48,057 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes.
[2025-03-08 13:17:48,130 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements.
[2025-03-08 13:17:48,131 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:48,131 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:48,133 INFO  L256         TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-03-08 13:17:48,136 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 13:17:48,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 373 proven. 84 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked.
[2025-03-08 13:17:48,797 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 13:17:49,438 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:17:49,438 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388802018]
[2025-03-08 13:17:49,439 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2025-03-08 13:17:49,440 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824721532]
[2025-03-08 13:17:49,440 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824721532] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 13:17:49,440 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2025-03-08 13:17:49,440 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2025-03-08 13:17:49,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169369876]
[2025-03-08 13:17:49,440 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2025-03-08 13:17:49,440 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 13:17:49,440 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:17:49,441 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 13:17:49,441 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110
[2025-03-08 13:17:49,441 INFO  L87              Difference]: Start difference. First operand 975 states and 1386 transitions. Second operand  has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32)
[2025-03-08 13:17:50,050 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:17:50,050 INFO  L93              Difference]: Finished difference Result 2272 states and 3186 transitions.
[2025-03-08 13:17:50,051 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-08 13:17:50,051 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 223
[2025-03-08 13:17:50,051 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:17:50,059 INFO  L225             Difference]: With dead ends: 2272
[2025-03-08 13:17:50,059 INFO  L226             Difference]: Without dead ends: 1677
[2025-03-08 13:17:50,061 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306
[2025-03-08 13:17:50,062 INFO  L435           NwaCegarLoop]: 136 mSDtfsCounter, 174 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 13:17:50,062 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 642 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 13:17:50,064 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1677 states.
[2025-03-08 13:17:50,150 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1617.
[2025-03-08 13:17:50,152 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1617 states, 1200 states have (on average 1.2908333333333333) internal successors, (1549), 1204 states have internal predecessors, (1549), 360 states have call successors, (360), 56 states have call predecessors, (360), 56 states have return successors, (360), 356 states have call predecessors, (360), 360 states have call successors, (360)
[2025-03-08 13:17:50,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2269 transitions.
[2025-03-08 13:17:50,160 INFO  L78                 Accepts]: Start accepts. Automaton has 1617 states and 2269 transitions. Word has length 223
[2025-03-08 13:17:50,160 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:17:50,160 INFO  L471      AbstractCegarLoop]: Abstraction has 1617 states and 2269 transitions.
[2025-03-08 13:17:50,160 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32)
[2025-03-08 13:17:50,161 INFO  L276                IsEmpty]: Start isEmpty. Operand 1617 states and 2269 transitions.
[2025-03-08 13:17:50,162 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 224
[2025-03-08 13:17:50,163 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:17:50,163 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:50,171 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-03-08 13:17:50,363 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-08 13:17:50,364 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:17:50,364 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:17:50,365 INFO  L85        PathProgramCache]: Analyzing trace with hash -513805879, now seen corresponding path program 1 times
[2025-03-08 13:17:50,365 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:17:50,365 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422725667]
[2025-03-08 13:17:50,365 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:50,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:17:50,374 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes.
[2025-03-08 13:17:50,383 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements.
[2025-03-08 13:17:50,384 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:50,384 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:17:50,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-03-08 13:17:50,521 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 13:17:50,521 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422725667]
[2025-03-08 13:17:50,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422725667] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:17:50,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:17:50,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 13:17:50,522 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848669893]
[2025-03-08 13:17:50,522 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:17:50,522 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 13:17:50,523 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 13:17:50,523 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 13:17:50,523 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 13:17:50,523 INFO  L87              Difference]: Start difference. First operand 1617 states and 2269 transitions. Second operand  has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:50,688 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:17:50,688 INFO  L93              Difference]: Finished difference Result 2797 states and 3951 transitions.
[2025-03-08 13:17:50,689 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 13:17:50,689 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 223
[2025-03-08 13:17:50,689 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:17:50,699 INFO  L225             Difference]: With dead ends: 2797
[2025-03-08 13:17:50,699 INFO  L226             Difference]: Without dead ends: 2170
[2025-03-08 13:17:50,702 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-08 13:17:50,703 INFO  L435           NwaCegarLoop]: 166 mSDtfsCounter, 97 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 13:17:50,703 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 643 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 13:17:50,705 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2170 states.
[2025-03-08 13:17:50,790 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 1620.
[2025-03-08 13:17:50,792 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1620 states, 1203 states have (on average 1.290108063175395) internal successors, (1552), 1207 states have internal predecessors, (1552), 360 states have call successors, (360), 56 states have call predecessors, (360), 56 states have return successors, (360), 356 states have call predecessors, (360), 360 states have call successors, (360)
[2025-03-08 13:17:50,797 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2272 transitions.
[2025-03-08 13:17:50,800 INFO  L78                 Accepts]: Start accepts. Automaton has 1620 states and 2272 transitions. Word has length 223
[2025-03-08 13:17:50,800 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:17:50,800 INFO  L471      AbstractCegarLoop]: Abstraction has 1620 states and 2272 transitions.
[2025-03-08 13:17:50,801 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:17:50,801 INFO  L276                IsEmpty]: Start isEmpty. Operand 1620 states and 2272 transitions.
[2025-03-08 13:17:50,802 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 224
[2025-03-08 13:17:50,802 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:17:50,802 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:50,802 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-08 13:17:50,803 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:17:50,803 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:17:50,803 INFO  L85        PathProgramCache]: Analyzing trace with hash 993745930, now seen corresponding path program 1 times
[2025-03-08 13:17:50,804 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 13:17:50,804 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102445815]
[2025-03-08 13:17:50,804 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:50,804 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 13:17:50,813 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes.
[2025-03-08 13:17:50,863 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements.
[2025-03-08 13:17:50,863 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:50,863 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-08 13:17:50,865 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1764968628]
[2025-03-08 13:17:50,865 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:17:50,865 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 13:17:50,866 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 13:17:50,867 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 13:17:50,869 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-08 13:17:50,928 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes.
[2025-03-08 13:17:50,979 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements.
[2025-03-08 13:17:50,979 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:50,979 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 13:17:50,979 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-08 13:17:51,001 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes.
[2025-03-08 13:17:51,042 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements.
[2025-03-08 13:17:51,042 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:17:51,042 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 13:17:51,146 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-08 13:17:51,146 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-08 13:17:51,147 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-08 13:17:51,156 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-03-08 13:17:51,349 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-03-08 13:17:51,352 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:17:51,466 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 13:17:51,469 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:17:51 BoogieIcfgContainer
[2025-03-08 13:17:51,470 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 13:17:51,470 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 13:17:51,470 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 13:17:51,470 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 13:17:51,471 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:17:39" (3/4) ...
[2025-03-08 13:17:51,472 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-08 13:17:51,473 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 13:17:51,473 INFO  L158              Benchmark]: Toolchain (without parser) took 12682.43ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 121.8MB in the beginning and 147.9MB in the end (delta: -26.1MB). Peak memory consumption was 225.0MB. Max. memory is 16.1GB.
[2025-03-08 13:17:51,473 INFO  L158              Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 13:17:51,474 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 250.77ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 104.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-08 13:17:51,474 INFO  L158              Benchmark]: Boogie Procedure Inliner took 54.95ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 96.6MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 13:17:51,474 INFO  L158              Benchmark]: Boogie Preprocessor took 63.69ms. Allocated memory is still 167.8MB. Free memory was 96.6MB in the beginning and 84.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 13:17:51,474 INFO  L158              Benchmark]: IcfgBuilder took 598.89ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 38.6MB in the end (delta: 45.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
[2025-03-08 13:17:51,474 INFO  L158              Benchmark]: TraceAbstraction took 11705.80ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 37.9MB in the beginning and 148.0MB in the end (delta: -110.1MB). Peak memory consumption was 141.1MB. Max. memory is 16.1GB.
[2025-03-08 13:17:51,474 INFO  L158              Benchmark]: Witness Printer took 2.52ms. Allocated memory is still 419.4MB. Free memory was 148.0MB in the beginning and 147.9MB in the end (delta: 54.7kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 13:17:51,477 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.22ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 250.77ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 104.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 54.95ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 96.6MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 63.69ms. Allocated memory is still 167.8MB. Free memory was 96.6MB in the beginning and 84.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 598.89ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 38.6MB in the end (delta: 45.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
 * TraceAbstraction took 11705.80ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 37.9MB in the beginning and 148.0MB in the end (delta: -110.1MB). Peak memory consumption was 141.1MB. Max. memory is 16.1GB.
 * Witness Printer took 2.52ms. Allocated memory is still 419.4MB. Free memory was 148.0MB in the beginning and 147.9MB in the end (delta: 54.7kB). 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 someBinaryArithmeticDOUBLEoperation at line 111, overapproximation of bitwiseOr at line 187, overapproximation of bitwiseOr at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 143, overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 187. 
Possible FailurePath: 
[L21]                    unsigned char isInitial = 0;
[L22]                    signed long int var_1_1 = -4;
[L23]                    unsigned char var_1_3 = 64;
[L24]                    unsigned char var_1_4 = 0;
[L25]                    unsigned char var_1_5 = 2;
[L26]                    unsigned short int var_1_6 = 10;
[L27]                    double var_1_8 = 1.875;
[L28]                    signed long int var_1_9 = -4;
[L29]                    double var_1_10 = 63.5;
[L30]                    double var_1_11 = 255.375;
[L31]                    double var_1_12 = 999999999.525;
[L32]                    double var_1_13 = 63.75;
[L33]                    double var_1_14 = 0.625;
[L34]                    unsigned short int var_1_15 = 5;
[L35]                    signed char var_1_16 = 4;
[L36]                    signed char var_1_17 = 0;
[L37]                    signed char var_1_18 = -2;
[L38]                    signed char var_1_19 = 1;
[L39]                    unsigned short int var_1_20 = 50;
[L40]                    unsigned short int var_1_21 = 0;
[L41]                    unsigned char var_1_22 = 2;
[L42]                    unsigned char var_1_23 = 32;
[L43]                    unsigned short int var_1_24 = 8;
[L44]                    unsigned short int var_1_26 = 26914;
[L45]                    unsigned short int var_1_27 = 26182;
[L46]                    unsigned char var_1_28 = 5;
[L47]                    unsigned char var_1_29 = 50;
[L48]                    unsigned char var_1_30 = 10;
[L49]                    signed long int var_1_31 = -32;
[L50]                    unsigned char var_1_32 = 0;
[L51]                    unsigned char var_1_33 = 1;
[L52]                    unsigned char var_1_34 = 0;
[L53]                    signed long int var_1_35 = 1000000;
[L54]                    signed long int var_1_36 = 64;
[L55]                    unsigned char last_1_var_1_3 = 64;
[L56]                    unsigned short int last_1_var_1_6 = 10;
[L57]                    unsigned short int last_1_var_1_15 = 5;
[L58]                    unsigned short int last_1_var_1_20 = 50;
[L59]                    unsigned short int last_1_var_1_21 = 0;
             VAL         [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L191]                   isInitial = 1
[L192]       FCALL       initially()
[L193]       COND TRUE   1
[L194]       CALL        updateLastVariables()
[L180]                   last_1_var_1_3 = var_1_3
[L181]                   last_1_var_1_6 = var_1_6
[L182]                   last_1_var_1_15 = var_1_15
[L183]                   last_1_var_1_20 = var_1_20
[L184]                   last_1_var_1_21 = var_1_21
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L194]       RET         updateLastVariables()
[L195]       CALL        updateVariables()
[L128]                   var_1_4 = __VERIFIER_nondet_uchar()
[L129]       CALL        assume_abort_if_not(var_1_4 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L129]       RET         assume_abort_if_not(var_1_4 >= 0)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L130]       CALL        assume_abort_if_not(var_1_4 <= 254)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L130]       RET         assume_abort_if_not(var_1_4 <= 254)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L131]                   var_1_5 = __VERIFIER_nondet_uchar()
[L132]       CALL        assume_abort_if_not(var_1_5 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L132]       RET         assume_abort_if_not(var_1_5 >= 0)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L133]       CALL        assume_abort_if_not(var_1_5 <= 254)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L133]       RET         assume_abort_if_not(var_1_5 <= 254)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=-4]
[L134]                   var_1_9 = __VERIFIER_nondet_long()
[L135]       CALL        assume_abort_if_not(var_1_9 >= -2147483648)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L135]       RET         assume_abort_if_not(var_1_9 >= -2147483648)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L136]       CALL        assume_abort_if_not(var_1_9 <= 2147483647)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L136]       RET         assume_abort_if_not(var_1_9 <= 2147483647)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L137]       CALL        assume_abort_if_not(var_1_9 != 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L137]       RET         assume_abort_if_not(var_1_9 != 0)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L138]                   var_1_10 = __VERIFIER_nondet_double()
[L139]       CALL        assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L139]       RET         assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L140]                   var_1_11 = __VERIFIER_nondet_double()
[L141]       CALL        assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L141]       RET         assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L142]                   var_1_12 = __VERIFIER_nondet_double()
[L143]       CALL        assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L143]       RET         assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L144]                   var_1_13 = __VERIFIER_nondet_double()
[L145]       CALL        assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L145]       RET         assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L146]                   var_1_14 = __VERIFIER_nondet_double()
[L147]       CALL        assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L147]       RET         assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L148]                   var_1_17 = __VERIFIER_nondet_char()
[L149]       CALL        assume_abort_if_not(var_1_17 >= -63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L149]       RET         assume_abort_if_not(var_1_17 >= -63)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L150]       CALL        assume_abort_if_not(var_1_17 <= 63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L150]       RET         assume_abort_if_not(var_1_17 <= 63)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L151]                   var_1_18 = __VERIFIER_nondet_char()
[L152]       CALL        assume_abort_if_not(var_1_18 >= -31)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L152]       RET         assume_abort_if_not(var_1_18 >= -31)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L153]       CALL        assume_abort_if_not(var_1_18 <= 32)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L153]       RET         assume_abort_if_not(var_1_18 <= 32)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L154]                   var_1_19 = __VERIFIER_nondet_char()
[L155]       CALL        assume_abort_if_not(var_1_19 >= -31)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L155]       RET         assume_abort_if_not(var_1_19 >= -31)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L156]       CALL        assume_abort_if_not(var_1_19 <= 31)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L156]       RET         assume_abort_if_not(var_1_19 <= 31)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L157]                   var_1_23 = __VERIFIER_nondet_uchar()
[L158]       CALL        assume_abort_if_not(var_1_23 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L158]       RET         assume_abort_if_not(var_1_23 >= 0)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L159]       CALL        assume_abort_if_not(var_1_23 <= 254)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L159]       RET         assume_abort_if_not(var_1_23 <= 254)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L160]                   var_1_26 = __VERIFIER_nondet_ushort()
[L161]       CALL        assume_abort_if_not(var_1_26 >= 16383)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L161]       RET         assume_abort_if_not(var_1_26 >= 16383)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L162]       CALL        assume_abort_if_not(var_1_26 <= 32767)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L162]       RET         assume_abort_if_not(var_1_26 <= 32767)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L163]                   var_1_27 = __VERIFIER_nondet_ushort()
[L164]       CALL        assume_abort_if_not(var_1_27 >= 16384)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L164]       RET         assume_abort_if_not(var_1_27 >= 16384)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L165]       CALL        assume_abort_if_not(var_1_27 <= 32767)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L165]       RET         assume_abort_if_not(var_1_27 <= 32767)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L166]                   var_1_29 = __VERIFIER_nondet_uchar()
[L167]       CALL        assume_abort_if_not(var_1_29 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L167]       RET         assume_abort_if_not(var_1_29 >= 0)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L168]       CALL        assume_abort_if_not(var_1_29 <= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L168]       RET         assume_abort_if_not(var_1_29 <= 127)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L169]                   var_1_30 = __VERIFIER_nondet_uchar()
[L170]       CALL        assume_abort_if_not(var_1_30 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L170]       RET         assume_abort_if_not(var_1_30 >= 0)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L171]       CALL        assume_abort_if_not(var_1_30 <= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L171]       RET         assume_abort_if_not(var_1_30 <= 127)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L172]                   var_1_33 = __VERIFIER_nondet_uchar()
[L173]       CALL        assume_abort_if_not(var_1_33 >= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L173]       RET         assume_abort_if_not(var_1_33 >= 1)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L174]       CALL        assume_abort_if_not(var_1_33 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L174]       RET         assume_abort_if_not(var_1_33 <= 1)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L175]                   var_1_34 = __VERIFIER_nondet_uchar()
[L176]       CALL        assume_abort_if_not(var_1_34 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L176]       RET         assume_abort_if_not(var_1_34 >= 0)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L177]       CALL        assume_abort_if_not(var_1_34 <= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L177]       RET         assume_abort_if_not(var_1_34 <= 0)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L195]       RET         updateVariables()
[L196]       CALL        step()
[L63]                    var_1_22 = var_1_23
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L64]        COND TRUE   ((((var_1_6) < (var_1_23)) ? (var_1_6) : (var_1_23))) >= var_1_15
[L65]                    var_1_24 = ((var_1_26 + var_1_27) - var_1_23)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L67]        COND TRUE   var_1_27 > 0
[L68]                    var_1_28 = (((((((((var_1_29 + var_1_30)) > (var_1_23)) ? ((var_1_29 + var_1_30)) : (var_1_23)))) < (0)) ? ((((((var_1_29 + var_1_30)) > (var_1_23)) ? ((var_1_29 + var_1_30)) : (var_1_23)))) : (0)))
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L70]        COND TRUE   var_1_26 != 10
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L71]        COND FALSE  !(var_1_26 <= var_1_29)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L75]        COND TRUE   var_1_26 > 100
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L76]        EXPR        ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L76]        COND FALSE  !((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26) > var_1_21)
[L79]                    var_1_32 = var_1_34
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L82]                    var_1_35 = ((((var_1_26) > (((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) ? (var_1_26) : (((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L83]        COND FALSE  !(var_1_29 > var_1_30)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L90]        COND FALSE  !(var_1_16 >= var_1_6)
[L93]                    var_1_36 = var_1_23
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L96]                    signed long int stepLocal_0 = last_1_var_1_21;
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L97]        COND FALSE  !(last_1_var_1_6 < stepLocal_0)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L100]       EXPR        last_1_var_1_20 ^ last_1_var_1_15
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L100]                   signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15;
[L101]                   unsigned char stepLocal_1 = var_1_5;
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=-258, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L102]       COND FALSE  !(stepLocal_2 < -256)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=-258, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L105]       COND FALSE  !(stepLocal_1 <= 50)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L109]                   var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=264, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_8=15/8, var_1_9=189]
[L110]       COND TRUE   var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))
[L111]                   var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14))
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=-4, var_1_20=264, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_9=189]
[L117]                   var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))
[L118]                   var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))
[L119]                   unsigned short int stepLocal_3 = var_1_6;
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=1, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=1, var_1_20=264, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_9=189]
[L120]       EXPR        (var_1_3 * var_1_17) & (var_1_1 * var_1_18)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=1, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=1, var_1_20=264, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_9=189]
[L120]       COND FALSE  !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18)))
[L123]       COND TRUE   ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21
[L124]                   var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4))))
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=508, var_1_16=1, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=1, var_1_20=264, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_9=189]
[L196]       RET         step()
[L197]       CALL, EXPR  property()
[L187]       EXPR        ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=508, var_1_16=1, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=1, var_1_20=264, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_9=189]
[L187]       EXPR        last_1_var_1_20 ^ last_1_var_1_15
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=508, var_1_16=1, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=1, var_1_20=264, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_9=189]
[L187]       EXPR        ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=508, var_1_16=1, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=1, var_1_20=264, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_9=189]
[L187]       EXPR        (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=508, var_1_16=1, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=1, var_1_20=264, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_9=189]
[L187-L188]              return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1)
;
[L197]       RET, EXPR   property()
[L197]       CALL        __VERIFIER_assert(property())
[L19]        COND TRUE   !(cond)
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=508, var_1_16=1, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=1, var_1_20=264, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_9=189]
[L19]                    reach_error()
             VAL         [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=508, var_1_16=1, var_1_17=0, var_1_18=-30, var_1_19=31, var_1_1=1, var_1_20=264, var_1_21=0, var_1_22=-507, var_1_23=-507, var_1_24=32763, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=256, var_1_30=0, var_1_31=-32, var_1_32=-256, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=5, var_1_3=64, var_1_4=254, var_1_5=-258, var_1_6=10, var_1_9=189]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 117 locations, 216 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 16, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2173 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2127 mSDsluCounter, 7544 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4947 mSDsCounter, 652 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1699 IncrementalHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 652 mSolverCounterUnsat, 2597 mSDtfsCounter, 1699 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1445 GetRequests, 1370 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1620occurred in iteration=15, InterpolantAutomatonStates: 85, 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, 15 MinimizatonAttempts, 973 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 4547 NumberOfCodeBlocks, 4547 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4297 ConstructedInterpolants, 0 QuantifiedInterpolants, 10533 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2005 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 39354/39680 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2025-03-08 13:17:51,498 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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

### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.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 1380cfc36c62c1d753945810f92d4eba7bc79d804922edbd332f86c5fd94ebd5
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 13:17:53,388 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 13:17:53,487 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-08 13:17:53,491 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 13:17:53,492 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 13:17:53,510 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 13:17:53,511 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 13:17:53,512 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 13:17:53,512 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 13:17:53,512 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 13:17:53,513 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 13:17:53,513 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 13:17:53,513 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 13:17:53,513 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 13:17:53,513 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 13:17:53,513 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 13:17:53,513 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 13:17:53,513 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 13:17:53,513 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 13:17:53,513 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 13:17:53,513 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 13:17:53,513 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 13:17:53,514 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 13:17:53,514 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 13:17:53,514 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 13:17:53,515 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 13:17:53,515 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 13:17:53,515 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 -> 1380cfc36c62c1d753945810f92d4eba7bc79d804922edbd332f86c5fd94ebd5
[2025-03-08 13:17:53,776 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 13:17:53,781 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 13:17:53,783 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 13:17:53,783 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 13:17:53,784 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 13:17:53,784 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i
[2025-03-08 13:17:54,892 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6faff1b5/b2a5494d6ad9454cb0f251d642fc9e78/FLAG0428884d7
[2025-03-08 13:17:55,146 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 13:17:55,147 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i
[2025-03-08 13:17:55,155 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6faff1b5/b2a5494d6ad9454cb0f251d642fc9e78/FLAG0428884d7
[2025-03-08 13:17:55,172 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6faff1b5/b2a5494d6ad9454cb0f251d642fc9e78
[2025-03-08 13:17:55,174 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 13:17:55,175 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 13:17:55,177 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 13:17:55,178 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 13:17:55,181 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 13:17:55,182 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:17:55" (1/1) ...
[2025-03-08 13:17:55,183 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66050d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:55, skipping insertion in model container
[2025-03-08 13:17:55,183 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:17:55" (1/1) ...
[2025-03-08 13:17:55,199 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 13:17:55,313 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i[919,932]
[2025-03-08 13:17:55,370 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 13:17:55,385 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 13:17:55,394 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i[919,932]
[2025-03-08 13:17:55,419 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 13:17:55,433 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 13:17:55,433 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:55 WrapperNode
[2025-03-08 13:17:55,433 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 13:17:55,434 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 13:17:55,434 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 13:17:55,434 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 13:17:55,439 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:55" (1/1) ...
[2025-03-08 13:17:55,452 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:55" (1/1) ...
[2025-03-08 13:17:55,479 INFO  L138                Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201
[2025-03-08 13:17:55,479 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 13:17:55,480 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 13:17:55,480 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 13:17:55,480 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 13:17:55,486 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:55" (1/1) ...
[2025-03-08 13:17:55,486 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:55" (1/1) ...
[2025-03-08 13:17:55,489 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:55" (1/1) ...
[2025-03-08 13:17:55,500 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-08 13:17:55,500 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:55" (1/1) ...
[2025-03-08 13:17:55,501 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:55" (1/1) ...
[2025-03-08 13:17:55,514 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:55" (1/1) ...
[2025-03-08 13:17:55,515 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:55" (1/1) ...
[2025-03-08 13:17:55,517 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:55" (1/1) ...
[2025-03-08 13:17:55,518 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:55" (1/1) ...
[2025-03-08 13:17:55,522 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 13:17:55,526 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 13:17:55,526 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 13:17:55,526 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 13:17:55,527 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:55" (1/1) ...
[2025-03-08 13:17:55,532 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 13:17:55,542 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 13:17:55,554 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 13:17:55,560 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 13:17:55,575 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 13:17:55,575 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-08 13:17:55,575 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 13:17:55,575 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 13:17:55,575 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 13:17:55,575 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 13:17:55,645 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 13:17:55,647 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 13:18:03,623 INFO  L?                        ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2025-03-08 13:18:03,623 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 13:18:03,629 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 13:18:03,629 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 13:18:03,630 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:18:03 BoogieIcfgContainer
[2025-03-08 13:18:03,630 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 13:18:03,631 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 13:18:03,631 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 13:18:03,634 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 13:18:03,634 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:17:55" (1/3) ...
[2025-03-08 13:18:03,634 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b3d6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:18:03, skipping insertion in model container
[2025-03-08 13:18:03,634 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:55" (2/3) ...
[2025-03-08 13:18:03,634 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b3d6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:18:03, skipping insertion in model container
[2025-03-08 13:18:03,634 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:18:03" (3/3) ...
[2025-03-08 13:18:03,635 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i
[2025-03-08 13:18:03,644 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 13:18:03,646 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 13:18:03,682 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 13:18:03,689 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;@58da9203, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 13:18:03,690 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 13:18:03,692 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 89 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 55 states have internal predecessors, (74), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2025-03-08 13:18:03,703 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 204
[2025-03-08 13:18:03,703 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:18:03,703 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:18:03,704 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:18:03,708 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:18:03,708 INFO  L85        PathProgramCache]: Analyzing trace with hash 259297674, now seen corresponding path program 1 times
[2025-03-08 13:18:03,717 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 13:18:03,718 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204896076]
[2025-03-08 13:18:03,719 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:18:03,719 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 13:18:03,719 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 13:18:03,721 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 13:18:03,722 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2025-03-08 13:18:03,808 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes.
[2025-03-08 13:18:04,123 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements.
[2025-03-08 13:18:04,123 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:18:04,123 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:18:04,138 INFO  L256         TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 13:18:04,144 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 13:18:04,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked.
[2025-03-08 13:18:04,194 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 13:18:04,194 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 13:18:04,195 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204896076]
[2025-03-08 13:18:04,195 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [204896076] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:18:04,195 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:18:04,195 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 13:18:04,196 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779049692]
[2025-03-08 13:18:04,197 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:18:04,199 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 13:18:04,199 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 13:18:04,212 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 13:18:04,213 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 13:18:04,214 INFO  L87              Difference]: Start difference. First operand  has 89 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 55 states have internal predecessors, (74), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand  has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32)
[2025-03-08 13:18:04,232 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:18:04,232 INFO  L93              Difference]: Finished difference Result 172 states and 303 transitions.
[2025-03-08 13:18:04,233 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 13:18:04,233 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203
[2025-03-08 13:18:04,234 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:18:04,237 INFO  L225             Difference]: With dead ends: 172
[2025-03-08 13:18:04,238 INFO  L226             Difference]: Without dead ends: 86
[2025-03-08 13:18:04,243 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 13:18:04,245 INFO  L435           NwaCegarLoop]: 133 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, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 13:18:04,245 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 13:18:04,253 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2025-03-08 13:18:04,271 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86.
[2025-03-08 13:18:04,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 86 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2025-03-08 13:18:04,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions.
[2025-03-08 13:18:04,279 INFO  L78                 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 203
[2025-03-08 13:18:04,280 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:18:04,280 INFO  L471      AbstractCegarLoop]: Abstraction has 86 states and 133 transitions.
[2025-03-08 13:18:04,280 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32)
[2025-03-08 13:18:04,280 INFO  L276                IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions.
[2025-03-08 13:18:04,282 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 204
[2025-03-08 13:18:04,283 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:18:04,283 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:18:04,296 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2025-03-08 13:18:04,483 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 13:18:04,484 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:18:04,485 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:18:04,485 INFO  L85        PathProgramCache]: Analyzing trace with hash 1697862948, now seen corresponding path program 1 times
[2025-03-08 13:18:04,485 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 13:18:04,485 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113466131]
[2025-03-08 13:18:04,485 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:18:04,486 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 13:18:04,486 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 13:18:04,487 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 13:18:04,489 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2025-03-08 13:18:04,555 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes.
[2025-03-08 13:18:04,848 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements.
[2025-03-08 13:18:04,849 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:18:04,849 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:18:04,867 INFO  L256         TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-03-08 13:18:04,876 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 13:18:05,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 964 proven. 60 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked.
[2025-03-08 13:18:05,948 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 13:18:06,661 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 60 proven. 33 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked.
[2025-03-08 13:18:06,661 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 13:18:06,661 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113466131]
[2025-03-08 13:18:06,661 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [113466131] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 13:18:06,661 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-08 13:18:06,662 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11
[2025-03-08 13:18:06,662 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905847000]
[2025-03-08 13:18:06,662 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-08 13:18:06,663 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-08 13:18:06,663 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 13:18:06,664 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-08 13:18:06,664 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110
[2025-03-08 13:18:06,664 INFO  L87              Difference]: Start difference. First operand 86 states and 133 transitions. Second operand  has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 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-08 13:18:07,738 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:18:07,739 INFO  L93              Difference]: Finished difference Result 179 states and 271 transitions.
[2025-03-08 13:18:07,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-08 13:18:07,741 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 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 203
[2025-03-08 13:18:07,743 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:18:07,745 INFO  L225             Difference]: With dead ends: 179
[2025-03-08 13:18:07,745 INFO  L226             Difference]: Without dead ends: 96
[2025-03-08 13:18:07,746 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182
[2025-03-08 13:18:07,746 INFO  L435           NwaCegarLoop]: 89 mSDtfsCounter, 74 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 13:18:07,746 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 261 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 13:18:07,748 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2025-03-08 13:18:07,763 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94.
[2025-03-08 13:18:07,764 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 58 states have internal predecessors, (72), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2025-03-08 13:18:07,765 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions.
[2025-03-08 13:18:07,765 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 203
[2025-03-08 13:18:07,766 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:18:07,766 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 136 transitions.
[2025-03-08 13:18:07,766 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 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-08 13:18:07,766 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions.
[2025-03-08 13:18:07,768 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2025-03-08 13:18:07,769 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:18:07,769 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:18:07,781 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-08 13:18:07,969 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 13:18:07,970 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:18:07,970 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:18:07,970 INFO  L85        PathProgramCache]: Analyzing trace with hash 522959717, now seen corresponding path program 1 times
[2025-03-08 13:18:07,971 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 13:18:07,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058312920]
[2025-03-08 13:18:07,972 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:18:07,972 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 13:18:07,972 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 13:18:07,974 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 13:18:07,975 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2025-03-08 13:18:08,010 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes.
[2025-03-08 13:18:08,295 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements.
[2025-03-08 13:18:08,295 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:18:08,295 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:18:08,312 INFO  L256         TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-08 13:18:08,316 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 13:18:10,836 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-03-08 13:18:10,837 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 13:18:10,837 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 13:18:10,837 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058312920]
[2025-03-08 13:18:10,837 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058312920] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:18:10,837 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:18:10,837 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 13:18:10,837 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392692569]
[2025-03-08 13:18:10,837 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:18:10,837 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 13:18:10,837 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 13:18:10,838 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 13:18:10,838 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 13:18:10,838 INFO  L87              Difference]: Start difference. First operand 94 states and 136 transitions. Second operand  has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:18:15,435 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 13:18:19,639 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 13:18:21,178 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 13:18:25,330 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 13:18:25,331 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:18:25,331 INFO  L93              Difference]: Finished difference Result 289 states and 419 transitions.
[2025-03-08 13:18:25,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 13:18:25,359 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205
[2025-03-08 13:18:25,360 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:18:25,362 INFO  L225             Difference]: With dead ends: 289
[2025-03-08 13:18:25,362 INFO  L226             Difference]: Without dead ends: 198
[2025-03-08 13:18:25,363 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 13:18:25,363 INFO  L435           NwaCegarLoop]: 131 mSDtfsCounter, 91 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 65 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time
[2025-03-08 13:18:25,363 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 429 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 116 Invalid, 2 Unknown, 0 Unchecked, 14.4s Time]
[2025-03-08 13:18:25,364 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2025-03-08 13:18:25,395 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 183.
[2025-03-08 13:18:25,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 183 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 112 states have internal predecessors, (139), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64)
[2025-03-08 13:18:25,397 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 267 transitions.
[2025-03-08 13:18:25,398 INFO  L78                 Accepts]: Start accepts. Automaton has 183 states and 267 transitions. Word has length 205
[2025-03-08 13:18:25,399 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:18:25,399 INFO  L471      AbstractCegarLoop]: Abstraction has 183 states and 267 transitions.
[2025-03-08 13:18:25,399 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:18:25,400 INFO  L276                IsEmpty]: Start isEmpty. Operand 183 states and 267 transitions.
[2025-03-08 13:18:25,401 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2025-03-08 13:18:25,404 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:18:25,405 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:18:25,418 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2025-03-08 13:18:25,605 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 13:18:25,605 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:18:25,606 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:18:25,606 INFO  L85        PathProgramCache]: Analyzing trace with hash 652042436, now seen corresponding path program 1 times
[2025-03-08 13:18:25,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 13:18:25,606 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400627953]
[2025-03-08 13:18:25,607 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:18:25,607 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 13:18:25,607 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 13:18:25,610 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 13:18:25,611 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2025-03-08 13:18:25,644 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes.
[2025-03-08 13:18:25,915 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements.
[2025-03-08 13:18:25,916 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:18:25,916 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:18:25,930 INFO  L256         TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 13:18:25,933 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 13:18:25,990 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-03-08 13:18:25,990 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 13:18:25,991 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 13:18:25,991 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400627953]
[2025-03-08 13:18:25,991 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [400627953] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:18:25,991 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:18:25,991 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 13:18:25,991 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704560172]
[2025-03-08 13:18:25,991 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:18:25,991 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 13:18:25,992 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 13:18:25,992 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 13:18:25,992 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:18:25,992 INFO  L87              Difference]: Start difference. First operand 183 states and 267 transitions. Second operand  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:18:30,109 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2025-03-08 13:18:30,113 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:18:30,113 INFO  L93              Difference]: Finished difference Result 274 states and 400 transitions.
[2025-03-08 13:18:30,150 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 13:18:30,151 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205
[2025-03-08 13:18:30,151 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:18:30,152 INFO  L225             Difference]: With dead ends: 274
[2025-03-08 13:18:30,152 INFO  L226             Difference]: Without dead ends: 183
[2025-03-08 13:18:30,153 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 13:18:30,153 INFO  L435           NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time
[2025-03-08 13:18:30,154 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time]
[2025-03-08 13:18:30,158 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 183 states.
[2025-03-08 13:18:30,180 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183.
[2025-03-08 13:18:30,181 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 183 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 112 states have internal predecessors, (137), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64)
[2025-03-08 13:18:30,182 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 265 transitions.
[2025-03-08 13:18:30,183 INFO  L78                 Accepts]: Start accepts. Automaton has 183 states and 265 transitions. Word has length 205
[2025-03-08 13:18:30,183 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:18:30,183 INFO  L471      AbstractCegarLoop]: Abstraction has 183 states and 265 transitions.
[2025-03-08 13:18:30,183 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:18:30,183 INFO  L276                IsEmpty]: Start isEmpty. Operand 183 states and 265 transitions.
[2025-03-08 13:18:30,185 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-03-08 13:18:30,186 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:18:30,186 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:18:30,201 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0
[2025-03-08 13:18:30,386 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 13:18:30,387 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:18:30,387 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:18:30,387 INFO  L85        PathProgramCache]: Analyzing trace with hash -2109224250, now seen corresponding path program 1 times
[2025-03-08 13:18:30,388 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 13:18:30,388 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602418989]
[2025-03-08 13:18:30,389 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:18:30,389 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 13:18:30,389 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 13:18:30,392 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 13:18:30,393 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2025-03-08 13:18:30,431 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-03-08 13:18:30,736 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-03-08 13:18:30,736 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:18:30,736 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:18:30,754 INFO  L256         TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-08 13:18:30,758 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 13:18:33,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-03-08 13:18:33,820 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 13:18:33,820 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 13:18:33,820 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602418989]
[2025-03-08 13:18:33,820 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602418989] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:18:33,820 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 13:18:33,820 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 13:18:33,821 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068619403]
[2025-03-08 13:18:33,821 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:18:33,821 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 13:18:33,821 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 13:18:33,821 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 13:18:33,821 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 13:18:33,821 INFO  L87              Difference]: Start difference. First operand 183 states and 265 transitions. Second operand  has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:18:37,284 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 13:18:38,708 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 13:18:42,926 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 13:18:46,930 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 13:18:48,468 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 13:18:51,140 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 13:18:54,596 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 13:18:58,843 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 13:19:00,255 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 13:19:00,302 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 13:19:00,303 INFO  L93              Difference]: Finished difference Result 476 states and 686 transitions.
[2025-03-08 13:19:00,333 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 13:19:00,334 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206
[2025-03-08 13:19:00,334 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 13:19:00,337 INFO  L225             Difference]: With dead ends: 476
[2025-03-08 13:19:00,337 INFO  L226             Difference]: Without dead ends: 385
[2025-03-08 13:19:00,337 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-03-08 13:19:00,338 INFO  L435           NwaCegarLoop]: 218 mSDtfsCounter, 222 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 65 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.2s IncrementalHoareTripleChecker+Time
[2025-03-08 13:19:00,338 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 455 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 425 Invalid, 3 Unknown, 0 Unchecked, 26.2s Time]
[2025-03-08 13:19:00,338 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 385 states.
[2025-03-08 13:19:00,376 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 351.
[2025-03-08 13:19:00,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 351 states, 210 states have (on average 1.2095238095238094) internal successors, (254), 210 states have internal predecessors, (254), 128 states have call successors, (128), 12 states have call predecessors, (128), 12 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128)
[2025-03-08 13:19:00,378 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 510 transitions.
[2025-03-08 13:19:00,379 INFO  L78                 Accepts]: Start accepts. Automaton has 351 states and 510 transitions. Word has length 206
[2025-03-08 13:19:00,379 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 13:19:00,379 INFO  L471      AbstractCegarLoop]: Abstraction has 351 states and 510 transitions.
[2025-03-08 13:19:00,379 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)
[2025-03-08 13:19:00,379 INFO  L276                IsEmpty]: Start isEmpty. Operand 351 states and 510 transitions.
[2025-03-08 13:19:00,381 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-03-08 13:19:00,381 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 13:19:00,381 INFO  L218           NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 13:19:00,395 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0
[2025-03-08 13:19:00,581 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 13:19:00,582 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 13:19:00,583 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 13:19:00,583 INFO  L85        PathProgramCache]: Analyzing trace with hash -2080595099, now seen corresponding path program 1 times
[2025-03-08 13:19:00,583 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 13:19:00,583 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035044486]
[2025-03-08 13:19:00,583 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:19:00,583 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 13:19:00,583 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 13:19:00,585 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 13:19:00,586 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2025-03-08 13:19:00,614 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-03-08 13:19:01,508 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-03-08 13:19:01,509 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:19:01,509 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:19:01,525 INFO  L256         TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-03-08 13:19:01,528 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 13:19:03,609 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 643 proven. 75 refuted. 0 times theorem prover too weak. 1266 trivial. 0 not checked.
[2025-03-08 13:19:03,609 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 13:19:06,799 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 13:19:06,799 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035044486]
[2025-03-08 13:19:06,799 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035044486] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 13:19:06,799 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [980866003]
[2025-03-08 13:19:06,799 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 13:19:06,799 INFO  L173          SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2025-03-08 13:19:06,799 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4
[2025-03-08 13:19:06,815 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2025-03-08 13:19:06,816 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process
[2025-03-08 13:19:06,876 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-03-08 13:19:07,780 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-03-08 13:19:07,780 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 13:19:07,780 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 13:19:07,790 INFO  L256         TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-08 13:19:07,793 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 13:19:09,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2025-03-08 13:19:09,158 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 13:19:09,158 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleCvc4 [980866003] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 13:19:09,158 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 13:19:09,158 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9
[2025-03-08 13:19:09,158 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034464264]
[2025-03-08 13:19:09,158 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 13:19:09,158 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 13:19:09,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 13:19:09,159 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 13:19:09,159 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2025-03-08 13:19:09,159 INFO  L87              Difference]: Start difference. First operand 351 states and 510 transitions. Second operand  has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32)