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


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


Checking for ERROR reachability
Using default analysis
Version 803cd42f
Calling Ultimate with: /root/.sdkman/candidates/java/current/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_variablewrapping_wrapper-sp_file-34.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 b7d4f9d78490f5290f13c8883d00adc73ba1976bc9e9ac925a881a19aea54245
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m
[2024-11-22 13:16:30,788 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-22 13:16:30,839 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-22 13:16:30,843 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-22 13:16:30,844 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-22 13:16:30,858 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-22 13:16:30,859 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-22 13:16:30,859 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-22 13:16:30,859 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-22 13:16:30,860 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-22 13:16:30,860 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-22 13:16:30,860 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-22 13:16:30,861 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-22 13:16:30,861 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-22 13:16:30,861 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-22 13:16:30,861 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-22 13:16:30,862 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-22 13:16:30,862 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-22 13:16:30,862 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-22 13:16:30,863 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-22 13:16:30,863 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-22 13:16:30,868 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-22 13:16:30,869 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-22 13:16:30,869 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-22 13:16:30,869 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-22 13:16:30,869 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-22 13:16:30,869 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-22 13:16:30,869 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-22 13:16:30,870 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-22 13:16:30,870 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-22 13:16:30,870 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-22 13:16:30,870 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-22 13:16:30,870 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-22 13:16:30,870 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-22 13:16:30,871 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-22 13:16:30,871 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-22 13:16:30,871 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-22 13:16:30,871 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-22 13:16:30,871 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-22 13:16:30,872 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-22 13:16:30,872 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-22 13:16:30,872 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-22 13:16:30,873 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 -> b7d4f9d78490f5290f13c8883d00adc73ba1976bc9e9ac925a881a19aea54245
[2024-11-22 13:16:31,087 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-22 13:16:31,104 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-22 13:16:31,105 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-22 13:16:31,106 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-22 13:16:31,107 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-22 13:16:31,107 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i
[2024-11-22 13:16:32,490 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-22 13:16:32,676 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-22 13:16:32,677 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i
[2024-11-22 13:16:32,687 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/639dd97c2/0f87d12f05414396bea164bd330e391a/FLAGc328fe2cc
[2024-11-22 13:16:33,064 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/639dd97c2/0f87d12f05414396bea164bd330e391a
[2024-11-22 13:16:33,067 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-22 13:16:33,068 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-22 13:16:33,069 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-22 13:16:33,069 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-22 13:16:33,074 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-22 13:16:33,075 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:16:33" (1/1) ...
[2024-11-22 13:16:33,076 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47001991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:16:33, skipping insertion in model container
[2024-11-22 13:16:33,076 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:16:33" (1/1) ...
[2024-11-22 13:16:33,100 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-22 13:16:33,229 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i[917,930]
[2024-11-22 13:16:33,269 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-22 13:16:33,277 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-22 13:16:33,286 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i[917,930]
[2024-11-22 13:16:33,334 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-22 13:16:33,354 INFO  L204         MainTranslator]: Completed translation
[2024-11-22 13:16:33,355 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:16:33 WrapperNode
[2024-11-22 13:16:33,355 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-22 13:16:33,356 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-22 13:16:33,356 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-22 13:16:33,356 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-22 13:16:33,361 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:16:33" (1/1) ...
[2024-11-22 13:16:33,376 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:16:33" (1/1) ...
[2024-11-22 13:16:33,444 INFO  L138                Inliner]: procedures = 30, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 453
[2024-11-22 13:16:33,447 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-22 13:16:33,447 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-22 13:16:33,448 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-22 13:16:33,448 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-22 13:16:33,467 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:16:33" (1/1) ...
[2024-11-22 13:16:33,467 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:16:33" (1/1) ...
[2024-11-22 13:16:33,492 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:16:33" (1/1) ...
[2024-11-22 13:16:33,507 WARN  L109           MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS
[2024-11-22 13:16:33,510 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:16:33" (1/1) ...
[2024-11-22 13:16:33,510 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:16:33" (1/1) ...
[2024-11-22 13:16:33,527 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:16:33" (1/1) ...
[2024-11-22 13:16:33,534 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:16:33" (1/1) ...
[2024-11-22 13:16:33,540 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:16:33" (1/1) ...
[2024-11-22 13:16:33,542 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:16:33" (1/1) ...
[2024-11-22 13:16:33,550 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-22 13:16:33,551 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-22 13:16:33,552 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-22 13:16:33,552 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-22 13:16:33,553 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:16:33" (1/1) ...
[2024-11-22 13:16:33,562 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-22 13:16:33,575 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 13:16:33,605 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-22 13:16:33,607 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-22 13:16:33,641 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-22 13:16:33,641 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~int
[2024-11-22 13:16:33,641 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~real
[2024-11-22 13:16:33,641 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-11-22 13:16:33,641 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real
[2024-11-22 13:16:33,641 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real
[2024-11-22 13:16:33,641 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-11-22 13:16:33,641 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-22 13:16:33,642 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-22 13:16:33,642 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-11-22 13:16:33,642 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-22 13:16:33,642 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-22 13:16:33,740 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-22 13:16:33,741 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-22 13:16:34,254 INFO  L?                        ?]: Removed 89 outVars from TransFormulas that were not future-live.
[2024-11-22 13:16:34,254 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-22 13:16:34,266 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-22 13:16:34,266 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-22 13:16:34,267 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:16:34 BoogieIcfgContainer
[2024-11-22 13:16:34,267 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-22 13:16:34,268 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-22 13:16:34,268 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-22 13:16:34,271 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-22 13:16:34,271 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:16:33" (1/3) ...
[2024-11-22 13:16:34,272 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d58e51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:16:34, skipping insertion in model container
[2024-11-22 13:16:34,272 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:16:33" (2/3) ...
[2024-11-22 13:16:34,272 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d58e51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:16:34, skipping insertion in model container
[2024-11-22 13:16:34,273 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:16:34" (3/3) ...
[2024-11-22 13:16:34,274 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-34.i
[2024-11-22 13:16:34,287 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-22 13:16:34,287 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-22 13:16:34,329 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-22 13:16:34,333 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;@350c761, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-22 13:16:34,334 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-22 13:16:34,337 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-22 13:16:34,348 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2024-11-22 13:16:34,348 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:34,349 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:34,353 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:34,358 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:34,358 INFO  L85        PathProgramCache]: Analyzing trace with hash -504089564, now seen corresponding path program 1 times
[2024-11-22 13:16:34,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:34,365 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215873572]
[2024-11-22 13:16:34,365 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:34,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:34,519 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:34,725 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked.
[2024-11-22 13:16:34,725 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:34,726 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215873572]
[2024-11-22 13:16:34,727 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215873572] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 13:16:34,727 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641389741]
[2024-11-22 13:16:34,727 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:34,728 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 13:16:34,728 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 13:16:34,732 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-22 13:16:34,735 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-22 13:16:34,980 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:34,983 INFO  L255         TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-22 13:16:34,991 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 13:16:35,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked.
[2024-11-22 13:16:35,013 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-22 13:16:35,013 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [641389741] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:35,013 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-22 13:16:35,014 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2024-11-22 13:16:35,017 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776624293]
[2024-11-22 13:16:35,018 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:35,022 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-22 13:16:35,022 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:35,042 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-22 13:16:35,043 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-22 13:16:35,045 INFO  L87              Difference]: Start difference. First operand  has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand  has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-22 13:16:35,081 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:35,082 INFO  L93              Difference]: Finished difference Result 233 states and 367 transitions.
[2024-11-22 13:16:35,083 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-22 13:16:35,084 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171
[2024-11-22 13:16:35,085 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:35,093 INFO  L225             Difference]: With dead ends: 233
[2024-11-22 13:16:35,094 INFO  L226             Difference]: Without dead ends: 116
[2024-11-22 13:16:35,097 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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-22 13:16:35,102 INFO  L432           NwaCegarLoop]: 168 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, 168 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-22 13:16:35,104 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 13:16:35,118 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2024-11-22 13:16:35,137 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116.
[2024-11-22 13:16:35,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-22 13:16:35,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions.
[2024-11-22 13:16:35,141 INFO  L78                 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171
[2024-11-22 13:16:35,142 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:35,142 INFO  L471      AbstractCegarLoop]: Abstraction has 116 states and 168 transitions.
[2024-11-22 13:16:35,142 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-22 13:16:35,142 INFO  L276                IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions.
[2024-11-22 13:16:35,145 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2024-11-22 13:16:35,145 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:35,145 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:35,157 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-22 13:16:35,346 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2024-11-22 13:16:35,347 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:35,347 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:35,348 INFO  L85        PathProgramCache]: Analyzing trace with hash 1447710914, now seen corresponding path program 1 times
[2024-11-22 13:16:35,348 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:35,348 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131106544]
[2024-11-22 13:16:35,348 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:35,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:35,435 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:35,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:35,586 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:35,586 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131106544]
[2024-11-22 13:16:35,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131106544] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:35,586 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:35,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-22 13:16:35,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221489189]
[2024-11-22 13:16:35,586 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:35,587 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-22 13:16:35,587 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:35,588 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-22 13:16:35,588 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-22 13:16:35,588 INFO  L87              Difference]: Start difference. First operand 116 states and 168 transitions. Second operand  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:35,619 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:35,619 INFO  L93              Difference]: Finished difference Result 230 states and 335 transitions.
[2024-11-22 13:16:35,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-22 13:16:35,620 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171
[2024-11-22 13:16:35,621 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:35,622 INFO  L225             Difference]: With dead ends: 230
[2024-11-22 13:16:35,622 INFO  L226             Difference]: Without dead ends: 117
[2024-11-22 13:16:35,623 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-22 13:16:35,623 INFO  L432           NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:35,624 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 13:16:35,624 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2024-11-22 13:16:35,632 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117.
[2024-11-22 13:16:35,632 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 117 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-22 13:16:35,633 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions.
[2024-11-22 13:16:35,634 INFO  L78                 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 171
[2024-11-22 13:16:35,636 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:35,637 INFO  L471      AbstractCegarLoop]: Abstraction has 117 states and 169 transitions.
[2024-11-22 13:16:35,637 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:35,637 INFO  L276                IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions.
[2024-11-22 13:16:35,639 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2024-11-22 13:16:35,641 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:35,641 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:35,641 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-22 13:16:35,642 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:35,642 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:35,643 INFO  L85        PathProgramCache]: Analyzing trace with hash 630062464, now seen corresponding path program 1 times
[2024-11-22 13:16:35,643 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:35,644 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725342590]
[2024-11-22 13:16:35,644 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:35,644 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:35,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:35,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked.
[2024-11-22 13:16:35,997 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:35,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725342590]
[2024-11-22 13:16:35,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725342590] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 13:16:35,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612838098]
[2024-11-22 13:16:35,997 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:35,998 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 13:16:35,998 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 13:16:36,001 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-22 13:16:36,005 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-22 13:16:36,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:36,221 INFO  L255         TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-22 13:16:36,229 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 13:16:36,279 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:36,279 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-22 13:16:36,279 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [612838098] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:36,280 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-22 13:16:36,280 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7
[2024-11-22 13:16:36,280 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813325311]
[2024-11-22 13:16:36,280 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:36,280 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-22 13:16:36,280 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:36,281 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-22 13:16:36,281 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-22 13:16:36,281 INFO  L87              Difference]: Start difference. First operand 117 states and 169 transitions. Second operand  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:36,322 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:36,326 INFO  L93              Difference]: Finished difference Result 233 states and 338 transitions.
[2024-11-22 13:16:36,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-22 13:16:36,327 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171
[2024-11-22 13:16:36,327 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:36,330 INFO  L225             Difference]: With dead ends: 233
[2024-11-22 13:16:36,330 INFO  L226             Difference]: Without dead ends: 119
[2024-11-22 13:16:36,331 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-22 13:16:36,334 INFO  L432           NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:36,335 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 13:16:36,335 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2024-11-22 13:16:36,345 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119.
[2024-11-22 13:16:36,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 119 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-22 13:16:36,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions.
[2024-11-22 13:16:36,350 INFO  L78                 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 171
[2024-11-22 13:16:36,352 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:36,352 INFO  L471      AbstractCegarLoop]: Abstraction has 119 states and 171 transitions.
[2024-11-22 13:16:36,352 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:36,353 INFO  L276                IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions.
[2024-11-22 13:16:36,358 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2024-11-22 13:16:36,358 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:36,358 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:36,372 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-22 13:16:36,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,SelfDestructingSolverStorable2
[2024-11-22 13:16:36,563 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:36,563 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:36,564 INFO  L85        PathProgramCache]: Analyzing trace with hash 816478610, now seen corresponding path program 1 times
[2024-11-22 13:16:36,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:36,564 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122804116]
[2024-11-22 13:16:36,564 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:36,564 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:36,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:36,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:36,721 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:36,721 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122804116]
[2024-11-22 13:16:36,722 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122804116] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:36,722 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:36,724 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-22 13:16:36,724 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017519203]
[2024-11-22 13:16:36,725 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:36,725 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-22 13:16:36,725 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:36,726 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-22 13:16:36,726 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-22 13:16:36,726 INFO  L87              Difference]: Start difference. First operand 119 states and 171 transitions. Second operand  has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:36,753 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:36,754 INFO  L93              Difference]: Finished difference Result 285 states and 411 transitions.
[2024-11-22 13:16:36,755 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-22 13:16:36,755 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173
[2024-11-22 13:16:36,756 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:36,758 INFO  L225             Difference]: With dead ends: 285
[2024-11-22 13:16:36,759 INFO  L226             Difference]: Without dead ends: 169
[2024-11-22 13:16:36,760 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-22 13:16:36,761 INFO  L432           NwaCegarLoop]: 167 mSDtfsCounter, 59 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:36,761 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 323 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 13:16:36,763 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 169 states.
[2024-11-22 13:16:36,773 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 138.
[2024-11-22 13:16:36,774 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 138 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 113 states have internal predecessors, (153), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-22 13:16:36,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 199 transitions.
[2024-11-22 13:16:36,779 INFO  L78                 Accepts]: Start accepts. Automaton has 138 states and 199 transitions. Word has length 173
[2024-11-22 13:16:36,780 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:36,780 INFO  L471      AbstractCegarLoop]: Abstraction has 138 states and 199 transitions.
[2024-11-22 13:16:36,780 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:36,780 INFO  L276                IsEmpty]: Start isEmpty. Operand 138 states and 199 transitions.
[2024-11-22 13:16:36,781 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2024-11-22 13:16:36,782 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:36,782 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:36,782 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-22 13:16:36,785 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:36,785 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:36,785 INFO  L85        PathProgramCache]: Analyzing trace with hash 1194672414, now seen corresponding path program 1 times
[2024-11-22 13:16:36,786 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:36,786 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157768221]
[2024-11-22 13:16:36,786 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:36,786 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:36,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:37,436 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:37,437 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:37,437 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157768221]
[2024-11-22 13:16:37,437 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157768221] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:37,437 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:37,437 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-22 13:16:37,438 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113345118]
[2024-11-22 13:16:37,438 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:37,439 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-22 13:16:37,439 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:37,440 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-22 13:16:37,440 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-11-22 13:16:37,440 INFO  L87              Difference]: Start difference. First operand 138 states and 199 transitions. Second operand  has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23)
[2024-11-22 13:16:37,947 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:37,947 INFO  L93              Difference]: Finished difference Result 399 states and 571 transitions.
[2024-11-22 13:16:37,947 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-22 13:16:37,948 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 176
[2024-11-22 13:16:37,948 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:37,949 INFO  L225             Difference]: With dead ends: 399
[2024-11-22 13:16:37,949 INFO  L226             Difference]: Without dead ends: 264
[2024-11-22 13:16:37,950 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2024-11-22 13:16:37,950 INFO  L432           NwaCegarLoop]: 140 mSDtfsCounter, 313 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:37,951 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 443 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-22 13:16:37,955 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 264 states.
[2024-11-22 13:16:37,976 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 217.
[2024-11-22 13:16:37,977 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 217 states, 172 states have (on average 1.3255813953488371) internal successors, (228), 173 states have internal predecessors, (228), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42)
[2024-11-22 13:16:37,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 312 transitions.
[2024-11-22 13:16:37,978 INFO  L78                 Accepts]: Start accepts. Automaton has 217 states and 312 transitions. Word has length 176
[2024-11-22 13:16:37,979 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:37,979 INFO  L471      AbstractCegarLoop]: Abstraction has 217 states and 312 transitions.
[2024-11-22 13:16:37,979 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23)
[2024-11-22 13:16:37,979 INFO  L276                IsEmpty]: Start isEmpty. Operand 217 states and 312 transitions.
[2024-11-22 13:16:37,981 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2024-11-22 13:16:37,982 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:37,982 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:37,982 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-22 13:16:37,982 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:37,982 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:37,983 INFO  L85        PathProgramCache]: Analyzing trace with hash -1177066848, now seen corresponding path program 1 times
[2024-11-22 13:16:37,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:37,983 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533610799]
[2024-11-22 13:16:37,983 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:37,983 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:38,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:39,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:39,594 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:39,594 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533610799]
[2024-11-22 13:16:39,594 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533610799] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:39,594 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:39,594 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-22 13:16:39,594 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862828421]
[2024-11-22 13:16:39,595 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:39,595 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-22 13:16:39,595 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:39,596 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-22 13:16:39,596 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-22 13:16:39,596 INFO  L87              Difference]: Start difference. First operand 217 states and 312 transitions. Second operand  has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-22 13:16:39,771 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:39,771 INFO  L93              Difference]: Finished difference Result 504 states and 727 transitions.
[2024-11-22 13:16:39,771 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-22 13:16:39,771 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 176
[2024-11-22 13:16:39,772 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:39,774 INFO  L225             Difference]: With dead ends: 504
[2024-11-22 13:16:39,774 INFO  L226             Difference]: Without dead ends: 290
[2024-11-22 13:16:39,775 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-11-22 13:16:39,778 INFO  L432           NwaCegarLoop]: 142 mSDtfsCounter, 74 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:39,779 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 387 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 13:16:39,780 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 290 states.
[2024-11-22 13:16:39,807 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 279.
[2024-11-22 13:16:39,808 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 279 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 211 states have internal predecessors, (272), 65 states have call successors, (65), 3 states have call predecessors, (65), 3 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65)
[2024-11-22 13:16:39,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 402 transitions.
[2024-11-22 13:16:39,811 INFO  L78                 Accepts]: Start accepts. Automaton has 279 states and 402 transitions. Word has length 176
[2024-11-22 13:16:39,811 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:39,812 INFO  L471      AbstractCegarLoop]: Abstraction has 279 states and 402 transitions.
[2024-11-22 13:16:39,812 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-22 13:16:39,812 INFO  L276                IsEmpty]: Start isEmpty. Operand 279 states and 402 transitions.
[2024-11-22 13:16:39,813 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2024-11-22 13:16:39,813 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:39,814 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:39,814 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-22 13:16:39,814 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:39,814 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:39,814 INFO  L85        PathProgramCache]: Analyzing trace with hash 533507088, now seen corresponding path program 1 times
[2024-11-22 13:16:39,814 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:39,815 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420308769]
[2024-11-22 13:16:39,815 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:39,815 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:39,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:39,946 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:39,946 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:39,950 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420308769]
[2024-11-22 13:16:39,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420308769] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:39,950 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:39,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-22 13:16:39,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130457056]
[2024-11-22 13:16:39,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:39,951 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-22 13:16:39,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:39,951 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-22 13:16:39,952 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-22 13:16:39,952 INFO  L87              Difference]: Start difference. First operand 279 states and 402 transitions. Second operand  has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:40,025 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:40,025 INFO  L93              Difference]: Finished difference Result 523 states and 753 transitions.
[2024-11-22 13:16:40,025 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-22 13:16:40,026 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176
[2024-11-22 13:16:40,026 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:40,028 INFO  L225             Difference]: With dead ends: 523
[2024-11-22 13:16:40,029 INFO  L226             Difference]: Without dead ends: 307
[2024-11-22 13:16:40,030 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-22 13:16:40,030 INFO  L432           NwaCegarLoop]: 226 mSDtfsCounter, 61 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:40,031 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 376 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 13:16:40,032 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 307 states.
[2024-11-22 13:16:40,089 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 278.
[2024-11-22 13:16:40,090 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 278 states, 209 states have (on average 1.277511961722488) internal successors, (267), 210 states have internal predecessors, (267), 65 states have call successors, (65), 3 states have call predecessors, (65), 3 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65)
[2024-11-22 13:16:40,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 397 transitions.
[2024-11-22 13:16:40,092 INFO  L78                 Accepts]: Start accepts. Automaton has 278 states and 397 transitions. Word has length 176
[2024-11-22 13:16:40,093 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:40,093 INFO  L471      AbstractCegarLoop]: Abstraction has 278 states and 397 transitions.
[2024-11-22 13:16:40,093 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:40,094 INFO  L276                IsEmpty]: Start isEmpty. Operand 278 states and 397 transitions.
[2024-11-22 13:16:40,095 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 179
[2024-11-22 13:16:40,095 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:40,096 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:40,096 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-22 13:16:40,096 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:40,096 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:40,097 INFO  L85        PathProgramCache]: Analyzing trace with hash 330649992, now seen corresponding path program 1 times
[2024-11-22 13:16:40,097 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:40,098 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116454672]
[2024-11-22 13:16:40,098 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:40,098 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:40,169 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:40,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:40,791 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:40,792 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116454672]
[2024-11-22 13:16:40,792 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116454672] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:40,792 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:40,792 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-22 13:16:40,792 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400865596]
[2024-11-22 13:16:40,792 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:40,793 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-22 13:16:40,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:40,793 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-22 13:16:40,794 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-22 13:16:40,794 INFO  L87              Difference]: Start difference. First operand 278 states and 397 transitions. Second operand  has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23)
[2024-11-22 13:16:41,534 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:41,534 INFO  L93              Difference]: Finished difference Result 540 states and 768 transitions.
[2024-11-22 13:16:41,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-22 13:16:41,535 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 178
[2024-11-22 13:16:41,535 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:41,537 INFO  L225             Difference]: With dead ends: 540
[2024-11-22 13:16:41,537 INFO  L226             Difference]: Without dead ends: 326
[2024-11-22 13:16:41,537 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182
[2024-11-22 13:16:41,538 INFO  L432           NwaCegarLoop]: 128 mSDtfsCounter, 429 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:41,538 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 551 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-22 13:16:41,539 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 326 states.
[2024-11-22 13:16:41,558 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 297.
[2024-11-22 13:16:41,559 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 297 states, 228 states have (on average 1.2850877192982457) internal successors, (293), 229 states have internal predecessors, (293), 65 states have call successors, (65), 3 states have call predecessors, (65), 3 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65)
[2024-11-22 13:16:41,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 423 transitions.
[2024-11-22 13:16:41,560 INFO  L78                 Accepts]: Start accepts. Automaton has 297 states and 423 transitions. Word has length 178
[2024-11-22 13:16:41,561 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:41,561 INFO  L471      AbstractCegarLoop]: Abstraction has 297 states and 423 transitions.
[2024-11-22 13:16:41,561 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23)
[2024-11-22 13:16:41,561 INFO  L276                IsEmpty]: Start isEmpty. Operand 297 states and 423 transitions.
[2024-11-22 13:16:41,566 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 179
[2024-11-22 13:16:41,568 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:41,568 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:41,568 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-22 13:16:41,569 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:41,569 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:41,569 INFO  L85        PathProgramCache]: Analyzing trace with hash 1716853386, now seen corresponding path program 1 times
[2024-11-22 13:16:41,569 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:41,569 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136545119]
[2024-11-22 13:16:41,569 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:41,569 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:41,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:43,174 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:43,174 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:43,175 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136545119]
[2024-11-22 13:16:43,175 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136545119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:43,175 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:43,175 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-22 13:16:43,175 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43499500]
[2024-11-22 13:16:43,175 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:43,176 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-22 13:16:43,176 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:43,176 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-22 13:16:43,177 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2024-11-22 13:16:43,177 INFO  L87              Difference]: Start difference. First operand 297 states and 423 transitions. Second operand  has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23)
[2024-11-22 13:16:43,625 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:43,625 INFO  L93              Difference]: Finished difference Result 637 states and 906 transitions.
[2024-11-22 13:16:43,625 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-22 13:16:43,626 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 178
[2024-11-22 13:16:43,626 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:43,628 INFO  L225             Difference]: With dead ends: 637
[2024-11-22 13:16:43,628 INFO  L226             Difference]: Without dead ends: 406
[2024-11-22 13:16:43,629 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110
[2024-11-22 13:16:43,630 INFO  L432           NwaCegarLoop]: 169 mSDtfsCounter, 232 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:43,630 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 699 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-22 13:16:43,631 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 406 states.
[2024-11-22 13:16:43,656 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 399.
[2024-11-22 13:16:43,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 399 states, 306 states have (on average 1.2810457516339868) internal successors, (392), 307 states have internal predecessors, (392), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88)
[2024-11-22 13:16:43,658 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 568 transitions.
[2024-11-22 13:16:43,658 INFO  L78                 Accepts]: Start accepts. Automaton has 399 states and 568 transitions. Word has length 178
[2024-11-22 13:16:43,658 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:43,658 INFO  L471      AbstractCegarLoop]: Abstraction has 399 states and 568 transitions.
[2024-11-22 13:16:43,659 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23)
[2024-11-22 13:16:43,659 INFO  L276                IsEmpty]: Start isEmpty. Operand 399 states and 568 transitions.
[2024-11-22 13:16:43,660 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 179
[2024-11-22 13:16:43,661 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:43,661 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:43,661 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-22 13:16:43,661 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:43,662 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:43,662 INFO  L85        PathProgramCache]: Analyzing trace with hash 165713621, now seen corresponding path program 1 times
[2024-11-22 13:16:43,662 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:43,662 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383282526]
[2024-11-22 13:16:43,662 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:43,662 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:43,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:43,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:43,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:43,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383282526]
[2024-11-22 13:16:43,985 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383282526] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:43,985 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:43,985 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-22 13:16:43,985 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863488683]
[2024-11-22 13:16:43,985 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:43,985 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-22 13:16:43,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:43,986 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-22 13:16:43,986 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-22 13:16:43,986 INFO  L87              Difference]: Start difference. First operand 399 states and 568 transitions. Second operand  has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:44,181 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:44,181 INFO  L93              Difference]: Finished difference Result 740 states and 1047 transitions.
[2024-11-22 13:16:44,181 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-22 13:16:44,182 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178
[2024-11-22 13:16:44,183 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:44,185 INFO  L225             Difference]: With dead ends: 740
[2024-11-22 13:16:44,185 INFO  L226             Difference]: Without dead ends: 509
[2024-11-22 13:16:44,186 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-22 13:16:44,186 INFO  L432           NwaCegarLoop]: 140 mSDtfsCounter, 111 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:44,186 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 400 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-22 13:16:44,187 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 509 states.
[2024-11-22 13:16:44,208 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 399.
[2024-11-22 13:16:44,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 399 states, 306 states have (on average 1.2777777777777777) internal successors, (391), 307 states have internal predecessors, (391), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88)
[2024-11-22 13:16:44,210 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 567 transitions.
[2024-11-22 13:16:44,211 INFO  L78                 Accepts]: Start accepts. Automaton has 399 states and 567 transitions. Word has length 178
[2024-11-22 13:16:44,211 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:44,211 INFO  L471      AbstractCegarLoop]: Abstraction has 399 states and 567 transitions.
[2024-11-22 13:16:44,211 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:44,212 INFO  L276                IsEmpty]: Start isEmpty. Operand 399 states and 567 transitions.
[2024-11-22 13:16:44,213 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 180
[2024-11-22 13:16:44,213 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:44,213 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:44,213 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-22 13:16:44,213 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:44,214 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:44,214 INFO  L85        PathProgramCache]: Analyzing trace with hash -1772693531, now seen corresponding path program 1 times
[2024-11-22 13:16:44,214 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:44,214 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496728412]
[2024-11-22 13:16:44,214 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:44,214 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:44,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:44,540 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:44,540 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:44,540 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496728412]
[2024-11-22 13:16:44,540 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496728412] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:44,541 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:44,541 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-22 13:16:44,541 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777711748]
[2024-11-22 13:16:44,541 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:44,541 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-22 13:16:44,541 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:44,542 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-22 13:16:44,542 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-11-22 13:16:44,542 INFO  L87              Difference]: Start difference. First operand 399 states and 567 transitions. Second operand  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:44,975 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:44,975 INFO  L93              Difference]: Finished difference Result 703 states and 993 transitions.
[2024-11-22 13:16:44,976 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-22 13:16:44,976 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179
[2024-11-22 13:16:44,976 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:44,978 INFO  L225             Difference]: With dead ends: 703
[2024-11-22 13:16:44,978 INFO  L226             Difference]: Without dead ends: 472
[2024-11-22 13:16:44,978 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2024-11-22 13:16:44,978 INFO  L432           NwaCegarLoop]: 186 mSDtfsCounter, 141 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:44,979 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 580 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-22 13:16:44,980 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 472 states.
[2024-11-22 13:16:45,003 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 407.
[2024-11-22 13:16:45,003 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 407 states, 314 states have (on average 1.2770700636942676) internal successors, (401), 315 states have internal predecessors, (401), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88)
[2024-11-22 13:16:45,005 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 577 transitions.
[2024-11-22 13:16:45,006 INFO  L78                 Accepts]: Start accepts. Automaton has 407 states and 577 transitions. Word has length 179
[2024-11-22 13:16:45,006 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:45,007 INFO  L471      AbstractCegarLoop]: Abstraction has 407 states and 577 transitions.
[2024-11-22 13:16:45,008 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:45,008 INFO  L276                IsEmpty]: Start isEmpty. Operand 407 states and 577 transitions.
[2024-11-22 13:16:45,009 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2024-11-22 13:16:45,009 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:45,009 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:45,010 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-22 13:16:45,010 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:45,011 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:45,011 INFO  L85        PathProgramCache]: Analyzing trace with hash -516330058, now seen corresponding path program 1 times
[2024-11-22 13:16:45,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:45,011 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089124040]
[2024-11-22 13:16:45,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:45,011 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:45,050 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:45,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:45,106 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:45,106 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089124040]
[2024-11-22 13:16:45,106 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089124040] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:45,106 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:45,106 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-22 13:16:45,106 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548879045]
[2024-11-22 13:16:45,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:45,107 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-22 13:16:45,107 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:45,107 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-22 13:16:45,108 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-22 13:16:45,108 INFO  L87              Difference]: Start difference. First operand 407 states and 577 transitions. Second operand  has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:45,138 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:45,138 INFO  L93              Difference]: Finished difference Result 757 states and 1073 transitions.
[2024-11-22 13:16:45,139 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-22 13:16:45,139 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180
[2024-11-22 13:16:45,139 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:45,141 INFO  L225             Difference]: With dead ends: 757
[2024-11-22 13:16:45,141 INFO  L226             Difference]: Without dead ends: 416
[2024-11-22 13:16:45,142 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-22 13:16:45,143 INFO  L432           NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:45,143 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 13:16:45,144 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 416 states.
[2024-11-22 13:16:45,167 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 413.
[2024-11-22 13:16:45,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 413 states, 320 states have (on average 1.271875) internal successors, (407), 321 states have internal predecessors, (407), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88)
[2024-11-22 13:16:45,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 583 transitions.
[2024-11-22 13:16:45,170 INFO  L78                 Accepts]: Start accepts. Automaton has 413 states and 583 transitions. Word has length 180
[2024-11-22 13:16:45,170 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:45,170 INFO  L471      AbstractCegarLoop]: Abstraction has 413 states and 583 transitions.
[2024-11-22 13:16:45,171 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:45,171 INFO  L276                IsEmpty]: Start isEmpty. Operand 413 states and 583 transitions.
[2024-11-22 13:16:45,172 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2024-11-22 13:16:45,172 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:45,172 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:45,173 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-22 13:16:45,173 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:45,173 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:45,173 INFO  L85        PathProgramCache]: Analyzing trace with hash -1217394636, now seen corresponding path program 1 times
[2024-11-22 13:16:45,173 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:45,173 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759727993]
[2024-11-22 13:16:45,174 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:45,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:45,262 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:46,544 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:46,545 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:46,545 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759727993]
[2024-11-22 13:16:46,545 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759727993] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:46,545 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:46,545 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-22 13:16:46,545 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739420378]
[2024-11-22 13:16:46,546 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:46,546 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-22 13:16:46,546 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:46,546 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-22 13:16:46,547 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2024-11-22 13:16:46,547 INFO  L87              Difference]: Start difference. First operand 413 states and 583 transitions. Second operand  has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23)
[2024-11-22 13:16:47,119 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:47,120 INFO  L93              Difference]: Finished difference Result 931 states and 1295 transitions.
[2024-11-22 13:16:47,124 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-22 13:16:47,124 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 180
[2024-11-22 13:16:47,124 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:47,127 INFO  L225             Difference]: With dead ends: 931
[2024-11-22 13:16:47,127 INFO  L226             Difference]: Without dead ends: 584
[2024-11-22 13:16:47,128 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210
[2024-11-22 13:16:47,129 INFO  L432           NwaCegarLoop]: 116 mSDtfsCounter, 290 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:47,129 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 408 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-22 13:16:47,130 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 584 states.
[2024-11-22 13:16:47,160 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 560.
[2024-11-22 13:16:47,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 560 states, 457 states have (on average 1.2778993435448578) internal successors, (584), 461 states have internal predecessors, (584), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 90 states have call predecessors, (94), 94 states have call successors, (94)
[2024-11-22 13:16:47,162 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 772 transitions.
[2024-11-22 13:16:47,163 INFO  L78                 Accepts]: Start accepts. Automaton has 560 states and 772 transitions. Word has length 180
[2024-11-22 13:16:47,163 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:47,163 INFO  L471      AbstractCegarLoop]: Abstraction has 560 states and 772 transitions.
[2024-11-22 13:16:47,163 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23)
[2024-11-22 13:16:47,163 INFO  L276                IsEmpty]: Start isEmpty. Operand 560 states and 772 transitions.
[2024-11-22 13:16:47,164 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2024-11-22 13:16:47,164 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:47,165 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:47,165 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-22 13:16:47,165 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:47,165 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:47,165 INFO  L85        PathProgramCache]: Analyzing trace with hash 62469042, now seen corresponding path program 1 times
[2024-11-22 13:16:47,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:47,166 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779403555]
[2024-11-22 13:16:47,166 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:47,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:47,232 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:47,698 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:47,698 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:47,698 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779403555]
[2024-11-22 13:16:47,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779403555] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:47,698 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:47,698 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-22 13:16:47,698 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573982383]
[2024-11-22 13:16:47,698 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:47,699 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-22 13:16:47,699 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:47,699 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-22 13:16:47,699 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-11-22 13:16:47,699 INFO  L87              Difference]: Start difference. First operand 560 states and 772 transitions. Second operand  has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:48,002 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:48,002 INFO  L93              Difference]: Finished difference Result 1317 states and 1800 transitions.
[2024-11-22 13:16:48,002 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-22 13:16:48,003 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180
[2024-11-22 13:16:48,003 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:48,007 INFO  L225             Difference]: With dead ends: 1317
[2024-11-22 13:16:48,007 INFO  L226             Difference]: Without dead ends: 828
[2024-11-22 13:16:48,009 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210
[2024-11-22 13:16:48,009 INFO  L432           NwaCegarLoop]: 153 mSDtfsCounter, 55 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:48,009 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1302 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-22 13:16:48,011 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 828 states.
[2024-11-22 13:16:48,048 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 700.
[2024-11-22 13:16:48,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 700 states, 597 states have (on average 1.269681742043551) internal successors, (758), 601 states have internal predecessors, (758), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 90 states have call predecessors, (94), 94 states have call successors, (94)
[2024-11-22 13:16:48,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 946 transitions.
[2024-11-22 13:16:48,052 INFO  L78                 Accepts]: Start accepts. Automaton has 700 states and 946 transitions. Word has length 180
[2024-11-22 13:16:48,052 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:48,052 INFO  L471      AbstractCegarLoop]: Abstraction has 700 states and 946 transitions.
[2024-11-22 13:16:48,053 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:48,053 INFO  L276                IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions.
[2024-11-22 13:16:48,054 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2024-11-22 13:16:48,054 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:48,054 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:48,054 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-22 13:16:48,054 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:48,055 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:48,055 INFO  L85        PathProgramCache]: Analyzing trace with hash 176727606, now seen corresponding path program 1 times
[2024-11-22 13:16:48,055 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:48,055 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087413246]
[2024-11-22 13:16:48,055 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:48,055 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:48,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:48,400 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:48,400 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:48,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087413246]
[2024-11-22 13:16:48,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087413246] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:48,400 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:48,400 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-22 13:16:48,401 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398270504]
[2024-11-22 13:16:48,401 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:48,401 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-22 13:16:48,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:48,401 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-22 13:16:48,402 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-22 13:16:48,402 INFO  L87              Difference]: Start difference. First operand 700 states and 946 transitions. Second operand  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:48,564 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:48,564 INFO  L93              Difference]: Finished difference Result 1459 states and 1964 transitions.
[2024-11-22 13:16:48,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-22 13:16:48,564 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180
[2024-11-22 13:16:48,565 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:48,567 INFO  L225             Difference]: With dead ends: 1459
[2024-11-22 13:16:48,567 INFO  L226             Difference]: Without dead ends: 830
[2024-11-22 13:16:48,568 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-22 13:16:48,569 INFO  L432           NwaCegarLoop]: 150 mSDtfsCounter, 35 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:48,569 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 647 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 13:16:48,570 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 830 states.
[2024-11-22 13:16:48,601 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 699.
[2024-11-22 13:16:48,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 699 states, 596 states have (on average 1.2701342281879195) internal successors, (757), 600 states have internal predecessors, (757), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 90 states have call predecessors, (94), 94 states have call successors, (94)
[2024-11-22 13:16:48,603 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 945 transitions.
[2024-11-22 13:16:48,604 INFO  L78                 Accepts]: Start accepts. Automaton has 699 states and 945 transitions. Word has length 180
[2024-11-22 13:16:48,604 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:48,604 INFO  L471      AbstractCegarLoop]: Abstraction has 699 states and 945 transitions.
[2024-11-22 13:16:48,604 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:48,605 INFO  L276                IsEmpty]: Start isEmpty. Operand 699 states and 945 transitions.
[2024-11-22 13:16:48,606 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2024-11-22 13:16:48,606 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:48,606 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:48,606 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-22 13:16:48,607 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:48,608 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:48,608 INFO  L85        PathProgramCache]: Analyzing trace with hash 203017652, now seen corresponding path program 1 times
[2024-11-22 13:16:48,608 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:48,608 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914652590]
[2024-11-22 13:16:48,608 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:48,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:48,648 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:48,698 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:48,698 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:48,698 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914652590]
[2024-11-22 13:16:48,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914652590] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:48,698 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:48,699 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-22 13:16:48,699 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571233553]
[2024-11-22 13:16:48,699 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:48,699 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-22 13:16:48,699 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:48,700 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-22 13:16:48,700 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-22 13:16:48,700 INFO  L87              Difference]: Start difference. First operand 699 states and 945 transitions. Second operand  has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:48,740 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:48,742 INFO  L93              Difference]: Finished difference Result 1341 states and 1814 transitions.
[2024-11-22 13:16:48,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-22 13:16:48,743 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180
[2024-11-22 13:16:48,743 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:48,747 INFO  L225             Difference]: With dead ends: 1341
[2024-11-22 13:16:48,747 INFO  L226             Difference]: Without dead ends: 713
[2024-11-22 13:16:48,748 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-22 13:16:48,749 INFO  L432           NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:48,749 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 481 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 13:16:48,750 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 713 states.
[2024-11-22 13:16:48,787 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713.
[2024-11-22 13:16:48,788 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 713 states, 610 states have (on average 1.2639344262295082) internal successors, (771), 614 states have internal predecessors, (771), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 90 states have call predecessors, (94), 94 states have call successors, (94)
[2024-11-22 13:16:48,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 959 transitions.
[2024-11-22 13:16:48,792 INFO  L78                 Accepts]: Start accepts. Automaton has 713 states and 959 transitions. Word has length 180
[2024-11-22 13:16:48,792 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:48,792 INFO  L471      AbstractCegarLoop]: Abstraction has 713 states and 959 transitions.
[2024-11-22 13:16:48,792 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:48,792 INFO  L276                IsEmpty]: Start isEmpty. Operand 713 states and 959 transitions.
[2024-11-22 13:16:48,793 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2024-11-22 13:16:48,793 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:48,793 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:48,793 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-22 13:16:48,794 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:48,794 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:48,794 INFO  L85        PathProgramCache]: Analyzing trace with hash 2126245686, now seen corresponding path program 1 times
[2024-11-22 13:16:48,794 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:48,794 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960132024]
[2024-11-22 13:16:48,794 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:48,794 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:48,853 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:49,216 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:49,217 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:49,217 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960132024]
[2024-11-22 13:16:49,217 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960132024] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:49,217 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:49,218 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-22 13:16:49,218 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195027703]
[2024-11-22 13:16:49,218 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:49,218 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-22 13:16:49,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:49,220 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-22 13:16:49,220 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-22 13:16:49,220 INFO  L87              Difference]: Start difference. First operand 713 states and 959 transitions. Second operand  has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:49,677 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:49,677 INFO  L93              Difference]: Finished difference Result 1673 states and 2238 transitions.
[2024-11-22 13:16:49,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-22 13:16:49,678 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180
[2024-11-22 13:16:49,678 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:49,681 INFO  L225             Difference]: With dead ends: 1673
[2024-11-22 13:16:49,682 INFO  L226             Difference]: Without dead ends: 1031
[2024-11-22 13:16:49,683 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-22 13:16:49,683 INFO  L432           NwaCegarLoop]: 182 mSDtfsCounter, 276 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:49,684 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 478 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-22 13:16:49,684 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1031 states.
[2024-11-22 13:16:49,720 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 859.
[2024-11-22 13:16:49,721 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 859 states, 756 states have (on average 1.2552910052910053) internal successors, (949), 760 states have internal predecessors, (949), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 90 states have call predecessors, (94), 94 states have call successors, (94)
[2024-11-22 13:16:49,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1137 transitions.
[2024-11-22 13:16:49,724 INFO  L78                 Accepts]: Start accepts. Automaton has 859 states and 1137 transitions. Word has length 180
[2024-11-22 13:16:49,724 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:49,724 INFO  L471      AbstractCegarLoop]: Abstraction has 859 states and 1137 transitions.
[2024-11-22 13:16:49,724 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:49,724 INFO  L276                IsEmpty]: Start isEmpty. Operand 859 states and 1137 transitions.
[2024-11-22 13:16:49,725 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2024-11-22 13:16:49,725 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:49,725 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:49,725 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-22 13:16:49,726 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:49,726 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:49,726 INFO  L85        PathProgramCache]: Analyzing trace with hash 1539439672, now seen corresponding path program 1 times
[2024-11-22 13:16:49,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:49,726 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984926885]
[2024-11-22 13:16:49,726 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:49,726 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:49,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:49,990 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:49,990 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:49,990 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984926885]
[2024-11-22 13:16:49,991 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984926885] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:49,991 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:49,991 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-22 13:16:49,991 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799143002]
[2024-11-22 13:16:49,991 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:49,991 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-22 13:16:49,991 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:49,992 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-22 13:16:49,992 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-22 13:16:49,992 INFO  L87              Difference]: Start difference. First operand 859 states and 1137 transitions. Second operand  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:50,237 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:50,237 INFO  L93              Difference]: Finished difference Result 1595 states and 2117 transitions.
[2024-11-22 13:16:50,238 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-22 13:16:50,238 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180
[2024-11-22 13:16:50,238 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:50,241 INFO  L225             Difference]: With dead ends: 1595
[2024-11-22 13:16:50,242 INFO  L226             Difference]: Without dead ends: 807
[2024-11-22 13:16:50,243 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-22 13:16:50,243 INFO  L432           NwaCegarLoop]: 161 mSDtfsCounter, 114 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:50,244 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 580 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-22 13:16:50,244 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 807 states.
[2024-11-22 13:16:50,278 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 803.
[2024-11-22 13:16:50,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 803 states, 700 states have (on average 1.2585714285714287) internal successors, (881), 704 states have internal predecessors, (881), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 90 states have call predecessors, (94), 94 states have call successors, (94)
[2024-11-22 13:16:50,281 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1069 transitions.
[2024-11-22 13:16:50,282 INFO  L78                 Accepts]: Start accepts. Automaton has 803 states and 1069 transitions. Word has length 180
[2024-11-22 13:16:50,282 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:50,283 INFO  L471      AbstractCegarLoop]: Abstraction has 803 states and 1069 transitions.
[2024-11-22 13:16:50,283 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:50,283 INFO  L276                IsEmpty]: Start isEmpty. Operand 803 states and 1069 transitions.
[2024-11-22 13:16:50,284 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2024-11-22 13:16:50,284 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:50,284 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:50,285 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-11-22 13:16:50,285 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:50,285 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:50,285 INFO  L85        PathProgramCache]: Analyzing trace with hash 283067322, now seen corresponding path program 1 times
[2024-11-22 13:16:50,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:50,286 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238612213]
[2024-11-22 13:16:50,286 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:50,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:50,355 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:50,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:50,658 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:50,658 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238612213]
[2024-11-22 13:16:50,658 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238612213] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:50,658 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:50,658 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-22 13:16:50,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817600333]
[2024-11-22 13:16:50,658 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:50,659 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-22 13:16:50,660 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:50,660 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-22 13:16:50,660 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-22 13:16:50,660 INFO  L87              Difference]: Start difference. First operand 803 states and 1069 transitions. Second operand  has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:50,969 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:50,970 INFO  L93              Difference]: Finished difference Result 1686 states and 2234 transitions.
[2024-11-22 13:16:50,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-22 13:16:50,970 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180
[2024-11-22 13:16:50,971 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:50,975 INFO  L225             Difference]: With dead ends: 1686
[2024-11-22 13:16:50,975 INFO  L226             Difference]: Without dead ends: 954
[2024-11-22 13:16:50,977 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2024-11-22 13:16:50,977 INFO  L432           NwaCegarLoop]: 162 mSDtfsCounter, 296 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:50,977 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 437 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-22 13:16:50,978 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 954 states.
[2024-11-22 13:16:51,034 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 798.
[2024-11-22 13:16:51,035 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 798 states, 695 states have (on average 1.2474820143884893) internal successors, (867), 699 states have internal predecessors, (867), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 90 states have call predecessors, (94), 94 states have call successors, (94)
[2024-11-22 13:16:51,036 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1055 transitions.
[2024-11-22 13:16:51,037 INFO  L78                 Accepts]: Start accepts. Automaton has 798 states and 1055 transitions. Word has length 180
[2024-11-22 13:16:51,038 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:51,038 INFO  L471      AbstractCegarLoop]: Abstraction has 798 states and 1055 transitions.
[2024-11-22 13:16:51,038 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:51,038 INFO  L276                IsEmpty]: Start isEmpty. Operand 798 states and 1055 transitions.
[2024-11-22 13:16:51,039 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2024-11-22 13:16:51,039 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:51,039 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:51,039 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-22 13:16:51,039 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:51,039 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:51,040 INFO  L85        PathProgramCache]: Analyzing trace with hash -2088671940, now seen corresponding path program 1 times
[2024-11-22 13:16:51,040 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:51,040 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199864389]
[2024-11-22 13:16:51,040 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:51,040 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:51,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:51,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:51,299 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:51,299 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199864389]
[2024-11-22 13:16:51,299 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199864389] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:51,299 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:51,299 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-22 13:16:51,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269476025]
[2024-11-22 13:16:51,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:51,300 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-22 13:16:51,300 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:51,300 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-22 13:16:51,300 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-22 13:16:51,301 INFO  L87              Difference]: Start difference. First operand 798 states and 1055 transitions. Second operand  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:51,485 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:51,485 INFO  L93              Difference]: Finished difference Result 1462 states and 1932 transitions.
[2024-11-22 13:16:51,486 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-22 13:16:51,486 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180
[2024-11-22 13:16:51,486 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:51,489 INFO  L225             Difference]: With dead ends: 1462
[2024-11-22 13:16:51,489 INFO  L226             Difference]: Without dead ends: 735
[2024-11-22 13:16:51,491 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-22 13:16:51,491 INFO  L432           NwaCegarLoop]: 162 mSDtfsCounter, 17 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:51,491 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 577 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-22 13:16:51,492 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 735 states.
[2024-11-22 13:16:51,525 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735.
[2024-11-22 13:16:51,526 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 735 states, 632 states have (on average 1.2373417721518987) internal successors, (782), 636 states have internal predecessors, (782), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 90 states have call predecessors, (94), 94 states have call successors, (94)
[2024-11-22 13:16:51,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 970 transitions.
[2024-11-22 13:16:51,529 INFO  L78                 Accepts]: Start accepts. Automaton has 735 states and 970 transitions. Word has length 180
[2024-11-22 13:16:51,529 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:51,529 INFO  L471      AbstractCegarLoop]: Abstraction has 735 states and 970 transitions.
[2024-11-22 13:16:51,529 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:51,529 INFO  L276                IsEmpty]: Start isEmpty. Operand 735 states and 970 transitions.
[2024-11-22 13:16:51,530 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2024-11-22 13:16:51,530 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:51,530 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:51,530 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-11-22 13:16:51,530 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:51,531 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:51,531 INFO  L85        PathProgramCache]: Analyzing trace with hash -1948123330, now seen corresponding path program 1 times
[2024-11-22 13:16:51,531 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:51,531 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706688227]
[2024-11-22 13:16:51,531 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:51,531 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:51,622 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:52,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:52,500 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:52,501 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706688227]
[2024-11-22 13:16:52,501 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706688227] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:52,501 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:52,501 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-22 13:16:52,502 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32865786]
[2024-11-22 13:16:52,503 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:52,503 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-22 13:16:52,503 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:52,504 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-22 13:16:52,504 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2024-11-22 13:16:52,504 INFO  L87              Difference]: Start difference. First operand 735 states and 970 transitions. Second operand  has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:53,273 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:53,273 INFO  L93              Difference]: Finished difference Result 1491 states and 1965 transitions.
[2024-11-22 13:16:53,273 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-22 13:16:53,273 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180
[2024-11-22 13:16:53,274 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:53,277 INFO  L225             Difference]: With dead ends: 1491
[2024-11-22 13:16:53,277 INFO  L226             Difference]: Without dead ends: 827
[2024-11-22 13:16:53,278 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240
[2024-11-22 13:16:53,278 INFO  L432           NwaCegarLoop]: 180 mSDtfsCounter, 168 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:53,278 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1084 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-22 13:16:53,279 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 827 states.
[2024-11-22 13:16:53,315 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 741.
[2024-11-22 13:16:53,316 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 741 states, 638 states have (on average 1.2398119122257054) internal successors, (791), 642 states have internal predecessors, (791), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 90 states have call predecessors, (94), 94 states have call successors, (94)
[2024-11-22 13:16:53,318 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 979 transitions.
[2024-11-22 13:16:53,319 INFO  L78                 Accepts]: Start accepts. Automaton has 741 states and 979 transitions. Word has length 180
[2024-11-22 13:16:53,319 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:53,319 INFO  L471      AbstractCegarLoop]: Abstraction has 741 states and 979 transitions.
[2024-11-22 13:16:53,319 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:53,319 INFO  L276                IsEmpty]: Start isEmpty. Operand 741 states and 979 transitions.
[2024-11-22 13:16:53,320 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2024-11-22 13:16:53,320 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:53,320 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:53,320 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-11-22 13:16:53,320 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:53,321 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:53,321 INFO  L85        PathProgramCache]: Analyzing trace with hash 1645779388, now seen corresponding path program 1 times
[2024-11-22 13:16:53,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:53,321 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867132825]
[2024-11-22 13:16:53,321 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:53,321 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:53,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:53,645 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:53,646 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:53,646 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867132825]
[2024-11-22 13:16:53,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867132825] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:53,646 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:53,646 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-22 13:16:53,646 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471547809]
[2024-11-22 13:16:53,646 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:53,647 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-22 13:16:53,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:53,647 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-22 13:16:53,647 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-22 13:16:53,647 INFO  L87              Difference]: Start difference. First operand 741 states and 979 transitions. Second operand  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:53,954 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:53,954 INFO  L93              Difference]: Finished difference Result 1502 states and 1972 transitions.
[2024-11-22 13:16:53,955 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-22 13:16:53,955 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180
[2024-11-22 13:16:53,955 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:53,959 INFO  L225             Difference]: With dead ends: 1502
[2024-11-22 13:16:53,959 INFO  L226             Difference]: Without dead ends: 832
[2024-11-22 13:16:53,960 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-22 13:16:53,961 INFO  L432           NwaCegarLoop]: 182 mSDtfsCounter, 37 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:53,961 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 736 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-22 13:16:53,962 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 832 states.
[2024-11-22 13:16:54,022 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 741.
[2024-11-22 13:16:54,023 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 741 states, 638 states have (on average 1.2304075235109717) internal successors, (785), 642 states have internal predecessors, (785), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 90 states have call predecessors, (94), 94 states have call successors, (94)
[2024-11-22 13:16:54,025 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 973 transitions.
[2024-11-22 13:16:54,026 INFO  L78                 Accepts]: Start accepts. Automaton has 741 states and 973 transitions. Word has length 180
[2024-11-22 13:16:54,026 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:54,027 INFO  L471      AbstractCegarLoop]: Abstraction has 741 states and 973 transitions.
[2024-11-22 13:16:54,027 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:54,027 INFO  L276                IsEmpty]: Start isEmpty. Operand 741 states and 973 transitions.
[2024-11-22 13:16:54,028 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2024-11-22 13:16:54,028 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:54,028 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:54,030 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-11-22 13:16:54,030 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:54,031 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:54,031 INFO  L85        PathProgramCache]: Analyzing trace with hash -1369324230, now seen corresponding path program 1 times
[2024-11-22 13:16:54,031 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:54,031 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947771110]
[2024-11-22 13:16:54,031 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:54,031 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:54,094 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:55,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:55,241 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:55,241 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947771110]
[2024-11-22 13:16:55,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947771110] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:55,241 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:55,241 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-22 13:16:55,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059398744]
[2024-11-22 13:16:55,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:55,242 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-22 13:16:55,242 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:55,242 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-22 13:16:55,242 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2024-11-22 13:16:55,243 INFO  L87              Difference]: Start difference. First operand 741 states and 973 transitions. Second operand  has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23)
[2024-11-22 13:16:56,004 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:56,004 INFO  L93              Difference]: Finished difference Result 1477 states and 1932 transitions.
[2024-11-22 13:16:56,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-22 13:16:56,005 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 180
[2024-11-22 13:16:56,005 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:56,008 INFO  L225             Difference]: With dead ends: 1477
[2024-11-22 13:16:56,008 INFO  L226             Difference]: Without dead ends: 807
[2024-11-22 13:16:56,009 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182
[2024-11-22 13:16:56,010 INFO  L432           NwaCegarLoop]: 152 mSDtfsCounter, 290 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:56,010 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 558 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-22 13:16:56,010 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 807 states.
[2024-11-22 13:16:56,045 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 706.
[2024-11-22 13:16:56,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 706 states, 605 states have (on average 1.2181818181818183) internal successors, (737), 608 states have internal predecessors, (737), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92)
[2024-11-22 13:16:56,047 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 921 transitions.
[2024-11-22 13:16:56,048 INFO  L78                 Accepts]: Start accepts. Automaton has 706 states and 921 transitions. Word has length 180
[2024-11-22 13:16:56,048 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:56,048 INFO  L471      AbstractCegarLoop]: Abstraction has 706 states and 921 transitions.
[2024-11-22 13:16:56,048 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23)
[2024-11-22 13:16:56,048 INFO  L276                IsEmpty]: Start isEmpty. Operand 706 states and 921 transitions.
[2024-11-22 13:16:56,049 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 182
[2024-11-22 13:16:56,049 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:56,049 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:56,050 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-11-22 13:16:56,050 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:56,050 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:56,050 INFO  L85        PathProgramCache]: Analyzing trace with hash 1216724627, now seen corresponding path program 1 times
[2024-11-22 13:16:56,050 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:56,050 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635729163]
[2024-11-22 13:16:56,050 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:56,051 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:56,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:57,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:57,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:57,516 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635729163]
[2024-11-22 13:16:57,516 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635729163] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:57,516 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:57,516 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-22 13:16:57,516 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920222955]
[2024-11-22 13:16:57,516 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:57,517 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-22 13:16:57,517 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:57,517 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-22 13:16:57,517 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2024-11-22 13:16:57,517 INFO  L87              Difference]: Start difference. First operand 706 states and 921 transitions. Second operand  has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23)
[2024-11-22 13:16:58,089 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:58,089 INFO  L93              Difference]: Finished difference Result 1354 states and 1759 transitions.
[2024-11-22 13:16:58,090 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-22 13:16:58,090 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 181
[2024-11-22 13:16:58,090 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:58,093 INFO  L225             Difference]: With dead ends: 1354
[2024-11-22 13:16:58,093 INFO  L226             Difference]: Without dead ends: 887
[2024-11-22 13:16:58,095 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210
[2024-11-22 13:16:58,095 INFO  L432           NwaCegarLoop]: 118 mSDtfsCounter, 559 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:58,095 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 412 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-22 13:16:58,096 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 887 states.
[2024-11-22 13:16:58,134 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 730.
[2024-11-22 13:16:58,135 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 730 states, 629 states have (on average 1.21939586645469) internal successors, (767), 632 states have internal predecessors, (767), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92)
[2024-11-22 13:16:58,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 951 transitions.
[2024-11-22 13:16:58,137 INFO  L78                 Accepts]: Start accepts. Automaton has 730 states and 951 transitions. Word has length 181
[2024-11-22 13:16:58,137 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:58,137 INFO  L471      AbstractCegarLoop]: Abstraction has 730 states and 951 transitions.
[2024-11-22 13:16:58,137 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23)
[2024-11-22 13:16:58,137 INFO  L276                IsEmpty]: Start isEmpty. Operand 730 states and 951 transitions.
[2024-11-22 13:16:58,138 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 182
[2024-11-22 13:16:58,138 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:58,138 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:58,139 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-11-22 13:16:58,139 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:58,139 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:58,139 INFO  L85        PathProgramCache]: Analyzing trace with hash -1798378991, now seen corresponding path program 1 times
[2024-11-22 13:16:58,139 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:58,139 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857560992]
[2024-11-22 13:16:58,139 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:58,140 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:58,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:16:58,730 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:16:58,730 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:16:58,730 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857560992]
[2024-11-22 13:16:58,730 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857560992] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:16:58,731 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:16:58,731 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2024-11-22 13:16:58,731 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692128386]
[2024-11-22 13:16:58,731 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:16:58,732 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-22 13:16:58,732 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:16:58,732 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-22 13:16:58,732 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2024-11-22 13:16:58,733 INFO  L87              Difference]: Start difference. First operand 730 states and 951 transitions. Second operand  has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:59,336 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:16:59,337 INFO  L93              Difference]: Finished difference Result 1389 states and 1810 transitions.
[2024-11-22 13:16:59,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-22 13:16:59,337 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181
[2024-11-22 13:16:59,338 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:16:59,341 INFO  L225             Difference]: With dead ends: 1389
[2024-11-22 13:16:59,341 INFO  L226             Difference]: Without dead ends: 898
[2024-11-22 13:16:59,342 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272
[2024-11-22 13:16:59,343 INFO  L432           NwaCegarLoop]: 152 mSDtfsCounter, 164 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-22 13:16:59,343 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 967 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-22 13:16:59,344 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 898 states.
[2024-11-22 13:16:59,409 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 770.
[2024-11-22 13:16:59,410 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 770 states, 669 states have (on average 1.2212257100149477) internal successors, (817), 672 states have internal predecessors, (817), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92)
[2024-11-22 13:16:59,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1001 transitions.
[2024-11-22 13:16:59,413 INFO  L78                 Accepts]: Start accepts. Automaton has 770 states and 1001 transitions. Word has length 181
[2024-11-22 13:16:59,413 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:16:59,414 INFO  L471      AbstractCegarLoop]: Abstraction has 770 states and 1001 transitions.
[2024-11-22 13:16:59,414 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:16:59,414 INFO  L276                IsEmpty]: Start isEmpty. Operand 770 states and 1001 transitions.
[2024-11-22 13:16:59,415 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 182
[2024-11-22 13:16:59,415 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:16:59,415 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:16:59,416 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-11-22 13:16:59,416 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:16:59,416 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:16:59,416 INFO  L85        PathProgramCache]: Analyzing trace with hash 1353615445, now seen corresponding path program 1 times
[2024-11-22 13:16:59,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:16:59,417 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007802155]
[2024-11-22 13:16:59,417 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:16:59,417 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:16:59,499 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:17:01,075 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:17:01,076 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:17:01,076 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007802155]
[2024-11-22 13:17:01,076 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007802155] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:17:01,076 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:17:01,076 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-22 13:17:01,076 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375032960]
[2024-11-22 13:17:01,076 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:17:01,077 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-22 13:17:01,077 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:17:01,077 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-22 13:17:01,077 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2024-11-22 13:17:01,078 INFO  L87              Difference]: Start difference. First operand 770 states and 1001 transitions. Second operand  has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23)
[2024-11-22 13:17:01,639 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:17:01,639 INFO  L93              Difference]: Finished difference Result 1441 states and 1873 transitions.
[2024-11-22 13:17:01,640 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-22 13:17:01,640 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 181
[2024-11-22 13:17:01,640 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:17:01,643 INFO  L225             Difference]: With dead ends: 1441
[2024-11-22 13:17:01,644 INFO  L226             Difference]: Without dead ends: 910
[2024-11-22 13:17:01,645 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210
[2024-11-22 13:17:01,645 INFO  L432           NwaCegarLoop]: 133 mSDtfsCounter, 328 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-22 13:17:01,645 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 509 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-22 13:17:01,646 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 910 states.
[2024-11-22 13:17:01,690 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 772.
[2024-11-22 13:17:01,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 772 states, 671 states have (on average 1.217585692995529) internal successors, (817), 674 states have internal predecessors, (817), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92)
[2024-11-22 13:17:01,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1001 transitions.
[2024-11-22 13:17:01,693 INFO  L78                 Accepts]: Start accepts. Automaton has 772 states and 1001 transitions. Word has length 181
[2024-11-22 13:17:01,693 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:17:01,693 INFO  L471      AbstractCegarLoop]: Abstraction has 772 states and 1001 transitions.
[2024-11-22 13:17:01,694 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23)
[2024-11-22 13:17:01,694 INFO  L276                IsEmpty]: Start isEmpty. Operand 772 states and 1001 transitions.
[2024-11-22 13:17:01,695 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 182
[2024-11-22 13:17:01,695 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:17:01,695 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:17:01,695 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-11-22 13:17:01,695 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:17:01,696 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:17:01,696 INFO  L85        PathProgramCache]: Analyzing trace with hash 791923405, now seen corresponding path program 1 times
[2024-11-22 13:17:01,696 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:17:01,696 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722919730]
[2024-11-22 13:17:01,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:17:01,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:17:01,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:17:03,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:17:03,310 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:17:03,310 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722919730]
[2024-11-22 13:17:03,310 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722919730] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:17:03,311 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:17:03,311 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-22 13:17:03,311 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450249973]
[2024-11-22 13:17:03,311 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:17:03,311 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-22 13:17:03,311 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:17:03,312 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-22 13:17:03,312 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2024-11-22 13:17:03,312 INFO  L87              Difference]: Start difference. First operand 772 states and 1001 transitions. Second operand  has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23)
[2024-11-22 13:17:04,104 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:17:04,105 INFO  L93              Difference]: Finished difference Result 1459 states and 1892 transitions.
[2024-11-22 13:17:04,105 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-22 13:17:04,105 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 181
[2024-11-22 13:17:04,105 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:17:04,109 INFO  L225             Difference]: With dead ends: 1459
[2024-11-22 13:17:04,110 INFO  L226             Difference]: Without dead ends: 926
[2024-11-22 13:17:04,111 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182
[2024-11-22 13:17:04,111 INFO  L432           NwaCegarLoop]: 141 mSDtfsCounter, 285 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-22 13:17:04,112 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 534 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-22 13:17:04,113 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 926 states.
[2024-11-22 13:17:04,192 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 782.
[2024-11-22 13:17:04,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 782 states, 681 states have (on average 1.2173274596182084) internal successors, (829), 684 states have internal predecessors, (829), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92)
[2024-11-22 13:17:04,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1013 transitions.
[2024-11-22 13:17:04,198 INFO  L78                 Accepts]: Start accepts. Automaton has 782 states and 1013 transitions. Word has length 181
[2024-11-22 13:17:04,199 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:17:04,200 INFO  L471      AbstractCegarLoop]: Abstraction has 782 states and 1013 transitions.
[2024-11-22 13:17:04,200 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23)
[2024-11-22 13:17:04,200 INFO  L276                IsEmpty]: Start isEmpty. Operand 782 states and 1013 transitions.
[2024-11-22 13:17:04,201 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 182
[2024-11-22 13:17:04,201 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:17:04,201 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:17:04,202 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-11-22 13:17:04,202 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:17:04,202 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:17:04,202 INFO  L85        PathProgramCache]: Analyzing trace with hash 906181969, now seen corresponding path program 1 times
[2024-11-22 13:17:04,202 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:17:04,202 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744286826]
[2024-11-22 13:17:04,203 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:17:04,203 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:17:04,287 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:17:06,659 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:17:06,659 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:17:06,659 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744286826]
[2024-11-22 13:17:06,660 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744286826] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:17:06,660 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:17:06,660 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2024-11-22 13:17:06,660 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125818764]
[2024-11-22 13:17:06,660 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:17:06,660 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-11-22 13:17:06,660 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:17:06,661 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-22 13:17:06,661 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240
[2024-11-22 13:17:06,661 INFO  L87              Difference]: Start difference. First operand 782 states and 1013 transitions. Second operand  has 16 states, 14 states have (on average 4.928571428571429) internal successors, (69), 16 states have internal predecessors, (69), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23)
[2024-11-22 13:17:08,162 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:17:08,163 INFO  L93              Difference]: Finished difference Result 1453 states and 1882 transitions.
[2024-11-22 13:17:08,163 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-11-22 13:17:08,163 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 14 states have (on average 4.928571428571429) internal successors, (69), 16 states have internal predecessors, (69), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) Word has length 181
[2024-11-22 13:17:08,164 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:17:08,167 INFO  L225             Difference]: With dead ends: 1453
[2024-11-22 13:17:08,167 INFO  L226             Difference]: Without dead ends: 910
[2024-11-22 13:17:08,168 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506
[2024-11-22 13:17:08,169 INFO  L432           NwaCegarLoop]: 140 mSDtfsCounter, 286 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2024-11-22 13:17:08,169 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1099 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2024-11-22 13:17:08,170 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 910 states.
[2024-11-22 13:17:08,222 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 786.
[2024-11-22 13:17:08,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 786 states, 685 states have (on average 1.216058394160584) internal successors, (833), 688 states have internal predecessors, (833), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92)
[2024-11-22 13:17:08,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1017 transitions.
[2024-11-22 13:17:08,225 INFO  L78                 Accepts]: Start accepts. Automaton has 786 states and 1017 transitions. Word has length 181
[2024-11-22 13:17:08,226 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:17:08,226 INFO  L471      AbstractCegarLoop]: Abstraction has 786 states and 1017 transitions.
[2024-11-22 13:17:08,226 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 14 states have (on average 4.928571428571429) internal successors, (69), 16 states have internal predecessors, (69), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23)
[2024-11-22 13:17:08,226 INFO  L276                IsEmpty]: Start isEmpty. Operand 786 states and 1017 transitions.
[2024-11-22 13:17:08,227 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 182
[2024-11-22 13:17:08,227 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:17:08,227 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:17:08,227 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-11-22 13:17:08,227 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:17:08,227 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:17:08,228 INFO  L85        PathProgramCache]: Analyzing trace with hash 1484981069, now seen corresponding path program 1 times
[2024-11-22 13:17:08,228 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:17:08,228 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244707512]
[2024-11-22 13:17:08,228 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:17:08,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:17:08,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:17:09,746 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:17:09,747 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:17:09,747 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244707512]
[2024-11-22 13:17:09,747 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244707512] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:17:09,747 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:17:09,747 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-22 13:17:09,747 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637636588]
[2024-11-22 13:17:09,747 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:17:09,748 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-22 13:17:09,748 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:17:09,749 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-22 13:17:09,750 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2024-11-22 13:17:09,750 INFO  L87              Difference]: Start difference. First operand 786 states and 1017 transitions. Second operand  has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23)
[2024-11-22 13:17:10,394 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:17:10,394 INFO  L93              Difference]: Finished difference Result 1432 states and 1841 transitions.
[2024-11-22 13:17:10,397 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-22 13:17:10,398 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 181
[2024-11-22 13:17:10,398 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:17:10,401 INFO  L225             Difference]: With dead ends: 1432
[2024-11-22 13:17:10,401 INFO  L226             Difference]: Without dead ends: 885
[2024-11-22 13:17:10,402 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182
[2024-11-22 13:17:10,402 INFO  L432           NwaCegarLoop]: 147 mSDtfsCounter, 434 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-22 13:17:10,403 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 490 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-22 13:17:10,403 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 885 states.
[2024-11-22 13:17:10,454 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 689.
[2024-11-22 13:17:10,454 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 689 states, 592 states have (on average 1.2094594594594594) internal successors, (716), 593 states have internal predecessors, (716), 88 states have call successors, (88), 8 states have call predecessors, (88), 8 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88)
[2024-11-22 13:17:10,455 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 892 transitions.
[2024-11-22 13:17:10,456 INFO  L78                 Accepts]: Start accepts. Automaton has 689 states and 892 transitions. Word has length 181
[2024-11-22 13:17:10,456 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:17:10,457 INFO  L471      AbstractCegarLoop]: Abstraction has 689 states and 892 transitions.
[2024-11-22 13:17:10,457 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23)
[2024-11-22 13:17:10,457 INFO  L276                IsEmpty]: Start isEmpty. Operand 689 states and 892 transitions.
[2024-11-22 13:17:10,457 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 183
[2024-11-22 13:17:10,458 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:17:10,458 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:17:10,458 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-11-22 13:17:10,458 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:17:10,458 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:17:10,458 INFO  L85        PathProgramCache]: Analyzing trace with hash -766777443, now seen corresponding path program 1 times
[2024-11-22 13:17:10,458 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:17:10,459 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400550872]
[2024-11-22 13:17:10,459 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:17:10,459 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:17:10,497 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:17:10,618 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked.
[2024-11-22 13:17:10,618 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:17:10,618 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400550872]
[2024-11-22 13:17:10,618 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400550872] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-22 13:17:10,618 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767615897]
[2024-11-22 13:17:10,619 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:17:10,619 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 13:17:10,619 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 13:17:10,621 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-22 13:17:10,625 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-22 13:17:10,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:17:10,943 INFO  L255         TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-22 13:17:10,946 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 13:17:10,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:17:10,961 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-22 13:17:10,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767615897] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:17:10,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-22 13:17:10,962 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8
[2024-11-22 13:17:10,962 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558898698]
[2024-11-22 13:17:10,962 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:17:10,962 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-22 13:17:10,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:17:10,963 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-22 13:17:10,963 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-22 13:17:10,963 INFO  L87              Difference]: Start difference. First operand 689 states and 892 transitions. Second operand  has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:11,030 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:17:11,030 INFO  L93              Difference]: Finished difference Result 1316 states and 1699 transitions.
[2024-11-22 13:17:11,034 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-22 13:17:11,034 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182
[2024-11-22 13:17:11,035 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:17:11,037 INFO  L225             Difference]: With dead ends: 1316
[2024-11-22 13:17:11,037 INFO  L226             Difference]: Without dead ends: 698
[2024-11-22 13:17:11,038 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-22 13:17:11,043 INFO  L432           NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 13:17:11,043 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 636 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 13:17:11,044 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 698 states.
[2024-11-22 13:17:11,101 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698.
[2024-11-22 13:17:11,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 698 states, 601 states have (on average 1.2063227953410982) internal successors, (725), 602 states have internal predecessors, (725), 88 states have call successors, (88), 8 states have call predecessors, (88), 8 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88)
[2024-11-22 13:17:11,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 901 transitions.
[2024-11-22 13:17:11,103 INFO  L78                 Accepts]: Start accepts. Automaton has 698 states and 901 transitions. Word has length 182
[2024-11-22 13:17:11,104 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:17:11,104 INFO  L471      AbstractCegarLoop]: Abstraction has 698 states and 901 transitions.
[2024-11-22 13:17:11,104 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:11,104 INFO  L276                IsEmpty]: Start isEmpty. Operand 698 states and 901 transitions.
[2024-11-22 13:17:11,105 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 185
[2024-11-22 13:17:11,105 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:17:11,105 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:17:11,116 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-11-22 13:17:11,306 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-22 13:17:11,306 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:17:11,307 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:17:11,307 INFO  L85        PathProgramCache]: Analyzing trace with hash -2066033000, now seen corresponding path program 1 times
[2024-11-22 13:17:11,307 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:17:11,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194914745]
[2024-11-22 13:17:11,307 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:17:11,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:17:11,357 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:17:11,810 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:17:11,810 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-22 13:17:11,811 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194914745]
[2024-11-22 13:17:11,811 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194914745] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:17:11,811 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:17:11,811 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-22 13:17:11,811 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537049665]
[2024-11-22 13:17:11,811 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:17:11,811 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-22 13:17:11,811 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-22 13:17:11,812 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-22 13:17:11,812 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-11-22 13:17:11,812 INFO  L87              Difference]: Start difference. First operand 698 states and 901 transitions. Second operand  has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:12,218 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:17:12,218 INFO  L93              Difference]: Finished difference Result 929 states and 1192 transitions.
[2024-11-22 13:17:12,218 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-11-22 13:17:12,219 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 184
[2024-11-22 13:17:12,219 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:17:12,222 INFO  L225             Difference]: With dead ends: 929
[2024-11-22 13:17:12,222 INFO  L226             Difference]: Without dead ends: 927
[2024-11-22 13:17:12,222 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306
[2024-11-22 13:17:12,223 INFO  L432           NwaCegarLoop]: 141 mSDtfsCounter, 327 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-22 13:17:12,223 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 759 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-22 13:17:12,224 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 927 states.
[2024-11-22 13:17:12,282 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 896.
[2024-11-22 13:17:12,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 896 states, 799 states have (on average 1.2127659574468086) internal successors, (969), 800 states have internal predecessors, (969), 88 states have call successors, (88), 8 states have call predecessors, (88), 8 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88)
[2024-11-22 13:17:12,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1145 transitions.
[2024-11-22 13:17:12,285 INFO  L78                 Accepts]: Start accepts. Automaton has 896 states and 1145 transitions. Word has length 184
[2024-11-22 13:17:12,285 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:17:12,285 INFO  L471      AbstractCegarLoop]: Abstraction has 896 states and 1145 transitions.
[2024-11-22 13:17:12,285 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:12,285 INFO  L276                IsEmpty]: Start isEmpty. Operand 896 states and 1145 transitions.
[2024-11-22 13:17:12,286 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 185
[2024-11-22 13:17:12,286 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:17:12,286 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:17:12,287 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-11-22 13:17:12,287 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:17:12,287 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:17:12,287 INFO  L85        PathProgramCache]: Analyzing trace with hash 1384928794, now seen corresponding path program 1 times
[2024-11-22 13:17:12,287 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-22 13:17:12,287 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190265540]
[2024-11-22 13:17:12,287 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:17:12,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-22 13:17:12,352 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-22 13:17:12,352 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-22 13:17:12,403 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-22 13:17:12,487 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-22 13:17:12,487 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-22 13:17:12,487 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-22 13:17:12,490 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-11-22 13:17:12,492 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:17:12,647 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-22 13:17:12,649 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:17:12 BoogieIcfgContainer
[2024-11-22 13:17:12,649 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-22 13:17:12,649 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-22 13:17:12,649 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-22 13:17:12,649 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-22 13:17:12,650 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:16:34" (3/4) ...
[2024-11-22 13:17:12,652 INFO  L145         WitnessPrinter]: No result that supports witness generation found
[2024-11-22 13:17:12,652 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-22 13:17:12,653 INFO  L158              Benchmark]: Toolchain (without parser) took 39584.95ms. Allocated memory was 192.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 121.6MB in the beginning and 1.1GB in the end (delta: -962.6MB). Peak memory consumption was 387.6MB. Max. memory is 16.1GB.
[2024-11-22 13:17:12,653 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 192.9MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-22 13:17:12,653 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 286.48ms. Allocated memory is still 192.9MB. Free memory was 121.4MB in the beginning and 103.7MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-11-22 13:17:12,653 INFO  L158              Benchmark]: Boogie Procedure Inliner took 90.81ms. Allocated memory is still 192.9MB. Free memory was 103.7MB in the beginning and 162.3MB in the end (delta: -58.6MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB.
[2024-11-22 13:17:12,653 INFO  L158              Benchmark]: Boogie Preprocessor took 102.72ms. Allocated memory is still 192.9MB. Free memory was 162.3MB in the beginning and 159.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-22 13:17:12,654 INFO  L158              Benchmark]: RCFGBuilder took 716.30ms. Allocated memory is still 192.9MB. Free memory was 159.7MB in the beginning and 123.1MB in the end (delta: 36.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB.
[2024-11-22 13:17:12,654 INFO  L158              Benchmark]: TraceAbstraction took 38380.63ms. Allocated memory was 192.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 122.1MB in the beginning and 1.1GB in the end (delta: -963.2MB). Peak memory consumption was 388.3MB. Max. memory is 16.1GB.
[2024-11-22 13:17:12,654 INFO  L158              Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 1.5GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-22 13:17:12,655 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.18ms. Allocated memory is still 192.9MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 286.48ms. Allocated memory is still 192.9MB. Free memory was 121.4MB in the beginning and 103.7MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 90.81ms. Allocated memory is still 192.9MB. Free memory was 103.7MB in the beginning and 162.3MB in the end (delta: -58.6MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 102.72ms. Allocated memory is still 192.9MB. Free memory was 162.3MB in the beginning and 159.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 716.30ms. Allocated memory is still 192.9MB. Free memory was 159.7MB in the beginning and 123.1MB in the end (delta: 36.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 38380.63ms. Allocated memory was 192.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 122.1MB in the beginning and 1.1GB in the end (delta: -963.2MB). Peak memory consumption was 388.3MB. Max. memory is 16.1GB.
 * Witness Printer took 3.28ms. Allocated memory is still 1.5GB. Free memory is still 1.1GB. 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 143. 
Possible FailurePath: 
[L40]                    unsigned char isInitial = 0;
[L41-L58]                struct WrapperStruct00 WrapperStruct00 = {
 16.6,
 1,
 1,
 10.6,
 0,
 1,
 0,
 0,
 10,
 100,
 64,
 100,
 -4,
 32,
 4,
 64
};
[L59]                    double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1);
[L60]                    unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2);
[L61]                    unsigned char* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3);
[L62]                    double* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4);
[L63]                    unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5);
[L64]                    unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7);
[L65]                    unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8);
[L66]                    unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9);
[L67]                    signed char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10);
[L68]                    unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11);
[L69]                    unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12);
[L70]                    unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13);
[L71]                    signed char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14);
[L72]                    signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15);
[L73]                    signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16);
[L74]                    signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17);
[L75]                    unsigned char last_1_WrapperStruct00_var_1_5 = 0;
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=0, last_1_WrapperStruct00_var_1_5=0]
[L147]                   isInitial = 1
[L148]       FCALL       initially()
[L149]       COND TRUE   1
[L150]       CALL        updateLastVariables()
[L140]       EXPR        WrapperStruct00.var_1_5
[L140]                   last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5
[L150]       RET         updateLastVariables()
[L151]       CALL        updateVariables()
[L103]                   WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar()
[L104]       EXPR        WrapperStruct00.var_1_2
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L104]       CALL        assume_abort_if_not(WrapperStruct00.var_1_2 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L104]       RET         assume_abort_if_not(WrapperStruct00.var_1_2 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L105]       EXPR        WrapperStruct00.var_1_2
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L105]       CALL        assume_abort_if_not(WrapperStruct00.var_1_2 <= 1)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L105]       RET         assume_abort_if_not(WrapperStruct00.var_1_2 <= 1)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L106]                   WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar()
[L107]       EXPR        WrapperStruct00.var_1_3
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L107]       CALL        assume_abort_if_not(WrapperStruct00.var_1_3 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L107]       RET         assume_abort_if_not(WrapperStruct00.var_1_3 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L108]       EXPR        WrapperStruct00.var_1_3
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L108]       CALL        assume_abort_if_not(WrapperStruct00.var_1_3 <= 1)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L108]       RET         assume_abort_if_not(WrapperStruct00.var_1_3 <= 1)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L109]                   WrapperStruct00.var_1_4 = __VERIFIER_nondet_double()
[L110]       EXPR        WrapperStruct00.var_1_4
[L110]       EXPR        WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F
[L110]       EXPR        WrapperStruct00.var_1_4
[L110]       EXPR        WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L110]       EXPR        (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L110]       CALL        assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L110]       RET         assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L111]                   WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar()
[L112]       EXPR        WrapperStruct00.var_1_7
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L112]       CALL        assume_abort_if_not(WrapperStruct00.var_1_7 >= 1)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L112]       RET         assume_abort_if_not(WrapperStruct00.var_1_7 >= 1)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L113]       EXPR        WrapperStruct00.var_1_7
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L113]       CALL        assume_abort_if_not(WrapperStruct00.var_1_7 <= 1)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L113]       RET         assume_abort_if_not(WrapperStruct00.var_1_7 <= 1)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L114]                   WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar()
[L115]       EXPR        WrapperStruct00.var_1_8
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L115]       CALL        assume_abort_if_not(WrapperStruct00.var_1_8 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L115]       RET         assume_abort_if_not(WrapperStruct00.var_1_8 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L116]       EXPR        WrapperStruct00.var_1_8
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L116]       CALL        assume_abort_if_not(WrapperStruct00.var_1_8 <= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L116]       RET         assume_abort_if_not(WrapperStruct00.var_1_8 <= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L117]                   WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar()
[L118]       EXPR        WrapperStruct00.var_1_9
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L118]       CALL        assume_abort_if_not(WrapperStruct00.var_1_9 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L118]       RET         assume_abort_if_not(WrapperStruct00.var_1_9 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L119]       EXPR        WrapperStruct00.var_1_9
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L119]       CALL        assume_abort_if_not(WrapperStruct00.var_1_9 <= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L119]       RET         assume_abort_if_not(WrapperStruct00.var_1_9 <= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L120]                   WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar()
[L121]       EXPR        WrapperStruct00.var_1_11
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L121]       CALL        assume_abort_if_not(WrapperStruct00.var_1_11 >= 63)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L121]       RET         assume_abort_if_not(WrapperStruct00.var_1_11 >= 63)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L122]       EXPR        WrapperStruct00.var_1_11
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L122]       CALL        assume_abort_if_not(WrapperStruct00.var_1_11 <= 128)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L122]       RET         assume_abort_if_not(WrapperStruct00.var_1_11 <= 128)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L123]                   WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar()
[L124]       EXPR        WrapperStruct00.var_1_12
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L124]       CALL        assume_abort_if_not(WrapperStruct00.var_1_12 >= 64)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L124]       RET         assume_abort_if_not(WrapperStruct00.var_1_12 >= 64)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L125]       EXPR        WrapperStruct00.var_1_12
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L125]       CALL        assume_abort_if_not(WrapperStruct00.var_1_12 <= 127)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L125]       RET         assume_abort_if_not(WrapperStruct00.var_1_12 <= 127)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L126]                   WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar()
[L127]       EXPR        WrapperStruct00.var_1_13
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L127]       CALL        assume_abort_if_not(WrapperStruct00.var_1_13 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L127]       RET         assume_abort_if_not(WrapperStruct00.var_1_13 >= 0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L128]       EXPR        WrapperStruct00.var_1_13
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L128]       CALL        assume_abort_if_not(WrapperStruct00.var_1_13 <= 127)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L128]       RET         assume_abort_if_not(WrapperStruct00.var_1_13 <= 127)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L129]                   WrapperStruct00.var_1_14 = __VERIFIER_nondet_char()
[L130]       EXPR        WrapperStruct00.var_1_14
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L130]       CALL        assume_abort_if_not(WrapperStruct00.var_1_14 >= -63)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L130]       RET         assume_abort_if_not(WrapperStruct00.var_1_14 >= -63)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L131]       EXPR        WrapperStruct00.var_1_14
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L131]       CALL        assume_abort_if_not(WrapperStruct00.var_1_14 <= 63)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L131]       RET         assume_abort_if_not(WrapperStruct00.var_1_14 <= 63)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L132]                   WrapperStruct00.var_1_15 = __VERIFIER_nondet_char()
[L133]       EXPR        WrapperStruct00.var_1_15
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L133]       CALL        assume_abort_if_not(WrapperStruct00.var_1_15 >= -63)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L133]       RET         assume_abort_if_not(WrapperStruct00.var_1_15 >= -63)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L134]       EXPR        WrapperStruct00.var_1_15
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L134]       CALL        assume_abort_if_not(WrapperStruct00.var_1_15 <= 63)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L134]       RET         assume_abort_if_not(WrapperStruct00.var_1_15 <= 63)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L135]                   WrapperStruct00.var_1_16 = __VERIFIER_nondet_char()
[L136]       EXPR        WrapperStruct00.var_1_16
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L136]       CALL        assume_abort_if_not(WrapperStruct00.var_1_16 >= -127)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L136]       RET         assume_abort_if_not(WrapperStruct00.var_1_16 >= -127)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L137]       EXPR        WrapperStruct00.var_1_16
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L137]       CALL        assume_abort_if_not(WrapperStruct00.var_1_16 <= 126)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L20]        COND FALSE  !(!cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L137]       RET         assume_abort_if_not(WrapperStruct00.var_1_16 <= 126)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L151]       RET         updateVariables()
[L152]       CALL        step()
[L79]        COND FALSE  !(\read(last_1_WrapperStruct00_var_1_5))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L84]        EXPR        \read(*WrapperStruct00_var_1_1_Pointer)
[L84]        EXPR        \read(*WrapperStruct00_var_1_4_Pointer)
[L84]        EXPR        \read(*WrapperStruct00_var_1_1_Pointer)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L84]        COND FALSE  !((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer)))))
[L87]        EXPR        \read(*WrapperStruct00_var_1_3_Pointer)
[L87]                    (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L87]        COND TRUE   (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))
[L88]        EXPR        \read(*WrapperStruct00_var_1_2_Pointer)
[L88]        EXPR        (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L88]        EXPR        ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L88]                    (*(WrapperStruct00_var_1_5_Pointer)) = (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)))
[L92]        EXPR        \read(*WrapperStruct00_var_1_11_Pointer)
[L92]        EXPR        \read(*WrapperStruct00_var_1_12_Pointer)
[L92]        EXPR        \read(*WrapperStruct00_var_1_13_Pointer)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L92]        EXPR        (((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)
[L92]        EXPR        \read(*WrapperStruct00_var_1_13_Pointer)
[L92]        EXPR        (((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L92]                    signed long int stepLocal_1 = ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)));
[L93]        EXPR        \read(*WrapperStruct00_var_1_17_Pointer)
[L93]                    signed char stepLocal_0 = (*(WrapperStruct00_var_1_17_Pointer));
[L94]        COND FALSE  !(-10 >= stepLocal_0)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0, stepLocal_1=255]
[L152]       RET         step()
[L153]       CALL, EXPR  property()
[L143]       EXPR        last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L143]       EXPR        (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))
[L143]       EXPR        \read(*WrapperStruct00_var_1_3_Pointer)
[L143]       EXPR        (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L143]       EXPR        ((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer)))))))
[L143]       EXPR        \read(*WrapperStruct00_var_1_5_Pointer)
[L143]       EXPR        \read(*WrapperStruct00_var_1_2_Pointer)
[L143]       EXPR        (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L143]       EXPR        ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L143]       EXPR        ((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer)))))))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L143]       EXPR        (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L143]       EXPR        ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)
[L143]       EXPR        \read(*WrapperStruct00_var_1_17_Pointer)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L143]       EXPR        (-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L143]       EXPR        ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L143]       EXPR        (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1)
[L143]       EXPR        \read(*WrapperStruct00_var_1_1_Pointer)
[L143]       EXPR        \read(*WrapperStruct00_var_1_4_Pointer)
[L143]       EXPR        \read(*WrapperStruct00_var_1_1_Pointer)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L143]       EXPR        ((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1
[L143]       EXPR        \read(*WrapperStruct00_var_1_17_Pointer)
[L143]       EXPR        \read(*WrapperStruct00_var_1_15_Pointer)
[L143]       EXPR        ((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L143]       EXPR        (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L143-L144]              return (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1)
;
[L153]       RET, EXPR   property()
[L153]       CALL        __VERIFIER_assert(property())
[L19]        COND TRUE   !(cond)
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]
[L19]                    reach_error()
             VAL         [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.2s, OverallIterations: 32, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5391 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5383 mSDsluCounter, 17915 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13055 mSDsCounter, 542 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9181 IncrementalHoareTripleChecker+Invalid, 9723 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 542 mSolverCounterUnsat, 4860 mSDtfsCounter, 9181 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 948 GetRequests, 690 SyntacticMatches, 5 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=896occurred in iteration=31, InterpolantAutomatonStates: 206, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 2143 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 20.7s InterpolantComputationTime, 6247 NumberOfCodeBlocks, 6247 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 6029 ConstructedInterpolants, 0 QuantifiedInterpolants, 29465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1935 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 34 InterpolantComputations, 31 PerfectInterpolantSequences, 34232/34408 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-22 13:17:12,676 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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

### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/current/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_variablewrapping_wrapper-sp_file-34.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 b7d4f9d78490f5290f13c8883d00adc73ba1976bc9e9ac925a881a19aea54245
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m
[2024-11-22 13:17:14,793 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-22 13:17:14,860 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-22 13:17:14,864 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-22 13:17:14,865 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-22 13:17:14,891 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-22 13:17:14,896 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-22 13:17:14,896 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-22 13:17:14,897 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-22 13:17:14,897 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-22 13:17:14,898 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-22 13:17:14,898 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-22 13:17:14,898 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-22 13:17:14,900 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-22 13:17:14,900 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-22 13:17:14,901 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-22 13:17:14,901 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-22 13:17:14,901 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-22 13:17:14,901 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-22 13:17:14,901 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-22 13:17:14,902 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-22 13:17:14,905 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-22 13:17:14,905 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-22 13:17:14,906 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-22 13:17:14,906 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-22 13:17:14,906 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-22 13:17:14,906 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-22 13:17:14,906 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-22 13:17:14,906 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-22 13:17:14,907 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-22 13:17:14,907 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-22 13:17:14,907 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-22 13:17:14,907 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-22 13:17:14,907 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-22 13:17:14,908 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-22 13:17:14,908 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-22 13:17:14,908 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-22 13:17:14,908 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-22 13:17:14,908 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-22 13:17:14,908 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-22 13:17:14,909 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-22 13:17:14,909 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-22 13:17:14,909 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-22 13:17:14,910 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-22 13:17:14,910 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 -> b7d4f9d78490f5290f13c8883d00adc73ba1976bc9e9ac925a881a19aea54245
[2024-11-22 13:17:15,212 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-22 13:17:15,231 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-22 13:17:15,234 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-22 13:17:15,235 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-22 13:17:15,236 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-22 13:17:15,237 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i
[2024-11-22 13:17:16,636 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-22 13:17:16,851 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-22 13:17:16,852 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i
[2024-11-22 13:17:16,863 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d356129/e617427e7f9e49cdb4157a5229deef3d/FLAG3ebb4b190
[2024-11-22 13:17:17,207 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d356129/e617427e7f9e49cdb4157a5229deef3d
[2024-11-22 13:17:17,209 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-22 13:17:17,210 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-22 13:17:17,211 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-22 13:17:17,211 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-22 13:17:17,215 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-22 13:17:17,215 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:17:17" (1/1) ...
[2024-11-22 13:17:17,216 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36806e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:17:17, skipping insertion in model container
[2024-11-22 13:17:17,216 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:17:17" (1/1) ...
[2024-11-22 13:17:17,234 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-22 13:17:17,369 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i[917,930]
[2024-11-22 13:17:17,413 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-22 13:17:17,432 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-22 13:17:17,440 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i[917,930]
[2024-11-22 13:17:17,484 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-22 13:17:17,507 INFO  L204         MainTranslator]: Completed translation
[2024-11-22 13:17:17,507 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:17:17 WrapperNode
[2024-11-22 13:17:17,508 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-22 13:17:17,510 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-22 13:17:17,510 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-22 13:17:17,510 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-22 13:17:17,515 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:17:17" (1/1) ...
[2024-11-22 13:17:17,538 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:17:17" (1/1) ...
[2024-11-22 13:17:17,584 INFO  L138                Inliner]: procedures = 31, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 449
[2024-11-22 13:17:17,587 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-22 13:17:17,588 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-22 13:17:17,588 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-22 13:17:17,588 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-22 13:17:17,597 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:17:17" (1/1) ...
[2024-11-22 13:17:17,597 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:17:17" (1/1) ...
[2024-11-22 13:17:17,606 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:17:17" (1/1) ...
[2024-11-22 13:17:17,624 INFO  L175           MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35].
[2024-11-22 13:17:17,627 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:17:17" (1/1) ...
[2024-11-22 13:17:17,628 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:17:17" (1/1) ...
[2024-11-22 13:17:17,643 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:17:17" (1/1) ...
[2024-11-22 13:17:17,647 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:17:17" (1/1) ...
[2024-11-22 13:17:17,649 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:17:17" (1/1) ...
[2024-11-22 13:17:17,652 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:17:17" (1/1) ...
[2024-11-22 13:17:17,659 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-22 13:17:17,660 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-22 13:17:17,660 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-22 13:17:17,660 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-22 13:17:17,661 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:17:17" (1/1) ...
[2024-11-22 13:17:17,670 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-22 13:17:17,679 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-22 13:17:17,695 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-22 13:17:17,700 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-22 13:17:17,737 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-22 13:17:17,738 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0
[2024-11-22 13:17:17,738 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1
[2024-11-22 13:17:17,738 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0
[2024-11-22 13:17:17,738 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1
[2024-11-22 13:17:17,739 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0
[2024-11-22 13:17:17,740 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1
[2024-11-22 13:17:17,740 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0
[2024-11-22 13:17:17,740 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1
[2024-11-22 13:17:17,740 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-22 13:17:17,740 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2024-11-22 13:17:17,740 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0
[2024-11-22 13:17:17,741 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1
[2024-11-22 13:17:17,741 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-22 13:17:17,741 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-22 13:17:17,741 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-22 13:17:17,741 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-22 13:17:17,741 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0
[2024-11-22 13:17:17,742 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1
[2024-11-22 13:17:17,865 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-22 13:17:17,866 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-22 13:17:25,704 INFO  L?                        ?]: Removed 91 outVars from TransFormulas that were not future-live.
[2024-11-22 13:17:25,705 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-22 13:17:25,715 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-22 13:17:25,715 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-22 13:17:25,715 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:17:25 BoogieIcfgContainer
[2024-11-22 13:17:25,715 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-22 13:17:25,717 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-22 13:17:25,717 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-22 13:17:25,719 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-22 13:17:25,719 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:17:17" (1/3) ...
[2024-11-22 13:17:25,720 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f1acf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:17:25, skipping insertion in model container
[2024-11-22 13:17:25,720 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:17:17" (2/3) ...
[2024-11-22 13:17:25,720 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f1acf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:17:25, skipping insertion in model container
[2024-11-22 13:17:25,720 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:17:25" (3/3) ...
[2024-11-22 13:17:25,721 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-34.i
[2024-11-22 13:17:25,733 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-22 13:17:25,733 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-22 13:17:25,782 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-22 13:17:25,787 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;@6ed3f919, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-22 13:17:25,787 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-22 13:17:25,791 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-22 13:17:25,802 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2024-11-22 13:17:25,802 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:17:25,803 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:17:25,803 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:17:25,807 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:17:25,808 INFO  L85        PathProgramCache]: Analyzing trace with hash -1856483357, now seen corresponding path program 1 times
[2024-11-22 13:17:25,818 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-22 13:17:25,818 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055700310]
[2024-11-22 13:17:25,818 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:17:25,819 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-22 13:17:25,819 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-22 13:17:25,821 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-22 13:17:25,844 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-22 13:17:26,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:17:26,247 INFO  L255         TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-22 13:17:26,253 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 13:17:26,285 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked.
[2024-11-22 13:17:26,285 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-22 13:17:26,285 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-22 13:17:26,286 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055700310]
[2024-11-22 13:17:26,286 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055700310] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:17:26,286 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:17:26,286 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-22 13:17:26,287 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355039301]
[2024-11-22 13:17:26,288 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:17:26,292 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-22 13:17:26,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-22 13:17:26,310 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-22 13:17:26,311 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-22 13:17:26,312 INFO  L87              Difference]: Start difference. First operand  has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand  has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-22 13:17:26,334 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:17:26,335 INFO  L93              Difference]: Finished difference Result 233 states and 367 transitions.
[2024-11-22 13:17:26,340 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-22 13:17:26,341 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171
[2024-11-22 13:17:26,341 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:17:26,360 INFO  L225             Difference]: With dead ends: 233
[2024-11-22 13:17:26,360 INFO  L226             Difference]: Without dead ends: 116
[2024-11-22 13:17:26,363 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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-22 13:17:26,365 INFO  L432           NwaCegarLoop]: 168 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, 168 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-22 13:17:26,366 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 13:17:26,379 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2024-11-22 13:17:26,403 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116.
[2024-11-22 13:17:26,404 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-22 13:17:26,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions.
[2024-11-22 13:17:26,407 INFO  L78                 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171
[2024-11-22 13:17:26,407 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:17:26,407 INFO  L471      AbstractCegarLoop]: Abstraction has 116 states and 168 transitions.
[2024-11-22 13:17:26,408 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-22 13:17:26,408 INFO  L276                IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions.
[2024-11-22 13:17:26,410 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2024-11-22 13:17:26,410 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:17:26,410 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:17:26,423 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-22 13:17:26,611 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-22 13:17:26,612 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:17:26,612 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:17:26,613 INFO  L85        PathProgramCache]: Analyzing trace with hash 95317121, now seen corresponding path program 1 times
[2024-11-22 13:17:26,614 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-22 13:17:26,614 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825483695]
[2024-11-22 13:17:26,614 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:17:26,614 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-22 13:17:26,614 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-22 13:17:26,617 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-22 13:17:26,618 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-22 13:17:26,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:17:26,954 INFO  L255         TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-22 13:17:26,967 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 13:17:27,027 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:17:27,027 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-22 13:17:27,027 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-22 13:17:27,027 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825483695]
[2024-11-22 13:17:27,027 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [825483695] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:17:27,028 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:17:27,028 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-22 13:17:27,028 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182055419]
[2024-11-22 13:17:27,028 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:17:27,030 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-22 13:17:27,031 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-22 13:17:27,031 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-22 13:17:27,032 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-22 13:17:27,032 INFO  L87              Difference]: Start difference. First operand 116 states and 168 transitions. Second operand  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:27,077 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:17:27,078 INFO  L93              Difference]: Finished difference Result 227 states and 330 transitions.
[2024-11-22 13:17:27,078 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-22 13:17:27,079 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171
[2024-11-22 13:17:27,079 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:17:27,082 INFO  L225             Difference]: With dead ends: 227
[2024-11-22 13:17:27,084 INFO  L226             Difference]: Without dead ends: 114
[2024-11-22 13:17:27,085 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 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-22 13:17:27,086 INFO  L432           NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 13:17:27,087 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 13:17:27,088 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2024-11-22 13:17:27,097 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114.
[2024-11-22 13:17:27,098 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 114 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-22 13:17:27,099 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions.
[2024-11-22 13:17:27,100 INFO  L78                 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 171
[2024-11-22 13:17:27,101 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:17:27,101 INFO  L471      AbstractCegarLoop]: Abstraction has 114 states and 164 transitions.
[2024-11-22 13:17:27,101 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:27,101 INFO  L276                IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions.
[2024-11-22 13:17:27,103 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2024-11-22 13:17:27,103 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:17:27,103 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:17:27,118 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-22 13:17:27,304 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-22 13:17:27,305 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:17:27,305 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:17:27,307 INFO  L85        PathProgramCache]: Analyzing trace with hash -1527252011, now seen corresponding path program 1 times
[2024-11-22 13:17:27,307 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-22 13:17:27,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260946443]
[2024-11-22 13:17:27,307 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:17:27,307 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-22 13:17:27,308 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-22 13:17:27,309 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-22 13:17:27,311 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-22 13:17:27,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:17:27,692 INFO  L255         TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-22 13:17:27,697 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 13:17:27,750 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:17:27,750 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-22 13:17:27,750 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-22 13:17:27,750 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260946443]
[2024-11-22 13:17:27,751 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [260946443] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:17:27,751 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:17:27,751 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-22 13:17:27,751 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810936216]
[2024-11-22 13:17:27,751 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:17:27,752 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-22 13:17:27,752 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-22 13:17:27,752 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-22 13:17:27,752 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-22 13:17:27,753 INFO  L87              Difference]: Start difference. First operand 114 states and 164 transitions. Second operand  has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:27,805 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:17:27,805 INFO  L93              Difference]: Finished difference Result 227 states and 328 transitions.
[2024-11-22 13:17:27,806 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-22 13:17:27,806 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173
[2024-11-22 13:17:27,817 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:17:27,818 INFO  L225             Difference]: With dead ends: 227
[2024-11-22 13:17:27,818 INFO  L226             Difference]: Without dead ends: 116
[2024-11-22 13:17:27,819 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-22 13:17:27,820 INFO  L432           NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 13:17:27,820 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 13:17:27,821 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2024-11-22 13:17:27,828 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116.
[2024-11-22 13:17:27,829 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 116 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-22 13:17:27,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions.
[2024-11-22 13:17:27,833 INFO  L78                 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 173
[2024-11-22 13:17:27,834 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:17:27,834 INFO  L471      AbstractCegarLoop]: Abstraction has 116 states and 166 transitions.
[2024-11-22 13:17:27,834 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:27,834 INFO  L276                IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions.
[2024-11-22 13:17:27,836 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2024-11-22 13:17:27,836 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:17:27,836 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:17:27,851 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2024-11-22 13:17:28,036 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-22 13:17:28,037 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:17:28,037 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:17:28,038 INFO  L85        PathProgramCache]: Analyzing trace with hash 2106472359, now seen corresponding path program 1 times
[2024-11-22 13:17:28,038 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-22 13:17:28,038 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58615148]
[2024-11-22 13:17:28,038 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:17:28,038 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-22 13:17:28,039 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-22 13:17:28,046 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-22 13:17:28,047 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-22 13:17:28,380 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:17:28,394 INFO  L255         TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-22 13:17:28,401 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 13:17:28,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:17:28,429 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-22 13:17:28,429 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-22 13:17:28,429 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58615148]
[2024-11-22 13:17:28,429 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [58615148] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:17:28,430 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:17:28,430 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-22 13:17:28,430 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661419636]
[2024-11-22 13:17:28,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:17:28,430 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-22 13:17:28,431 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-22 13:17:28,431 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-22 13:17:28,431 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-22 13:17:28,432 INFO  L87              Difference]: Start difference. First operand 116 states and 166 transitions. Second operand  has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:28,992 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:17:28,992 INFO  L93              Difference]: Finished difference Result 273 states and 392 transitions.
[2024-11-22 13:17:28,992 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-22 13:17:28,992 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175
[2024-11-22 13:17:28,993 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:17:28,994 INFO  L225             Difference]: With dead ends: 273
[2024-11-22 13:17:28,994 INFO  L226             Difference]: Without dead ends: 160
[2024-11-22 13:17:28,994 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 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-22 13:17:28,995 INFO  L432           NwaCegarLoop]: 199 mSDtfsCounter, 72 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-22 13:17:28,995 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 345 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-22 13:17:28,996 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2024-11-22 13:17:29,009 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132.
[2024-11-22 13:17:29,011 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 132 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 107 states have internal predecessors, (141), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-22 13:17:29,012 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 187 transitions.
[2024-11-22 13:17:29,015 INFO  L78                 Accepts]: Start accepts. Automaton has 132 states and 187 transitions. Word has length 175
[2024-11-22 13:17:29,015 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:17:29,016 INFO  L471      AbstractCegarLoop]: Abstraction has 132 states and 187 transitions.
[2024-11-22 13:17:29,016 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:29,016 INFO  L276                IsEmpty]: Start isEmpty. Operand 132 states and 187 transitions.
[2024-11-22 13:17:29,018 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2024-11-22 13:17:29,018 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:17:29,018 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:17:29,040 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0
[2024-11-22 13:17:29,218 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-22 13:17:29,219 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:17:29,219 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:17:29,220 INFO  L85        PathProgramCache]: Analyzing trace with hash -43148884, now seen corresponding path program 1 times
[2024-11-22 13:17:29,221 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-22 13:17:29,221 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105944646]
[2024-11-22 13:17:29,221 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:17:29,221 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-22 13:17:29,221 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-22 13:17:29,225 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-22 13:17:29,231 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2024-11-22 13:17:29,581 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:17:29,593 INFO  L255         TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-22 13:17:29,596 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 13:17:29,651 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:17:29,651 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-22 13:17:29,651 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-22 13:17:29,651 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105944646]
[2024-11-22 13:17:29,651 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105944646] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:17:29,651 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:17:29,651 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-22 13:17:29,651 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798883997]
[2024-11-22 13:17:29,652 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:17:29,652 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-22 13:17:29,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-22 13:17:29,653 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-22 13:17:29,653 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-22 13:17:29,653 INFO  L87              Difference]: Start difference. First operand 132 states and 187 transitions. Second operand  has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:29,680 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:17:29,680 INFO  L93              Difference]: Finished difference Result 289 states and 410 transitions.
[2024-11-22 13:17:29,681 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-22 13:17:29,681 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177
[2024-11-22 13:17:29,682 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:17:29,682 INFO  L225             Difference]: With dead ends: 289
[2024-11-22 13:17:29,682 INFO  L226             Difference]: Without dead ends: 160
[2024-11-22 13:17:29,683 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 175 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-22 13:17:29,684 INFO  L432           NwaCegarLoop]: 161 mSDtfsCounter, 51 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 13:17:29,684 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 313 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 13:17:29,684 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2024-11-22 13:17:29,691 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132.
[2024-11-22 13:17:29,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 132 states, 107 states have (on average 1.308411214953271) internal successors, (140), 107 states have internal predecessors, (140), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-22 13:17:29,691 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 186 transitions.
[2024-11-22 13:17:29,692 INFO  L78                 Accepts]: Start accepts. Automaton has 132 states and 186 transitions. Word has length 177
[2024-11-22 13:17:29,692 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:17:29,692 INFO  L471      AbstractCegarLoop]: Abstraction has 132 states and 186 transitions.
[2024-11-22 13:17:29,692 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:29,692 INFO  L276                IsEmpty]: Start isEmpty. Operand 132 states and 186 transitions.
[2024-11-22 13:17:29,694 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 179
[2024-11-22 13:17:29,694 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:17:29,694 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:17:29,707 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0
[2024-11-22 13:17:29,895 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-22 13:17:29,895 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:17:29,895 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:17:29,895 INFO  L85        PathProgramCache]: Analyzing trace with hash 617898223, now seen corresponding path program 1 times
[2024-11-22 13:17:29,896 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-22 13:17:29,896 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248875530]
[2024-11-22 13:17:29,896 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:17:29,896 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-22 13:17:29,897 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-22 13:17:29,900 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-22 13:17:29,902 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2024-11-22 13:17:30,276 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:17:30,288 INFO  L255         TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-22 13:17:30,290 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 13:17:30,305 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:17:30,305 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-22 13:17:30,305 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-22 13:17:30,305 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248875530]
[2024-11-22 13:17:30,305 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248875530] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:17:30,305 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:17:30,305 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-22 13:17:30,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763620097]
[2024-11-22 13:17:30,306 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:17:30,306 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-22 13:17:30,306 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-22 13:17:30,306 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-22 13:17:30,307 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-22 13:17:30,307 INFO  L87              Difference]: Start difference. First operand 132 states and 186 transitions. Second operand  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:30,327 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:17:30,328 INFO  L93              Difference]: Finished difference Result 259 states and 366 transitions.
[2024-11-22 13:17:30,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-22 13:17:30,331 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178
[2024-11-22 13:17:30,332 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:17:30,333 INFO  L225             Difference]: With dead ends: 259
[2024-11-22 13:17:30,333 INFO  L226             Difference]: Without dead ends: 130
[2024-11-22 13:17:30,333 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 176 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-22 13:17:30,334 INFO  L432           NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-22 13:17:30,334 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-22 13:17:30,335 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 130 states.
[2024-11-22 13:17:30,338 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130.
[2024-11-22 13:17:30,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 130 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-22 13:17:30,339 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 182 transitions.
[2024-11-22 13:17:30,339 INFO  L78                 Accepts]: Start accepts. Automaton has 130 states and 182 transitions. Word has length 178
[2024-11-22 13:17:30,340 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:17:30,340 INFO  L471      AbstractCegarLoop]: Abstraction has 130 states and 182 transitions.
[2024-11-22 13:17:30,340 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:30,340 INFO  L276                IsEmpty]: Start isEmpty. Operand 130 states and 182 transitions.
[2024-11-22 13:17:30,341 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2024-11-22 13:17:30,341 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:17:30,341 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:17:30,356 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0
[2024-11-22 13:17:30,541 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-22 13:17:30,542 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:17:30,542 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:17:30,542 INFO  L85        PathProgramCache]: Analyzing trace with hash -49751333, now seen corresponding path program 1 times
[2024-11-22 13:17:30,543 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-22 13:17:30,543 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43675176]
[2024-11-22 13:17:30,543 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:17:30,543 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-22 13:17:30,543 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-22 13:17:30,545 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-22 13:17:30,546 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2024-11-22 13:17:30,943 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:17:30,956 INFO  L255         TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-11-22 13:17:30,963 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 13:17:31,104 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8
[2024-11-22 13:17:31,212 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-11-22 13:17:31,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:17:31,486 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-22 13:17:31,487 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-22 13:17:31,487 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43675176]
[2024-11-22 13:17:31,487 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [43675176] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:17:31,487 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:17:31,487 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-22 13:17:31,487 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885799359]
[2024-11-22 13:17:31,487 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:17:31,488 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-22 13:17:31,488 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-22 13:17:31,488 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-22 13:17:31,488 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2024-11-22 13:17:31,489 INFO  L87              Difference]: Start difference. First operand 130 states and 182 transitions. Second operand  has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:33,668 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-22 13:17:36,384 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-22 13:17:36,831 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:17:36,831 INFO  L93              Difference]: Finished difference Result 318 states and 443 transitions.
[2024-11-22 13:17:36,832 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-11-22 13:17:36,832 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180
[2024-11-22 13:17:36,832 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:17:36,834 INFO  L225             Difference]: With dead ends: 318
[2024-11-22 13:17:36,834 INFO  L226             Difference]: Without dead ends: 191
[2024-11-22 13:17:36,835 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272
[2024-11-22 13:17:36,837 INFO  L432           NwaCegarLoop]: 128 mSDtfsCounter, 52 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time
[2024-11-22 13:17:36,838 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1218 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time]
[2024-11-22 13:17:36,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 191 states.
[2024-11-22 13:17:36,845 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 167.
[2024-11-22 13:17:36,846 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 167 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 142 states have internal predecessors, (182), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-22 13:17:36,847 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 228 transitions.
[2024-11-22 13:17:36,847 INFO  L78                 Accepts]: Start accepts. Automaton has 167 states and 228 transitions. Word has length 180
[2024-11-22 13:17:36,847 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:17:36,847 INFO  L471      AbstractCegarLoop]: Abstraction has 167 states and 228 transitions.
[2024-11-22 13:17:36,848 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:36,848 INFO  L276                IsEmpty]: Start isEmpty. Operand 167 states and 228 transitions.
[2024-11-22 13:17:36,849 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2024-11-22 13:17:36,849 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:17:36,849 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:17:36,863 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 (8)] Ended with exit code 0
[2024-11-22 13:17:37,051 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-22 13:17:37,051 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:17:37,052 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:17:37,052 INFO  L85        PathProgramCache]: Analyzing trace with hash 64507231, now seen corresponding path program 1 times
[2024-11-22 13:17:37,052 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-22 13:17:37,053 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967668888]
[2024-11-22 13:17:37,053 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:17:37,053 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-22 13:17:37,053 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-22 13:17:37,056 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-22 13:17:37,057 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process
[2024-11-22 13:17:37,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:17:37,396 INFO  L255         TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-22 13:17:37,400 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 13:17:37,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-22 13:17:37,495 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-22 13:17:37,495 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-22 13:17:37,495 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967668888]
[2024-11-22 13:17:37,495 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [967668888] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-22 13:17:37,495 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-22 13:17:37,495 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-22 13:17:37,495 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867718494]
[2024-11-22 13:17:37,495 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-22 13:17:37,495 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-22 13:17:37,495 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-22 13:17:37,496 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-22 13:17:37,496 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-22 13:17:37,496 INFO  L87              Difference]: Start difference. First operand 167 states and 228 transitions. Second operand  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:39,680 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-22 13:17:41,791 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-22 13:17:45,390 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-22 13:17:45,603 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-22 13:17:45,603 INFO  L93              Difference]: Finished difference Result 370 states and 503 transitions.
[2024-11-22 13:17:45,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-22 13:17:45,608 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180
[2024-11-22 13:17:45,608 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-22 13:17:45,611 INFO  L225             Difference]: With dead ends: 370
[2024-11-22 13:17:45,611 INFO  L226             Difference]: Without dead ends: 206
[2024-11-22 13:17:45,612 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-11-22 13:17:45,612 INFO  L432           NwaCegarLoop]: 154 mSDtfsCounter, 36 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time
[2024-11-22 13:17:45,613 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 638 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time]
[2024-11-22 13:17:45,613 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 206 states.
[2024-11-22 13:17:45,622 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 173.
[2024-11-22 13:17:45,623 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 173 states, 148 states have (on average 1.2837837837837838) internal successors, (190), 148 states have internal predecessors, (190), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-22 13:17:45,624 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 236 transitions.
[2024-11-22 13:17:45,624 INFO  L78                 Accepts]: Start accepts. Automaton has 173 states and 236 transitions. Word has length 180
[2024-11-22 13:17:45,627 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-22 13:17:45,628 INFO  L471      AbstractCegarLoop]: Abstraction has 173 states and 236 transitions.
[2024-11-22 13:17:45,628 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-22 13:17:45,628 INFO  L276                IsEmpty]: Start isEmpty. Operand 173 states and 236 transitions.
[2024-11-22 13:17:45,629 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2024-11-22 13:17:45,631 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-22 13:17:45,631 INFO  L215           NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:17:45,646 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0
[2024-11-22 13:17:45,832 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-22 13:17:45,833 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-22 13:17:45,833 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-22 13:17:45,833 INFO  L85        PathProgramCache]: Analyzing trace with hash -1215356447, now seen corresponding path program 1 times
[2024-11-22 13:17:45,834 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-22 13:17:45,834 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744352299]
[2024-11-22 13:17:45,834 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-22 13:17:45,834 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-22 13:17:45,834 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-22 13:17:45,835 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-22 13:17:45,836 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process
[2024-11-22 13:17:46,388 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-22 13:17:46,408 INFO  L255         TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 43 conjuncts are in the unsatisfiable core
[2024-11-22 13:17:46,414 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-22 13:17:47,166 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2024-11-22 13:17:47,924 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21