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


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


Checking for ERROR reachability
Using default analysis
Version 3061b6dc
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.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 5ca8d44de1b038c40865b8a2cfc17e34a1f96999f82ad60fa9216aae98b3e84c
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m
[2024-11-18 19:19:50,261 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-18 19:19:50,339 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-18 19:19:50,343 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-18 19:19:50,346 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-18 19:19:50,375 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-18 19:19:50,375 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-18 19:19:50,376 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-18 19:19:50,376 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-18 19:19:50,377 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-18 19:19:50,377 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-18 19:19:50,377 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-18 19:19:50,379 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-18 19:19:50,382 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-18 19:19:50,383 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-18 19:19:50,383 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-18 19:19:50,383 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-18 19:19:50,383 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-18 19:19:50,384 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-18 19:19:50,384 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-18 19:19:50,384 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-18 19:19:50,385 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-18 19:19:50,387 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-18 19:19:50,387 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-18 19:19:50,387 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-18 19:19:50,388 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-18 19:19:50,388 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-18 19:19:50,388 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-18 19:19:50,388 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-18 19:19:50,389 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-18 19:19:50,389 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-18 19:19:50,389 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-18 19:19:50,389 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-18 19:19:50,390 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-18 19:19:50,390 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-18 19:19:50,391 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-18 19:19:50,391 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-18 19:19:50,391 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-18 19:19:50,392 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-18 19:19:50,392 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-18 19:19:50,393 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-18 19:19:50,393 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-18 19:19:50,393 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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 -> 5ca8d44de1b038c40865b8a2cfc17e34a1f96999f82ad60fa9216aae98b3e84c
[2024-11-18 19:19:50,624 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-18 19:19:50,649 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-18 19:19:50,653 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-18 19:19:50,654 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-18 19:19:50,655 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-18 19:19:50,656 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i
[2024-11-18 19:19:52,059 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-18 19:19:52,267 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-18 19:19:52,268 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i
[2024-11-18 19:19:52,279 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c0d36390/f715844c2d0b44e88b6327f24b3d8d86/FLAG021f70575
[2024-11-18 19:19:52,640 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c0d36390/f715844c2d0b44e88b6327f24b3d8d86
[2024-11-18 19:19:52,642 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-18 19:19:52,643 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-18 19:19:52,645 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-18 19:19:52,645 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-18 19:19:52,650 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-18 19:19:52,650 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:19:52" (1/1) ...
[2024-11-18 19:19:52,651 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bd54c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:19:52, skipping insertion in model container
[2024-11-18 19:19:52,651 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:19:52" (1/1) ...
[2024-11-18 19:19:52,687 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-18 19:19:52,861 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i[914,927]
[2024-11-18 19:19:52,934 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-18 19:19:52,948 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-18 19:19:52,960 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i[914,927]
[2024-11-18 19:19:52,995 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-18 19:19:53,014 INFO  L204         MainTranslator]: Completed translation
[2024-11-18 19:19:53,014 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:19:53 WrapperNode
[2024-11-18 19:19:53,015 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-18 19:19:53,016 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-18 19:19:53,016 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-18 19:19:53,016 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-18 19:19:53,023 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:19:53" (1/1) ...
[2024-11-18 19:19:53,034 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:19:53" (1/1) ...
[2024-11-18 19:19:53,079 INFO  L138                Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200
[2024-11-18 19:19:53,079 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-18 19:19:53,080 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-18 19:19:53,080 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-18 19:19:53,080 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-18 19:19:53,095 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:19:53" (1/1) ...
[2024-11-18 19:19:53,095 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:19:53" (1/1) ...
[2024-11-18 19:19:53,101 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:19:53" (1/1) ...
[2024-11-18 19:19:53,119 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].
[2024-11-18 19:19:53,120 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:19:53" (1/1) ...
[2024-11-18 19:19:53,120 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:19:53" (1/1) ...
[2024-11-18 19:19:53,139 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:19:53" (1/1) ...
[2024-11-18 19:19:53,147 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:19:53" (1/1) ...
[2024-11-18 19:19:53,157 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:19:53" (1/1) ...
[2024-11-18 19:19:53,159 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:19:53" (1/1) ...
[2024-11-18 19:19:53,166 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-18 19:19:53,168 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-18 19:19:53,168 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-18 19:19:53,168 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-18 19:19:53,169 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:19:53" (1/1) ...
[2024-11-18 19:19:53,175 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-18 19:19:53,186 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 19:19:53,201 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)
[2024-11-18 19:19:53,204 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
[2024-11-18 19:19:53,248 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-18 19:19:53,248 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-18 19:19:53,249 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-18 19:19:53,249 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-18 19:19:53,249 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-18 19:19:53,249 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-18 19:19:53,346 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-18 19:19:53,347 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-18 19:19:53,806 INFO  L?                        ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2024-11-18 19:19:53,807 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-18 19:19:53,822 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-18 19:19:53,823 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-18 19:19:53,823 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:19:53 BoogieIcfgContainer
[2024-11-18 19:19:53,823 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-18 19:19:53,825 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-18 19:19:53,826 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-18 19:19:53,829 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-18 19:19:53,829 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:19:52" (1/3) ...
[2024-11-18 19:19:53,830 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4e5c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:19:53, skipping insertion in model container
[2024-11-18 19:19:53,831 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:19:53" (2/3) ...
[2024-11-18 19:19:53,831 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4e5c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:19:53, skipping insertion in model container
[2024-11-18 19:19:53,832 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:19:53" (3/3) ...
[2024-11-18 19:19:53,833 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-3.i
[2024-11-18 19:19:53,847 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-18 19:19:53,847 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-18 19:19:53,904 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-18 19:19:53,911 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;@1042108e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-18 19:19:53,911 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-18 19:19:53,915 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 90 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-18 19:19:53,926 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2024-11-18 19:19:53,926 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 19:19:53,927 INFO  L215           NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 19:19:53,928 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 19:19:53,933 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 19:19:53,933 INFO  L85        PathProgramCache]: Analyzing trace with hash 258660729, now seen corresponding path program 1 times
[2024-11-18 19:19:53,941 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 19:19:53,942 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813364711]
[2024-11-18 19:19:53,942 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 19:19:53,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 19:19:54,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 19:19:54,734 INFO  L134       CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-18 19:19:54,734 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 19:19:54,734 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813364711]
[2024-11-18 19:19:54,735 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813364711] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 19:19:54,735 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 19:19:54,736 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-18 19:19:54,737 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339677038]
[2024-11-18 19:19:54,738 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 19:19:54,743 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 19:19:54,743 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 19:19:54,768 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 19:19:54,768 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 19:19:54,771 INFO  L87              Difference]: Start difference. First operand  has 90 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand  has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:19:54,948 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 19:19:54,948 INFO  L93              Difference]: Finished difference Result 256 states and 463 transitions.
[2024-11-18 19:19:54,951 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 19:19:54,952 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168
[2024-11-18 19:19:54,954 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 19:19:54,964 INFO  L225             Difference]: With dead ends: 256
[2024-11-18 19:19:54,965 INFO  L226             Difference]: Without dead ends: 169
[2024-11-18 19:19:54,970 INFO  L431           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
[2024-11-18 19:19:54,974 INFO  L432           NwaCegarLoop]: 144 mSDtfsCounter, 73 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-18 19:19:54,975 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 260 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-18 19:19:54,991 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 169 states.
[2024-11-18 19:19:55,046 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167.
[2024-11-18 19:19:55,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 167 states, 112 states have (on average 1.375) internal successors, (154), 112 states have internal predecessors, (154), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52)
[2024-11-18 19:19:55,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 258 transitions.
[2024-11-18 19:19:55,056 INFO  L78                 Accepts]: Start accepts. Automaton has 167 states and 258 transitions. Word has length 168
[2024-11-18 19:19:55,057 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 19:19:55,057 INFO  L471      AbstractCegarLoop]: Abstraction has 167 states and 258 transitions.
[2024-11-18 19:19:55,058 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:19:55,058 INFO  L276                IsEmpty]: Start isEmpty. Operand 167 states and 258 transitions.
[2024-11-18 19:19:55,062 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2024-11-18 19:19:55,063 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 19:19:55,064 INFO  L215           NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 19:19:55,064 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-18 19:19:55,065 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 19:19:55,065 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 19:19:55,066 INFO  L85        PathProgramCache]: Analyzing trace with hash -1495342298, now seen corresponding path program 1 times
[2024-11-18 19:19:55,066 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 19:19:55,066 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784421901]
[2024-11-18 19:19:55,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 19:19:55,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 19:19:55,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 19:19:55,211 INFO  L134       CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-18 19:19:55,215 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 19:19:55,215 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784421901]
[2024-11-18 19:19:55,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784421901] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 19:19:55,216 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 19:19:55,216 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-18 19:19:55,216 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963719293]
[2024-11-18 19:19:55,216 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 19:19:55,217 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 19:19:55,218 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 19:19:55,218 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 19:19:55,218 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 19:19:55,219 INFO  L87              Difference]: Start difference. First operand 167 states and 258 transitions. Second operand  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:19:55,300 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 19:19:55,300 INFO  L93              Difference]: Finished difference Result 395 states and 608 transitions.
[2024-11-18 19:19:55,301 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 19:19:55,301 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169
[2024-11-18 19:19:55,303 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 19:19:55,306 INFO  L225             Difference]: With dead ends: 395
[2024-11-18 19:19:55,308 INFO  L226             Difference]: Without dead ends: 231
[2024-11-18 19:19:55,309 INFO  L431           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
[2024-11-18 19:19:55,312 INFO  L432           NwaCegarLoop]: 168 mSDtfsCounter, 43 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-18 19:19:55,312 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 282 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-18 19:19:55,313 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 231 states.
[2024-11-18 19:19:55,335 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 185.
[2024-11-18 19:19:55,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 185 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52)
[2024-11-18 19:19:55,338 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 284 transitions.
[2024-11-18 19:19:55,338 INFO  L78                 Accepts]: Start accepts. Automaton has 185 states and 284 transitions. Word has length 169
[2024-11-18 19:19:55,339 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 19:19:55,339 INFO  L471      AbstractCegarLoop]: Abstraction has 185 states and 284 transitions.
[2024-11-18 19:19:55,339 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:19:55,339 INFO  L276                IsEmpty]: Start isEmpty. Operand 185 states and 284 transitions.
[2024-11-18 19:19:55,341 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2024-11-18 19:19:55,342 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 19:19:55,342 INFO  L215           NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 19:19:55,342 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-18 19:19:55,342 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 19:19:55,343 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 19:19:55,343 INFO  L85        PathProgramCache]: Analyzing trace with hash -201267960, now seen corresponding path program 1 times
[2024-11-18 19:19:55,343 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 19:19:55,343 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444465403]
[2024-11-18 19:19:55,344 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 19:19:55,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 19:19:55,381 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 19:19:55,484 INFO  L134       CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-18 19:19:55,486 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 19:19:55,486 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444465403]
[2024-11-18 19:19:55,487 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444465403] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 19:19:55,487 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 19:19:55,487 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-18 19:19:55,487 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884308699]
[2024-11-18 19:19:55,487 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 19:19:55,488 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 19:19:55,488 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 19:19:55,491 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 19:19:55,491 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 19:19:55,491 INFO  L87              Difference]: Start difference. First operand 185 states and 284 transitions. Second operand  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:19:55,597 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 19:19:55,599 INFO  L93              Difference]: Finished difference Result 541 states and 836 transitions.
[2024-11-18 19:19:55,599 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 19:19:55,599 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169
[2024-11-18 19:19:55,600 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 19:19:55,604 INFO  L225             Difference]: With dead ends: 541
[2024-11-18 19:19:55,605 INFO  L226             Difference]: Without dead ends: 359
[2024-11-18 19:19:55,607 INFO  L431           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
[2024-11-18 19:19:55,609 INFO  L432           NwaCegarLoop]: 239 mSDtfsCounter, 117 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-18 19:19:55,611 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 350 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-18 19:19:55,612 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 359 states.
[2024-11-18 19:19:55,658 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357.
[2024-11-18 19:19:55,660 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 357 states, 248 states have (on average 1.3709677419354838) internal successors, (340), 248 states have internal predecessors, (340), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104)
[2024-11-18 19:19:55,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 548 transitions.
[2024-11-18 19:19:55,666 INFO  L78                 Accepts]: Start accepts. Automaton has 357 states and 548 transitions. Word has length 169
[2024-11-18 19:19:55,667 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 19:19:55,667 INFO  L471      AbstractCegarLoop]: Abstraction has 357 states and 548 transitions.
[2024-11-18 19:19:55,667 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:19:55,667 INFO  L276                IsEmpty]: Start isEmpty. Operand 357 states and 548 transitions.
[2024-11-18 19:19:55,671 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2024-11-18 19:19:55,671 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 19:19:55,672 INFO  L215           NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 19:19:55,672 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-18 19:19:55,673 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 19:19:55,673 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 19:19:55,673 INFO  L85        PathProgramCache]: Analyzing trace with hash 1578036837, now seen corresponding path program 1 times
[2024-11-18 19:19:55,674 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 19:19:55,674 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361498791]
[2024-11-18 19:19:55,674 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 19:19:55,674 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 19:19:55,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 19:19:56,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-18 19:19:56,029 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 19:19:56,030 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361498791]
[2024-11-18 19:19:56,030 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361498791] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 19:19:56,030 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 19:19:56,030 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-18 19:19:56,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653834190]
[2024-11-18 19:19:56,030 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 19:19:56,031 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-18 19:19:56,031 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 19:19:56,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-18 19:19:56,033 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-18 19:19:56,033 INFO  L87              Difference]: Start difference. First operand 357 states and 548 transitions. Second operand  has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:19:56,316 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 19:19:56,316 INFO  L93              Difference]: Finished difference Result 893 states and 1374 transitions.
[2024-11-18 19:19:56,316 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-18 19:19:56,317 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170
[2024-11-18 19:19:56,317 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 19:19:56,323 INFO  L225             Difference]: With dead ends: 893
[2024-11-18 19:19:56,323 INFO  L226             Difference]: Without dead ends: 715
[2024-11-18 19:19:56,324 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-11-18 19:19:56,328 INFO  L432           NwaCegarLoop]: 137 mSDtfsCounter, 81 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-18 19:19:56,328 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 535 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-18 19:19:56,329 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 715 states.
[2024-11-18 19:19:56,388 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 707.
[2024-11-18 19:19:56,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 707 states, 490 states have (on average 1.3755102040816327) internal successors, (674), 490 states have internal predecessors, (674), 208 states have call successors, (208), 8 states have call predecessors, (208), 8 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208)
[2024-11-18 19:19:56,395 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1090 transitions.
[2024-11-18 19:19:56,396 INFO  L78                 Accepts]: Start accepts. Automaton has 707 states and 1090 transitions. Word has length 170
[2024-11-18 19:19:56,397 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 19:19:56,397 INFO  L471      AbstractCegarLoop]: Abstraction has 707 states and 1090 transitions.
[2024-11-18 19:19:56,397 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:19:56,397 INFO  L276                IsEmpty]: Start isEmpty. Operand 707 states and 1090 transitions.
[2024-11-18 19:19:56,400 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2024-11-18 19:19:56,400 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 19:19:56,400 INFO  L215           NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 19:19:56,400 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-18 19:19:56,400 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 19:19:56,401 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 19:19:56,401 INFO  L85        PathProgramCache]: Analyzing trace with hash -1284891267, now seen corresponding path program 1 times
[2024-11-18 19:19:56,402 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 19:19:56,402 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192559930]
[2024-11-18 19:19:56,402 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 19:19:56,402 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 19:19:56,437 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 19:19:56,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-18 19:19:56,631 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 19:19:56,631 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192559930]
[2024-11-18 19:19:56,631 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192559930] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 19:19:56,631 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 19:19:56,631 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-18 19:19:56,631 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747824430]
[2024-11-18 19:19:56,632 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 19:19:56,632 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-18 19:19:56,632 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 19:19:56,633 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-18 19:19:56,633 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 19:19:56,633 INFO  L87              Difference]: Start difference. First operand 707 states and 1090 transitions. Second operand  has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:19:56,743 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 19:19:56,743 INFO  L93              Difference]: Finished difference Result 1773 states and 2738 transitions.
[2024-11-18 19:19:56,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-18 19:19:56,744 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170
[2024-11-18 19:19:56,744 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 19:19:56,751 INFO  L225             Difference]: With dead ends: 1773
[2024-11-18 19:19:56,751 INFO  L226             Difference]: Without dead ends: 1069
[2024-11-18 19:19:56,754 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-18 19:19:56,755 INFO  L432           NwaCegarLoop]: 129 mSDtfsCounter, 74 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-18 19:19:56,756 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 238 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-18 19:19:56,757 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1069 states.
[2024-11-18 19:19:56,829 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1067.
[2024-11-18 19:19:56,832 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1067 states, 742 states have (on average 1.371967654986523) internal successors, (1018), 742 states have internal predecessors, (1018), 312 states have call successors, (312), 12 states have call predecessors, (312), 12 states have return successors, (312), 312 states have call predecessors, (312), 312 states have call successors, (312)
[2024-11-18 19:19:56,838 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1642 transitions.
[2024-11-18 19:19:56,840 INFO  L78                 Accepts]: Start accepts. Automaton has 1067 states and 1642 transitions. Word has length 170
[2024-11-18 19:19:56,841 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 19:19:56,842 INFO  L471      AbstractCegarLoop]: Abstraction has 1067 states and 1642 transitions.
[2024-11-18 19:19:56,842 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:19:56,842 INFO  L276                IsEmpty]: Start isEmpty. Operand 1067 states and 1642 transitions.
[2024-11-18 19:19:56,845 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2024-11-18 19:19:56,845 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 19:19:56,845 INFO  L215           NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 19:19:56,845 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-18 19:19:56,845 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 19:19:56,846 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 19:19:56,846 INFO  L85        PathProgramCache]: Analyzing trace with hash 303456635, now seen corresponding path program 1 times
[2024-11-18 19:19:56,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 19:19:56,846 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118965569]
[2024-11-18 19:19:56,847 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 19:19:56,847 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 19:19:56,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 19:19:58,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 1300 backedges. 75 proven. 69 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked.
[2024-11-18 19:19:58,271 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 19:19:58,271 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118965569]
[2024-11-18 19:19:58,271 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118965569] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-18 19:19:58,272 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559702529]
[2024-11-18 19:19:58,272 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 19:19:58,272 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 19:19:58,273 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 19:19:58,275 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)
[2024-11-18 19:19:58,276 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-18 19:19:58,566 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 19:19:58,570 INFO  L255         TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 23 conjuncts are in the unsatisfiable core
[2024-11-18 19:19:58,581 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 19:19:59,825 INFO  L134       CoverageAnalysis]: Checked inductivity of 1300 backedges. 832 proven. 153 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked.
[2024-11-18 19:19:59,825 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-18 19:20:01,404 INFO  L134       CoverageAnalysis]: Checked inductivity of 1300 backedges. 111 proven. 171 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked.
[2024-11-18 19:20:01,407 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559702529] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-18 19:20:01,407 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-18 19:20:01,408 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 32
[2024-11-18 19:20:01,408 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196423076]
[2024-11-18 19:20:01,408 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-18 19:20:01,409 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-11-18 19:20:01,410 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 19:20:01,411 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-11-18 19:20:01,411 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992
[2024-11-18 19:20:01,415 INFO  L87              Difference]: Start difference. First operand 1067 states and 1642 transitions. Second operand  has 32 states, 31 states have (on average 3.935483870967742) internal successors, (122), 30 states have internal predecessors, (122), 11 states have call successors, (64), 5 states have call predecessors, (64), 12 states have return successors, (66), 11 states have call predecessors, (66), 11 states have call successors, (66)
[2024-11-18 19:20:03,134 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 19:20:03,134 INFO  L93              Difference]: Finished difference Result 1835 states and 2668 transitions.
[2024-11-18 19:20:03,135 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2024-11-18 19:20:03,135 INFO  L78                 Accepts]: Start accepts. Automaton has  has 32 states, 31 states have (on average 3.935483870967742) internal successors, (122), 30 states have internal predecessors, (122), 11 states have call successors, (64), 5 states have call predecessors, (64), 12 states have return successors, (66), 11 states have call predecessors, (66), 11 states have call successors, (66) Word has length 170
[2024-11-18 19:20:03,135 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 19:20:03,143 INFO  L225             Difference]: With dead ends: 1835
[2024-11-18 19:20:03,143 INFO  L226             Difference]: Without dead ends: 1131
[2024-11-18 19:20:03,146 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=951, Invalid=2355, Unknown=0, NotChecked=0, Total=3306
[2024-11-18 19:20:03,148 INFO  L432           NwaCegarLoop]: 125 mSDtfsCounter, 468 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-18 19:20:03,149 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 649 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-18 19:20:03,150 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1131 states.
[2024-11-18 19:20:03,233 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 645.
[2024-11-18 19:20:03,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 645 states, 488 states have (on average 1.3360655737704918) internal successors, (652), 492 states have internal predecessors, (652), 128 states have call successors, (128), 28 states have call predecessors, (128), 28 states have return successors, (128), 124 states have call predecessors, (128), 128 states have call successors, (128)
[2024-11-18 19:20:03,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 908 transitions.
[2024-11-18 19:20:03,241 INFO  L78                 Accepts]: Start accepts. Automaton has 645 states and 908 transitions. Word has length 170
[2024-11-18 19:20:03,241 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 19:20:03,241 INFO  L471      AbstractCegarLoop]: Abstraction has 645 states and 908 transitions.
[2024-11-18 19:20:03,242 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 31 states have (on average 3.935483870967742) internal successors, (122), 30 states have internal predecessors, (122), 11 states have call successors, (64), 5 states have call predecessors, (64), 12 states have return successors, (66), 11 states have call predecessors, (66), 11 states have call successors, (66)
[2024-11-18 19:20:03,242 INFO  L276                IsEmpty]: Start isEmpty. Operand 645 states and 908 transitions.
[2024-11-18 19:20:03,244 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2024-11-18 19:20:03,244 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 19:20:03,244 INFO  L215           NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 19:20:03,264 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-18 19:20:03,448 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,SelfDestructingSolverStorable5
[2024-11-18 19:20:03,449 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 19:20:03,450 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 19:20:03,450 INFO  L85        PathProgramCache]: Analyzing trace with hash 1849413690, now seen corresponding path program 1 times
[2024-11-18 19:20:03,450 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 19:20:03,450 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286215250]
[2024-11-18 19:20:03,451 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 19:20:03,451 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 19:20:03,484 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 19:20:03,642 INFO  L134       CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-18 19:20:03,642 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 19:20:03,642 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286215250]
[2024-11-18 19:20:03,644 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286215250] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 19:20:03,644 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 19:20:03,644 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-18 19:20:03,645 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450615095]
[2024-11-18 19:20:03,645 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 19:20:03,645 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-18 19:20:03,645 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 19:20:03,646 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-18 19:20:03,646 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-18 19:20:03,646 INFO  L87              Difference]: Start difference. First operand 645 states and 908 transitions. Second operand  has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:20:04,009 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 19:20:04,009 INFO  L93              Difference]: Finished difference Result 1317 states and 1844 transitions.
[2024-11-18 19:20:04,010 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-18 19:20:04,010 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171
[2024-11-18 19:20:04,011 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 19:20:04,018 INFO  L225             Difference]: With dead ends: 1317
[2024-11-18 19:20:04,019 INFO  L226             Difference]: Without dead ends: 1155
[2024-11-18 19:20:04,021 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-18 19:20:04,022 INFO  L432           NwaCegarLoop]: 112 mSDtfsCounter, 130 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-18 19:20:04,022 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 332 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-18 19:20:04,023 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1155 states.
[2024-11-18 19:20:04,132 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 931.
[2024-11-18 19:20:04,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 931 states, 696 states have (on average 1.3189655172413792) internal successors, (918), 702 states have internal predecessors, (918), 192 states have call successors, (192), 42 states have call predecessors, (192), 42 states have return successors, (192), 186 states have call predecessors, (192), 192 states have call successors, (192)
[2024-11-18 19:20:04,137 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1302 transitions.
[2024-11-18 19:20:04,139 INFO  L78                 Accepts]: Start accepts. Automaton has 931 states and 1302 transitions. Word has length 171
[2024-11-18 19:20:04,139 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 19:20:04,140 INFO  L471      AbstractCegarLoop]: Abstraction has 931 states and 1302 transitions.
[2024-11-18 19:20:04,140 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:20:04,140 INFO  L276                IsEmpty]: Start isEmpty. Operand 931 states and 1302 transitions.
[2024-11-18 19:20:04,141 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2024-11-18 19:20:04,142 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 19:20:04,142 INFO  L215           NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 19:20:04,142 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-18 19:20:04,142 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 19:20:04,142 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 19:20:04,142 INFO  L85        PathProgramCache]: Analyzing trace with hash -1961017408, now seen corresponding path program 1 times
[2024-11-18 19:20:04,143 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 19:20:04,143 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475897243]
[2024-11-18 19:20:04,143 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 19:20:04,143 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 19:20:04,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 19:20:04,398 INFO  L134       CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-18 19:20:04,398 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 19:20:04,398 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475897243]
[2024-11-18 19:20:04,398 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475897243] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 19:20:04,399 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 19:20:04,399 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-18 19:20:04,399 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940134969]
[2024-11-18 19:20:04,399 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 19:20:04,400 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-18 19:20:04,400 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 19:20:04,400 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-18 19:20:04,401 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-18 19:20:04,401 INFO  L87              Difference]: Start difference. First operand 931 states and 1302 transitions. Second operand  has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:20:04,849 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 19:20:04,850 INFO  L93              Difference]: Finished difference Result 2026 states and 2848 transitions.
[2024-11-18 19:20:04,850 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-18 19:20:04,851 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171
[2024-11-18 19:20:04,851 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 19:20:04,860 INFO  L225             Difference]: With dead ends: 2026
[2024-11-18 19:20:04,860 INFO  L226             Difference]: Without dead ends: 1557
[2024-11-18 19:20:04,863 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-18 19:20:04,864 INFO  L432           NwaCegarLoop]: 110 mSDtfsCounter, 280 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-18 19:20:04,864 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 454 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-18 19:20:04,866 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1557 states.
[2024-11-18 19:20:05,072 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1434.
[2024-11-18 19:20:05,075 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1434 states, 1071 states have (on average 1.323062558356676) internal successors, (1417), 1077 states have internal predecessors, (1417), 296 states have call successors, (296), 66 states have call predecessors, (296), 66 states have return successors, (296), 290 states have call predecessors, (296), 296 states have call successors, (296)
[2024-11-18 19:20:05,081 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2009 transitions.
[2024-11-18 19:20:05,083 INFO  L78                 Accepts]: Start accepts. Automaton has 1434 states and 2009 transitions. Word has length 171
[2024-11-18 19:20:05,084 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 19:20:05,084 INFO  L471      AbstractCegarLoop]: Abstraction has 1434 states and 2009 transitions.
[2024-11-18 19:20:05,085 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:20:05,085 INFO  L276                IsEmpty]: Start isEmpty. Operand 1434 states and 2009 transitions.
[2024-11-18 19:20:05,086 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2024-11-18 19:20:05,087 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 19:20:05,087 INFO  L215           NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 19:20:05,087 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-18 19:20:05,087 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 19:20:05,088 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 19:20:05,088 INFO  L85        PathProgramCache]: Analyzing trace with hash 553671883, now seen corresponding path program 1 times
[2024-11-18 19:20:05,088 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 19:20:05,088 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740697003]
[2024-11-18 19:20:05,088 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 19:20:05,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 19:20:05,129 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 19:20:05,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-18 19:20:05,430 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 19:20:05,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740697003]
[2024-11-18 19:20:05,431 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740697003] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 19:20:05,431 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 19:20:05,431 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-18 19:20:05,431 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019171696]
[2024-11-18 19:20:05,431 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 19:20:05,432 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-18 19:20:05,432 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 19:20:05,433 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-18 19:20:05,433 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-18 19:20:05,433 INFO  L87              Difference]: Start difference. First operand 1434 states and 2009 transitions. Second operand  has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-18 19:20:06,210 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 19:20:06,211 INFO  L93              Difference]: Finished difference Result 3224 states and 4515 transitions.
[2024-11-18 19:20:06,211 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-18 19:20:06,211 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171
[2024-11-18 19:20:06,212 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 19:20:06,222 INFO  L225             Difference]: With dead ends: 3224
[2024-11-18 19:20:06,222 INFO  L226             Difference]: Without dead ends: 1793
[2024-11-18 19:20:06,226 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182
[2024-11-18 19:20:06,227 INFO  L432           NwaCegarLoop]: 109 mSDtfsCounter, 407 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-18 19:20:06,227 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 567 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-18 19:20:06,229 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1793 states.
[2024-11-18 19:20:06,485 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1773.
[2024-11-18 19:20:06,489 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1773 states, 1332 states have (on average 1.3243243243243243) internal successors, (1764), 1340 states have internal predecessors, (1764), 360 states have call successors, (360), 80 states have call predecessors, (360), 80 states have return successors, (360), 352 states have call predecessors, (360), 360 states have call successors, (360)
[2024-11-18 19:20:06,496 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2484 transitions.
[2024-11-18 19:20:06,499 INFO  L78                 Accepts]: Start accepts. Automaton has 1773 states and 2484 transitions. Word has length 171
[2024-11-18 19:20:06,499 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 19:20:06,500 INFO  L471      AbstractCegarLoop]: Abstraction has 1773 states and 2484 transitions.
[2024-11-18 19:20:06,500 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-18 19:20:06,500 INFO  L276                IsEmpty]: Start isEmpty. Operand 1773 states and 2484 transitions.
[2024-11-18 19:20:06,502 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2024-11-18 19:20:06,502 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 19:20:06,502 INFO  L215           NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 19:20:06,502 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-18 19:20:06,502 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 19:20:06,503 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 19:20:06,503 INFO  L85        PathProgramCache]: Analyzing trace with hash -1116405686, now seen corresponding path program 1 times
[2024-11-18 19:20:06,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 19:20:06,503 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443594187]
[2024-11-18 19:20:06,503 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 19:20:06,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 19:20:06,535 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 19:20:07,241 INFO  L134       CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-18 19:20:07,242 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 19:20:07,242 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443594187]
[2024-11-18 19:20:07,242 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443594187] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 19:20:07,242 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 19:20:07,243 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-18 19:20:07,243 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370685264]
[2024-11-18 19:20:07,243 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 19:20:07,243 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-18 19:20:07,244 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 19:20:07,244 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-18 19:20:07,244 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-11-18 19:20:07,245 INFO  L87              Difference]: Start difference. First operand 1773 states and 2484 transitions. Second operand  has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:20:08,010 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 19:20:08,011 INFO  L93              Difference]: Finished difference Result 2969 states and 4155 transitions.
[2024-11-18 19:20:08,012 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-18 19:20:08,012 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172
[2024-11-18 19:20:08,012 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 19:20:08,024 INFO  L225             Difference]: With dead ends: 2969
[2024-11-18 19:20:08,025 INFO  L226             Difference]: Without dead ends: 2031
[2024-11-18 19:20:08,028 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-11-18 19:20:08,029 INFO  L432           NwaCegarLoop]: 136 mSDtfsCounter, 278 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-18 19:20:08,030 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 488 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-18 19:20:08,032 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2031 states.
[2024-11-18 19:20:08,327 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 1875.
[2024-11-18 19:20:08,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1875 states, 1434 states have (on average 1.3284518828451883) internal successors, (1905), 1442 states have internal predecessors, (1905), 360 states have call successors, (360), 80 states have call predecessors, (360), 80 states have return successors, (360), 352 states have call predecessors, (360), 360 states have call successors, (360)
[2024-11-18 19:20:08,338 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2625 transitions.
[2024-11-18 19:20:08,340 INFO  L78                 Accepts]: Start accepts. Automaton has 1875 states and 2625 transitions. Word has length 172
[2024-11-18 19:20:08,342 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 19:20:08,342 INFO  L471      AbstractCegarLoop]: Abstraction has 1875 states and 2625 transitions.
[2024-11-18 19:20:08,343 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:20:08,343 INFO  L276                IsEmpty]: Start isEmpty. Operand 1875 states and 2625 transitions.
[2024-11-18 19:20:08,344 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2024-11-18 19:20:08,344 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 19:20:08,346 INFO  L215           NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 19:20:08,346 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-18 19:20:08,347 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 19:20:08,347 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 19:20:08,347 INFO  L85        PathProgramCache]: Analyzing trace with hash 2095293310, now seen corresponding path program 1 times
[2024-11-18 19:20:08,347 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 19:20:08,348 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610165253]
[2024-11-18 19:20:08,348 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 19:20:08,348 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 19:20:08,376 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 19:20:08,647 INFO  L134       CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-18 19:20:08,647 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 19:20:08,648 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610165253]
[2024-11-18 19:20:08,648 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610165253] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 19:20:08,648 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 19:20:08,648 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-18 19:20:08,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925033050]
[2024-11-18 19:20:08,648 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 19:20:08,649 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-18 19:20:08,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 19:20:08,650 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-18 19:20:08,650 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-11-18 19:20:08,650 INFO  L87              Difference]: Start difference. First operand 1875 states and 2625 transitions. Second operand  has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-18 19:20:09,544 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 19:20:09,545 INFO  L93              Difference]: Finished difference Result 3683 states and 5144 transitions.
[2024-11-18 19:20:09,545 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-18 19:20:09,546 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172
[2024-11-18 19:20:09,546 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 19:20:09,563 INFO  L225             Difference]: With dead ends: 3683
[2024-11-18 19:20:09,563 INFO  L226             Difference]: Without dead ends: 2770
[2024-11-18 19:20:09,568 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132
[2024-11-18 19:20:09,569 INFO  L432           NwaCegarLoop]: 109 mSDtfsCounter, 333 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-18 19:20:09,569 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 599 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-18 19:20:09,572 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2770 states.
[2024-11-18 19:20:09,951 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2760.
[2024-11-18 19:20:09,957 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2760 states, 2099 states have (on average 1.3211052882324916) internal successors, (2773), 2111 states have internal predecessors, (2773), 540 states have call successors, (540), 120 states have call predecessors, (540), 120 states have return successors, (540), 528 states have call predecessors, (540), 540 states have call successors, (540)
[2024-11-18 19:20:09,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 3853 transitions.
[2024-11-18 19:20:09,972 INFO  L78                 Accepts]: Start accepts. Automaton has 2760 states and 3853 transitions. Word has length 172
[2024-11-18 19:20:09,973 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 19:20:09,973 INFO  L471      AbstractCegarLoop]: Abstraction has 2760 states and 3853 transitions.
[2024-11-18 19:20:09,973 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-18 19:20:09,973 INFO  L276                IsEmpty]: Start isEmpty. Operand 2760 states and 3853 transitions.
[2024-11-18 19:20:09,975 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2024-11-18 19:20:09,975 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 19:20:09,976 INFO  L215           NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 19:20:09,976 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-18 19:20:09,976 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 19:20:09,976 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 19:20:09,977 INFO  L85        PathProgramCache]: Analyzing trace with hash 643407386, now seen corresponding path program 1 times
[2024-11-18 19:20:09,977 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 19:20:09,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102501595]
[2024-11-18 19:20:09,977 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 19:20:09,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 19:20:10,033 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-18 19:20:10,038 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1117738304]
[2024-11-18 19:20:10,038 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 19:20:10,038 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 19:20:10,038 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 19:20:10,040 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)
[2024-11-18 19:20:10,042 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-18 19:20:10,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-18 19:20:10,174 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-18 19:20:10,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-18 19:20:10,354 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-18 19:20:10,355 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-18 19:20:10,356 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-18 19:20:10,377 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-18 19:20:10,562 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,SelfDestructingSolverStorable11
[2024-11-18 19:20:10,567 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 19:20:10,708 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-18 19:20:10,712 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:20:10 BoogieIcfgContainer
[2024-11-18 19:20:10,713 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-18 19:20:10,714 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-18 19:20:10,714 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-18 19:20:10,714 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-18 19:20:10,715 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:19:53" (3/4) ...
[2024-11-18 19:20:10,717 INFO  L145         WitnessPrinter]: No result that supports witness generation found
[2024-11-18 19:20:10,718 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-18 19:20:10,719 INFO  L158              Benchmark]: Toolchain (without parser) took 18075.78ms. Allocated memory was 163.6MB in the beginning and 505.4MB in the end (delta: 341.8MB). Free memory was 91.9MB in the beginning and 306.0MB in the end (delta: -214.1MB). Peak memory consumption was 129.6MB. Max. memory is 16.1GB.
[2024-11-18 19:20:10,719 INFO  L158              Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-18 19:20:10,719 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 370.60ms. Allocated memory is still 163.6MB. Free memory was 91.5MB in the beginning and 75.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-18 19:20:10,720 INFO  L158              Benchmark]: Boogie Procedure Inliner took 63.62ms. Allocated memory is still 163.6MB. Free memory was 75.5MB in the beginning and 71.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-18 19:20:10,720 INFO  L158              Benchmark]: Boogie Preprocessor took 86.65ms. Allocated memory is still 163.6MB. Free memory was 71.3MB in the beginning and 65.7MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-18 19:20:10,721 INFO  L158              Benchmark]: RCFGBuilder took 655.18ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 65.7MB in the beginning and 174.0MB in the end (delta: -108.3MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB.
[2024-11-18 19:20:10,721 INFO  L158              Benchmark]: TraceAbstraction took 16887.76ms. Allocated memory was 222.3MB in the beginning and 505.4MB in the end (delta: 283.1MB). Free memory was 174.0MB in the beginning and 306.0MB in the end (delta: -132.0MB). Peak memory consumption was 152.2MB. Max. memory is 16.1GB.
[2024-11-18 19:20:10,721 INFO  L158              Benchmark]: Witness Printer took 4.84ms. Allocated memory is still 505.4MB. Free memory is still 306.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-18 19:20:10,723 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 370.60ms. Allocated memory is still 163.6MB. Free memory was 91.5MB in the beginning and 75.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 63.62ms. Allocated memory is still 163.6MB. Free memory was 75.5MB in the beginning and 71.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 86.65ms. Allocated memory is still 163.6MB. Free memory was 71.3MB in the beginning and 65.7MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 655.18ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 65.7MB in the beginning and 174.0MB in the end (delta: -108.3MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 16887.76ms. Allocated memory was 222.3MB in the beginning and 505.4MB in the end (delta: 283.1MB). Free memory was 174.0MB in the beginning and 306.0MB in the end (delta: -132.0MB). Peak memory consumption was 152.2MB. Max. memory is 16.1GB.
 * Witness Printer took 4.84ms. Allocated memory is still 505.4MB. Free memory is still 306.0MB. 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 someBinaryDOUBLEComparisonOperation at line 158, overapproximation of bitwiseOr at line 104. 
Possible FailurePath: 
[L21]                    unsigned char isInitial = 0;
[L22]                    signed char var_1_1 = -64;
[L23]                    unsigned char var_1_3 = 1;
[L24]                    signed char var_1_5 = -32;
[L25]                    unsigned short int var_1_6 = 256;
[L26]                    unsigned long int var_1_10 = 256;
[L27]                    double var_1_12 = 8.2;
[L28]                    signed char var_1_13 = 16;
[L29]                    signed char var_1_14 = 10;
[L30]                    double var_1_15 = 199.125;
[L31]                    double var_1_16 = 9.4;
[L32]                    double var_1_17 = 9999999999999.6;
[L33]                    unsigned char var_1_20 = 32;
[L34]                    unsigned char var_1_21 = 128;
[L35]                    unsigned char var_1_22 = 64;
[L36]                    unsigned long int var_1_23 = 64;
[L37]                    unsigned long int var_1_24 = 5;
[L38]                    unsigned long int var_1_25 = 4;
[L39]                    unsigned short int var_1_26 = 2;
[L40]                    unsigned short int var_1_27 = 100;
[L41]                    signed char var_1_28 = 32;
[L42]                    double var_1_29 = 16.25;
[L43]                    double var_1_30 = 15.75;
[L44]                    unsigned char var_1_31 = 0;
[L45]                    unsigned char var_1_32 = 0;
[L46]                    unsigned char var_1_33 = 0;
[L47]                    unsigned char var_1_34 = 0;
[L48]                    float var_1_35 = 7.25;
[L49]                    float var_1_36 = 1.75;
[L50]                    signed long int var_1_37 = 0;
[L51]                    unsigned long int last_1_var_1_10 = 256;
[L52]                    unsigned char last_1_var_1_20 = 32;
             VAL         [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=1, var_1_5=-32, var_1_6=256]
[L162]                   isInitial = 1
[L163]       FCALL       initially()
[L164]       COND TRUE   1
[L165]       CALL        updateLastVariables()
[L154]                   last_1_var_1_10 = var_1_10
[L155]                   last_1_var_1_20 = var_1_20
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=1, var_1_5=-32, var_1_6=256]
[L165]       RET         updateLastVariables()
[L166]       CALL        updateVariables()
[L112]                   var_1_3 = __VERIFIER_nondet_uchar()
[L113]       CALL        assume_abort_if_not(var_1_3 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_5=-32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_5=-32, var_1_6=256]
[L113]       RET         assume_abort_if_not(var_1_3 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_5=-32, var_1_6=256]
[L114]       CALL        assume_abort_if_not(var_1_3 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-32, var_1_6=256]
[L114]       RET         assume_abort_if_not(var_1_3 <= 1)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=-32, var_1_6=256]
[L115]                   var_1_5 = __VERIFIER_nondet_char()
[L116]       CALL        assume_abort_if_not(var_1_5 >= -127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L116]       RET         assume_abort_if_not(var_1_5 >= -127)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L117]       CALL        assume_abort_if_not(var_1_5 <= 126)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L117]       RET         assume_abort_if_not(var_1_5 <= 126)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L118]                   var_1_13 = __VERIFIER_nondet_char()
[L119]       CALL        assume_abort_if_not(var_1_13 >= -1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L119]       RET         assume_abort_if_not(var_1_13 >= -1)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L120]       CALL        assume_abort_if_not(var_1_13 <= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L120]       RET         assume_abort_if_not(var_1_13 <= 127)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L121]                   var_1_14 = __VERIFIER_nondet_char()
[L122]       CALL        assume_abort_if_not(var_1_14 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L122]       RET         assume_abort_if_not(var_1_14 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L123]       CALL        assume_abort_if_not(var_1_14 <= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L123]       RET         assume_abort_if_not(var_1_14 <= 127)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L124]                   var_1_15 = __VERIFIER_nondet_double()
[L125]       CALL        assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L125]       RET         assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L126]       CALL        assume_abort_if_not(var_1_15 != 0.0F)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L126]       RET         assume_abort_if_not(var_1_15 != 0.0F)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L127]                   var_1_16 = __VERIFIER_nondet_double()
[L128]       CALL        assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L128]       RET         assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L129]                   var_1_21 = __VERIFIER_nondet_uchar()
[L130]       CALL        assume_abort_if_not(var_1_21 >= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L130]       RET         assume_abort_if_not(var_1_21 >= 127)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L131]       CALL        assume_abort_if_not(var_1_21 <= 254)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L131]       RET         assume_abort_if_not(var_1_21 <= 254)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L132]                   var_1_22 = __VERIFIER_nondet_uchar()
[L133]       CALL        assume_abort_if_not(var_1_22 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L133]       RET         assume_abort_if_not(var_1_22 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L134]       CALL        assume_abort_if_not(var_1_22 <= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L134]       RET         assume_abort_if_not(var_1_22 <= 127)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=4, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L135]                   var_1_25 = __VERIFIER_nondet_ulong()
[L136]       CALL        assume_abort_if_not(var_1_25 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L136]       RET         assume_abort_if_not(var_1_25 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L137]       CALL        assume_abort_if_not(var_1_25 <= 4294967294)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L137]       RET         assume_abort_if_not(var_1_25 <= 4294967294)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=100, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L138]                   var_1_27 = __VERIFIER_nondet_ushort()
[L139]       CALL        assume_abort_if_not(var_1_27 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L139]       RET         assume_abort_if_not(var_1_27 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L140]       CALL        assume_abort_if_not(var_1_27 <= 65534)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L140]       RET         assume_abort_if_not(var_1_27 <= 65534)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_30=63/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L141]                   var_1_30 = __VERIFIER_nondet_double()
[L142]       CALL        assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L142]       RET         assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L143]                   var_1_32 = __VERIFIER_nondet_uchar()
[L144]       CALL        assume_abort_if_not(var_1_32 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L144]       RET         assume_abort_if_not(var_1_32 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L145]       CALL        assume_abort_if_not(var_1_32 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L145]       RET         assume_abort_if_not(var_1_32 <= 1)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L146]                   var_1_33 = __VERIFIER_nondet_uchar()
[L147]       CALL        assume_abort_if_not(var_1_33 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L147]       RET         assume_abort_if_not(var_1_33 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L148]       CALL        assume_abort_if_not(var_1_33 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L148]       RET         assume_abort_if_not(var_1_33 <= 1)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L149]                   var_1_34 = __VERIFIER_nondet_uchar()
[L150]       CALL        assume_abort_if_not(var_1_34 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L150]       RET         assume_abort_if_not(var_1_34 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L151]       CALL        assume_abort_if_not(var_1_34 <= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L151]       RET         assume_abort_if_not(var_1_34 <= 0)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=2, var_1_27=0, var_1_28=32, var_1_29=65/4, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L166]       RET         updateVariables()
[L167]       CALL        step()
[L56]                    var_1_24 = var_1_25
[L57]                    var_1_26 = var_1_27
[L58]                    var_1_28 = -2
[L59]                    var_1_29 = var_1_30
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L60]        COND TRUE   var_1_32 || var_1_33
[L61]                    var_1_31 = var_1_34
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=29/4, var_1_36=7/4, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L63]                    var_1_35 = var_1_30
[L64]                    var_1_36 = var_1_30
[L65]                    var_1_37 = var_1_27
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L66]        COND FALSE  !(\read(var_1_3))
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L71]                    signed long int stepLocal_2 = var_1_5 * var_1_13;
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=0, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L72]        COND FALSE  !(stepLocal_2 > last_1_var_1_10)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L75]        COND FALSE  !((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L80]                    unsigned char stepLocal_1 = var_1_17 <= var_1_17;
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=64, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L81]        COND FALSE  !(stepLocal_1 || var_1_3)
[L86]                    var_1_12 = var_1_16
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L88]        COND FALSE  !(99999.8f < var_1_17)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L99]        COND FALSE  !((var_1_17 + var_1_12) <= var_1_17)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L104]       EXPR        var_1_6 ^ var_1_20
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L104]                   unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23;
[L105]       COND TRUE   var_1_20 <= stepLocal_0
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L106]       COND TRUE   var_1_12 == var_1_12
[L107]                   var_1_10 = 0u
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L167]       RET         step()
[L168]       CALL, EXPR  property()
[L158]       EXPR        (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L158-L159]              return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1)
;
[L168]       RET, EXPR   property()
[L168]       CALL        __VERIFIER_assert(property())
[L19]        COND TRUE   !(cond)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]
[L19]                    reach_error()
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=3, var_1_13=0, var_1_14=64, var_1_16=3, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-2, var_1_29=2, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_35=2, var_1_36=2, var_1_37=0, var_1_3=0, var_1_5=32, var_1_6=256]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.7s, OverallIterations: 12, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2284 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2284 mSDsluCounter, 4754 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3236 mSDsCounter, 779 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2180 IncrementalHoareTripleChecker+Invalid, 2959 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 779 mSolverCounterUnsat, 1518 mSDtfsCounter, 2180 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 353 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2760occurred in iteration=11, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 1079 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 2387 NumberOfCodeBlocks, 2387 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2200 ConstructedInterpolants, 0 QuantifiedInterpolants, 10196 SizeOfPredicates, 7 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 16507/16900 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
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-18 19:20:10,765 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/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.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 5ca8d44de1b038c40865b8a2cfc17e34a1f96999f82ad60fa9216aae98b3e84c
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m
[2024-11-18 19:20:13,005 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-18 19:20:13,067 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-18 19:20:13,072 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-18 19:20:13,073 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-18 19:20:13,107 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-18 19:20:13,110 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-18 19:20:13,110 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-18 19:20:13,111 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-18 19:20:13,111 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-18 19:20:13,111 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-18 19:20:13,112 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-18 19:20:13,112 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-18 19:20:13,112 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-18 19:20:13,113 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-18 19:20:13,115 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-18 19:20:13,115 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-18 19:20:13,116 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-18 19:20:13,116 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-18 19:20:13,116 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-18 19:20:13,116 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-18 19:20:13,120 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-18 19:20:13,120 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-18 19:20:13,120 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-18 19:20:13,120 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-18 19:20:13,120 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-18 19:20:13,121 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-18 19:20:13,121 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-18 19:20:13,121 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-18 19:20:13,121 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-18 19:20:13,122 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-18 19:20:13,128 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-18 19:20:13,128 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-18 19:20:13,130 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-18 19:20:13,130 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-18 19:20:13,130 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-18 19:20:13,131 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-18 19:20:13,131 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-18 19:20:13,131 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-18 19:20:13,131 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-18 19:20:13,132 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-18 19:20:13,133 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-18 19:20:13,133 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-18 19:20:13,134 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-18 19:20:13,134 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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 -> 5ca8d44de1b038c40865b8a2cfc17e34a1f96999f82ad60fa9216aae98b3e84c
[2024-11-18 19:20:13,423 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-18 19:20:13,444 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-18 19:20:13,447 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-18 19:20:13,448 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-18 19:20:13,448 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-18 19:20:13,449 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i
[2024-11-18 19:20:14,975 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-18 19:20:15,211 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-18 19:20:15,211 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i
[2024-11-18 19:20:15,225 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54df0cb60/b6c71c3c105a42a381588720124744ac/FLAGcc66608cf
[2024-11-18 19:20:15,557 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54df0cb60/b6c71c3c105a42a381588720124744ac
[2024-11-18 19:20:15,559 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-18 19:20:15,560 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-18 19:20:15,562 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-18 19:20:15,562 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-18 19:20:15,567 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-18 19:20:15,568 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:20:15" (1/1) ...
[2024-11-18 19:20:15,568 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ebafe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:20:15, skipping insertion in model container
[2024-11-18 19:20:15,569 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:20:15" (1/1) ...
[2024-11-18 19:20:15,603 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-18 19:20:15,800 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i[914,927]
[2024-11-18 19:20:15,888 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-18 19:20:15,908 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-18 19:20:15,922 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-3.i[914,927]
[2024-11-18 19:20:15,969 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-18 19:20:15,995 INFO  L204         MainTranslator]: Completed translation
[2024-11-18 19:20:15,996 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:20:15 WrapperNode
[2024-11-18 19:20:15,996 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-18 19:20:15,997 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-18 19:20:15,997 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-18 19:20:15,997 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-18 19:20:16,004 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:20:15" (1/1) ...
[2024-11-18 19:20:16,023 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:20:15" (1/1) ...
[2024-11-18 19:20:16,060 INFO  L138                Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171
[2024-11-18 19:20:16,064 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-18 19:20:16,065 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-18 19:20:16,065 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-18 19:20:16,065 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-18 19:20:16,083 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:20:15" (1/1) ...
[2024-11-18 19:20:16,084 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:20:15" (1/1) ...
[2024-11-18 19:20:16,088 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:20:15" (1/1) ...
[2024-11-18 19:20:16,106 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].
[2024-11-18 19:20:16,106 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:20:15" (1/1) ...
[2024-11-18 19:20:16,107 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:20:15" (1/1) ...
[2024-11-18 19:20:16,121 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:20:15" (1/1) ...
[2024-11-18 19:20:16,127 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:20:15" (1/1) ...
[2024-11-18 19:20:16,129 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:20:15" (1/1) ...
[2024-11-18 19:20:16,130 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:20:15" (1/1) ...
[2024-11-18 19:20:16,136 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-18 19:20:16,137 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-18 19:20:16,137 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-18 19:20:16,137 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-18 19:20:16,138 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:20:15" (1/1) ...
[2024-11-18 19:20:16,148 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-18 19:20:16,158 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 19:20:16,172 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)
[2024-11-18 19:20:16,176 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
[2024-11-18 19:20:16,214 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-18 19:20:16,214 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-18 19:20:16,215 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-18 19:20:16,215 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-18 19:20:16,215 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-18 19:20:16,215 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-18 19:20:16,306 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-18 19:20:16,308 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-18 19:20:31,199 INFO  L?                        ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2024-11-18 19:20:31,199 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-18 19:20:31,217 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-18 19:20:31,218 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-18 19:20:31,218 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:20:31 BoogieIcfgContainer
[2024-11-18 19:20:31,218 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-18 19:20:31,224 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-18 19:20:31,224 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-18 19:20:31,228 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-18 19:20:31,228 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:20:15" (1/3) ...
[2024-11-18 19:20:31,229 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ec315c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:20:31, skipping insertion in model container
[2024-11-18 19:20:31,229 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:20:15" (2/3) ...
[2024-11-18 19:20:31,229 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ec315c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:20:31, skipping insertion in model container
[2024-11-18 19:20:31,229 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:20:31" (3/3) ...
[2024-11-18 19:20:31,231 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-3.i
[2024-11-18 19:20:31,244 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-18 19:20:31,245 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-18 19:20:31,314 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-18 19:20:31,324 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;@23496e0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-18 19:20:31,325 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-18 19:20:31,329 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 79 states, 50 states have (on average 1.42) internal successors, (71), 51 states have internal predecessors, (71), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-18 19:20:31,345 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2024-11-18 19:20:31,345 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 19:20:31,346 INFO  L215           NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 19:20:31,347 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 19:20:31,353 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 19:20:31,354 INFO  L85        PathProgramCache]: Analyzing trace with hash -1636033674, now seen corresponding path program 1 times
[2024-11-18 19:20:31,370 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-18 19:20:31,370 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544587564]
[2024-11-18 19:20:31,371 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 19:20:31,371 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
[2024-11-18 19:20:31,371 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-18 19:20:31,374 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)
[2024-11-18 19:20:31,397 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-11-18 19:20:32,407 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 19:20:32,439 INFO  L255         TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-18 19:20:32,456 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 19:20:32,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked.
[2024-11-18 19:20:32,525 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-18 19:20:32,526 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-18 19:20:32,527 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544587564]
[2024-11-18 19:20:32,527 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [544587564] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 19:20:32,527 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 19:20:32,527 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-18 19:20:32,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181335422]
[2024-11-18 19:20:32,531 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 19:20:32,536 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-18 19:20:32,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-18 19:20:32,567 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-18 19:20:32,568 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-18 19:20:32,571 INFO  L87              Difference]: Start difference. First operand  has 79 states, 50 states have (on average 1.42) internal successors, (71), 51 states have internal predecessors, (71), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand  has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-18 19:20:32,610 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 19:20:32,611 INFO  L93              Difference]: Finished difference Result 151 states and 266 transitions.
[2024-11-18 19:20:32,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-18 19:20:32,614 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165
[2024-11-18 19:20:32,615 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 19:20:32,623 INFO  L225             Difference]: With dead ends: 151
[2024-11-18 19:20:32,623 INFO  L226             Difference]: Without dead ends: 75
[2024-11-18 19:20:32,628 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-18 19:20:32,634 INFO  L432           NwaCegarLoop]: 115 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, 115 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
[2024-11-18 19:20:32,636 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-18 19:20:32,655 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2024-11-18 19:20:32,690 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75.
[2024-11-18 19:20:32,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 75 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-18 19:20:32,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions.
[2024-11-18 19:20:32,695 INFO  L78                 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 165
[2024-11-18 19:20:32,696 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 19:20:32,696 INFO  L471      AbstractCegarLoop]: Abstraction has 75 states and 115 transitions.
[2024-11-18 19:20:32,696 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-18 19:20:32,696 INFO  L276                IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions.
[2024-11-18 19:20:32,700 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2024-11-18 19:20:32,700 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 19:20:32,700 INFO  L215           NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 19:20:32,732 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
[2024-11-18 19:20:32,901 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
[2024-11-18 19:20:32,901 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 19:20:32,902 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 19:20:32,902 INFO  L85        PathProgramCache]: Analyzing trace with hash 127020282, now seen corresponding path program 1 times
[2024-11-18 19:20:32,903 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-18 19:20:32,903 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365488879]
[2024-11-18 19:20:32,904 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 19:20:32,904 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
[2024-11-18 19:20:32,904 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-18 19:20:32,907 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)
[2024-11-18 19:20:32,908 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
[2024-11-18 19:20:33,868 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 19:20:33,898 INFO  L255         TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-18 19:20:33,911 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 19:20:38,480 INFO  L134       CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-18 19:20:38,481 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-18 19:20:38,482 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-18 19:20:38,483 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365488879]
[2024-11-18 19:20:38,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365488879] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 19:20:38,484 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 19:20:38,484 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-18 19:20:38,484 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545752976]
[2024-11-18 19:20:38,485 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 19:20:38,487 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-18 19:20:38,487 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-18 19:20:38,488 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-18 19:20:38,489 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-18 19:20:38,490 INFO  L87              Difference]: Start difference. First operand 75 states and 115 transitions. Second operand  has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-18 19:20:42,918 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-18 19:20:46,935 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-18 19:20:51,202 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-18 19:20:55,209 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-18 19:20:57,320 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-18 19:21:01,586 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-18 19:21:03,945 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-18 19:21:09,261 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-18 19:21:13,269 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-18 19:21:17,283 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []