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


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


Checking for ERROR reachability
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67160a6df79d1049c73d7b3dbc4aa323b185d65b8c91424febe1ccb6e4daf12a
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2023-12-02 19:54:41,295 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-12-02 19:54:41,380 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf
[2023-12-02 19:54:41,384 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-12-02 19:54:41,385 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-12-02 19:54:41,406 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-12-02 19:54:41,407 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-12-02 19:54:41,407 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-12-02 19:54:41,408 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-12-02 19:54:41,408 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-12-02 19:54:41,409 INFO  L153        SettingsManager]:  * User list type=DISABLED
[2023-12-02 19:54:41,409 INFO  L151        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2023-12-02 19:54:41,410 INFO  L153        SettingsManager]:  * Explicit value domain=true
[2023-12-02 19:54:41,410 INFO  L153        SettingsManager]:  * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain
[2023-12-02 19:54:41,411 INFO  L153        SettingsManager]:  * Octagon Domain=false
[2023-12-02 19:54:41,411 INFO  L153        SettingsManager]:  * Abstract domain=CompoundDomain
[2023-12-02 19:54:41,412 INFO  L153        SettingsManager]:  * Check feasibility of abstract posts with an SMT solver=true
[2023-12-02 19:54:41,412 INFO  L153        SettingsManager]:  * Use the RCFG-of-the-future interface=true
[2023-12-02 19:54:41,413 INFO  L153        SettingsManager]:  * Interval Domain=false
[2023-12-02 19:54:41,413 INFO  L151        SettingsManager]: Preferences of Sifa differ from their defaults:
[2023-12-02 19:54:41,414 INFO  L153        SettingsManager]:  * Call Summarizer=TopInputCallSummarizer
[2023-12-02 19:54:41,415 INFO  L153        SettingsManager]:  * Simplification Technique=POLY_PAC
[2023-12-02 19:54:41,415 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-12-02 19:54:41,416 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-12-02 19:54:41,416 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-12-02 19:54:41,417 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-12-02 19:54:41,417 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-12-02 19:54:41,417 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-12-02 19:54:41,418 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-12-02 19:54:41,418 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-12-02 19:54:41,419 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-12-02 19:54:41,419 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-12-02 19:54:41,419 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-12-02 19:54:41,419 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-12-02 19:54:41,420 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-12-02 19:54:41,420 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2023-12-02 19:54:41,420 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-12-02 19:54:41,420 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-12-02 19:54:41,420 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-12-02 19:54:41,421 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-12-02 19:54:41,421 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-12-02 19:54:41,421 INFO  L153        SettingsManager]:  * Trace refinement strategy=SIFA_TAIPAN
[2023-12-02 19:54:41,421 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-12-02 19:54:41,421 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2023-12-02 19:54:41,422 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-12-02 19:54:41,422 INFO  L153        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2023-12-02 19:54:41,422 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-12-02 19:54:41,422 INFO  L153        SettingsManager]:  * Abstract interpretation Mode=USE_PREDICATES
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh
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 -> Taipan
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 -> 67160a6df79d1049c73d7b3dbc4aa323b185d65b8c91424febe1ccb6e4daf12a
[2023-12-02 19:54:41,642 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-12-02 19:54:41,663 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-12-02 19:54:41,666 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-12-02 19:54:41,667 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-12-02 19:54:41,667 INFO  L274        PluginConnector]: CDTParser initialized
[2023-12-02 19:54:41,669 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i
[2023-12-02 19:54:44,433 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-12-02 19:54:44,626 INFO  L384              CDTParser]: Found 1 translation units.
[2023-12-02 19:54:44,627 INFO  L180              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i
[2023-12-02 19:54:44,639 INFO  L427              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/data/5bd83a1bb/b0cb84d19b2440e98a8c07e34524547d/FLAG25e9c2bf9
[2023-12-02 19:54:44,654 INFO  L435              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/data/5bd83a1bb/b0cb84d19b2440e98a8c07e34524547d
[2023-12-02 19:54:44,657 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-12-02 19:54:44,658 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-12-02 19:54:44,660 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-12-02 19:54:44,660 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-12-02 19:54:44,665 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-12-02 19:54:44,666 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:54:44" (1/1) ...
[2023-12-02 19:54:44,667 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74dd86f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:44, skipping insertion in model container
[2023-12-02 19:54:44,667 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:54:44" (1/1) ...
[2023-12-02 19:54:44,696 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-12-02 19:54:44,845 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i[916,929]
[2023-12-02 19:54:44,923 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-02 19:54:44,941 INFO  L202         MainTranslator]: Completed pre-run
[2023-12-02 19:54:44,954 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i[916,929]
[2023-12-02 19:54:45,012 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-02 19:54:45,031 INFO  L206         MainTranslator]: Completed translation
[2023-12-02 19:54:45,032 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:45 WrapperNode
[2023-12-02 19:54:45,032 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-12-02 19:54:45,033 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-12-02 19:54:45,033 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-12-02 19:54:45,033 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-12-02 19:54:45,041 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:45" (1/1) ...
[2023-12-02 19:54:45,058 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:45" (1/1) ...
[2023-12-02 19:54:45,105 INFO  L138                Inliner]: procedures = 29, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 458
[2023-12-02 19:54:45,106 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-12-02 19:54:45,107 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-12-02 19:54:45,107 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-12-02 19:54:45,107 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-12-02 19:54:45,116 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:45" (1/1) ...
[2023-12-02 19:54:45,117 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:45" (1/1) ...
[2023-12-02 19:54:45,125 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:45" (1/1) ...
[2023-12-02 19:54:45,125 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:45" (1/1) ...
[2023-12-02 19:54:45,149 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:45" (1/1) ...
[2023-12-02 19:54:45,155 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:45" (1/1) ...
[2023-12-02 19:54:45,160 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:45" (1/1) ...
[2023-12-02 19:54:45,164 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:45" (1/1) ...
[2023-12-02 19:54:45,173 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-12-02 19:54:45,174 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-12-02 19:54:45,174 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-12-02 19:54:45,174 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-12-02 19:54:45,175 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:45" (1/1) ...
[2023-12-02 19:54:45,182 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-12-02 19:54:45,194 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3
[2023-12-02 19:54:45,212 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-12-02 19:54:45,219 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-12-02 19:54:45,248 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-12-02 19:54:45,248 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real
[2023-12-02 19:54:45,248 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-12-02 19:54:45,248 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real
[2023-12-02 19:54:45,248 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-12-02 19:54:45,249 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~real
[2023-12-02 19:54:45,249 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2023-12-02 19:54:45,249 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2023-12-02 19:54:45,249 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-12-02 19:54:45,249 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-12-02 19:54:45,249 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-12-02 19:54:45,354 INFO  L241             CfgBuilder]: Building ICFG
[2023-12-02 19:54:45,356 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-12-02 19:54:45,816 INFO  L282             CfgBuilder]: Performing block encoding
[2023-12-02 19:54:46,474 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-12-02 19:54:46,474 INFO  L309             CfgBuilder]: Removed 1 assume(true) statements.
[2023-12-02 19:54:46,476 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:54:46 BoogieIcfgContainer
[2023-12-02 19:54:46,476 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-12-02 19:54:46,479 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-12-02 19:54:46,479 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-12-02 19:54:46,482 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-12-02 19:54:46,482 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:54:44" (1/3) ...
[2023-12-02 19:54:46,483 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5545ec23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:54:46, skipping insertion in model container
[2023-12-02 19:54:46,483 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:45" (2/3) ...
[2023-12-02 19:54:46,483 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5545ec23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:54:46, skipping insertion in model container
[2023-12-02 19:54:46,484 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:54:46" (3/3) ...
[2023-12-02 19:54:46,485 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-82.i
[2023-12-02 19:54:46,500 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-12-02 19:54:46,500 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-12-02 19:54:46,542 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-12-02 19:54:46,548 INFO  L357      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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@76b0a857, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-12-02 19:54:46,548 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-12-02 19:54:46,552 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 37 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14)
[2023-12-02 19:54:46,560 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2023-12-02 19:54:46,560 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:54:46,561 INFO  L195           NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:54:46,562 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:54:46,566 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:54:46,566 INFO  L85        PathProgramCache]: Analyzing trace with hash -649424780, now seen corresponding path program 1 times
[2023-12-02 19:54:46,574 INFO  L118   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2023-12-02 19:54:46,574 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832682978]
[2023-12-02 19:54:46,574 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:54:46,575 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-12-02 19:54:48,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-12-02 19:54:48,079 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-12-02 19:54:48,631 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-12-02 19:54:48,675 INFO  L130   FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace
[2023-12-02 19:54:48,677 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-12-02 19:54:48,678 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-12-02 19:54:48,680 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-12-02 19:54:48,683 INFO  L445         BasicCegarLoop]: Path program histogram: [1]
[2023-12-02 19:54:48,687 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-12-02 19:54:48,727 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated
[2023-12-02 19:54:48,728 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated
[2023-12-02 19:54:48,729 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem46 could not be translated
[2023-12-02 19:54:48,729 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem46 could not be translated
[2023-12-02 19:54:48,730 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated
[2023-12-02 19:54:48,730 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short54 could not be translated
[2023-12-02 19:54:48,730 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated
[2023-12-02 19:54:48,730 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated
[2023-12-02 19:54:48,730 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short53 could not be translated
[2023-12-02 19:54:48,730 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated
[2023-12-02 19:54:48,731 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short50 could not be translated
[2023-12-02 19:54:48,731 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated
[2023-12-02 19:54:48,731 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated
[2023-12-02 19:54:48,732 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated
[2023-12-02 19:54:48,732 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short54 could not be translated
[2023-12-02 19:54:48,732 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short53 could not be translated
[2023-12-02 19:54:48,732 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short50 could not be translated
[2023-12-02 19:54:48,732 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated
[2023-12-02 19:54:48,733 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated
[2023-12-02 19:54:48,733 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated
[2023-12-02 19:54:48,733 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated
[2023-12-02 19:54:48,733 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short58 could not be translated
[2023-12-02 19:54:48,734 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated
[2023-12-02 19:54:48,734 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short62 could not be translated
[2023-12-02 19:54:48,734 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short61 could not be translated
[2023-12-02 19:54:48,735 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short61 could not be translated
[2023-12-02 19:54:48,735 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short58 could not be translated
[2023-12-02 19:54:48,735 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated
[2023-12-02 19:54:48,735 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated
[2023-12-02 19:54:48,735 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short62 could not be translated
[2023-12-02 19:54:48,736 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated
[2023-12-02 19:54:48,736 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated
[2023-12-02 19:54:48,736 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated
[2023-12-02 19:54:48,737 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated
[2023-12-02 19:54:48,737 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated
[2023-12-02 19:54:48,738 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated
[2023-12-02 19:54:48,738 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated
[2023-12-02 19:54:48,739 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated
[2023-12-02 19:54:48,740 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated
[2023-12-02 19:54:48,740 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated
[2023-12-02 19:54:48,741 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated
[2023-12-02 19:54:48,741 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated
[2023-12-02 19:54:48,742 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated
[2023-12-02 19:54:48,742 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated
[2023-12-02 19:54:48,743 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated
[2023-12-02 19:54:48,743 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated
[2023-12-02 19:54:48,744 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated
[2023-12-02 19:54:48,744 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated
[2023-12-02 19:54:48,745 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated
[2023-12-02 19:54:48,745 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated
[2023-12-02 19:54:48,746 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem77 could not be translated
[2023-12-02 19:54:48,746 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem77 could not be translated
[2023-12-02 19:54:48,765 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:54:48 BoogieIcfgContainer
[2023-12-02 19:54:48,765 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-12-02 19:54:48,766 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-12-02 19:54:48,766 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2023-12-02 19:54:48,766 INFO  L274        PluginConnector]: Witness Printer initialized
[2023-12-02 19:54:48,767 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:54:46" (3/4) ...
[2023-12-02 19:54:48,769 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-12-02 19:54:48,770 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-12-02 19:54:48,771 INFO  L158              Benchmark]: Toolchain (without parser) took 4112.67ms. Allocated memory was 165.7MB in the beginning and 255.9MB in the end (delta: 90.2MB). Free memory was 132.8MB in the beginning and 139.0MB in the end (delta: -6.3MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB.
[2023-12-02 19:54:48,771 INFO  L158              Benchmark]: CDTParser took 0.29ms. Allocated memory is still 125.8MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-12-02 19:54:48,772 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 372.71ms. Allocated memory is still 165.7MB. Free memory was 132.8MB in the beginning and 131.7MB in the end (delta: 1.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2023-12-02 19:54:48,772 INFO  L158              Benchmark]: Boogie Procedure Inliner took 72.95ms. Allocated memory is still 165.7MB. Free memory was 131.7MB in the beginning and 126.3MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2023-12-02 19:54:48,773 INFO  L158              Benchmark]: Boogie Preprocessor took 66.30ms. Allocated memory is still 165.7MB. Free memory was 126.3MB in the beginning and 123.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-12-02 19:54:48,774 INFO  L158              Benchmark]: RCFGBuilder took 1302.50ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 123.0MB in the beginning and 153.6MB in the end (delta: -30.6MB). Peak memory consumption was 76.7MB. Max. memory is 16.1GB.
[2023-12-02 19:54:48,775 INFO  L158              Benchmark]: TraceAbstraction took 2286.16ms. Allocated memory was 199.2MB in the beginning and 255.9MB in the end (delta: 56.6MB). Free memory was 153.6MB in the beginning and 140.1MB in the end (delta: 13.5MB). Peak memory consumption was 148.4MB. Max. memory is 16.1GB.
[2023-12-02 19:54:48,775 INFO  L158              Benchmark]: Witness Printer took 4.25ms. Allocated memory is still 255.9MB. Free memory was 140.1MB in the beginning and 139.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-12-02 19:54:48,779 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.29ms. Allocated memory is still 125.8MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 372.71ms. Allocated memory is still 165.7MB. Free memory was 132.8MB in the beginning and 131.7MB in the end (delta: 1.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 72.95ms. Allocated memory is still 165.7MB. Free memory was 131.7MB in the beginning and 126.3MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 66.30ms. Allocated memory is still 165.7MB. Free memory was 126.3MB in the beginning and 123.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1302.50ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 123.0MB in the beginning and 153.6MB in the end (delta: -30.6MB). Peak memory consumption was 76.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 2286.16ms. Allocated memory was 199.2MB in the beginning and 255.9MB in the end (delta: 56.6MB). Free memory was 153.6MB in the beginning and 140.1MB in the end (delta: 13.5MB). Peak memory consumption was 148.4MB. Max. memory is 16.1GB.
 * Witness Printer took 4.25ms. Allocated memory is still 255.9MB. Free memory was 140.1MB in the beginning and 139.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem46 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem46 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~short54 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~short53 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~short50 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~short54 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~short53 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~short50 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~short58 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~short62 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~short61 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~short61 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~short58 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~short62 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem77 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem77 could not be translated
  - GenericResult: Unfinished Backtranslation
    The program execution was not completely translated back.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of bitwiseOr at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryArithmeticFLOAToperation at line 56. 
Possible FailurePath: 
[L21]                  unsigned char isInitial = 0;
[L22-L24]              unsigned char BOOL_unsigned_char_Array_0[1] = {
 1
};
[L25-L27]              double double_Array_0[2] = {
 3.75, 255.5
};
[L28-L30]              float float_Array_0[3] = {
 255.5, 63.5, 128.75
};
[L31-L33]              unsigned char unsigned_char_Array_0[2][2][2] = {
 {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}}
};
[L34]                  unsigned char last_1_unsigned_char_Array_0_0__0__0_ = 2;
[L35]                  unsigned char last_1_unsigned_char_Array_0_0__0__1_ = 0;
[L36]                  unsigned char last_1_unsigned_char_Array_0_1__1__1_ = 32;
[L101]                 isInitial = 1
[L102]     FCALL       initially()
[L103]     COND TRUE   1
[L104]     CALL        updateLastVariables()
[L92]      EXPR        unsigned_char_Array_0[0][0][0]
[L92]                  last_1_unsigned_char_Array_0_0__0__0_ = unsigned_char_Array_0[0][0][0]
[L93]      EXPR        unsigned_char_Array_0[0][0][1]
[L93]                  last_1_unsigned_char_Array_0_0__0__1_ = unsigned_char_Array_0[0][0][1]
[L94]      EXPR        unsigned_char_Array_0[1][1][1]
[L94]                  last_1_unsigned_char_Array_0_1__1__1_ = unsigned_char_Array_0[1][1][1]
[L104]     RET         updateLastVariables()
[L105]     CALL        updateVariables()
[L68]                  BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar()
[L69]      EXPR        BOOL_unsigned_char_Array_0[0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L69]      CALL        assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L20]      COND FALSE  !(!cond)
[L69]      RET         assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L70]      EXPR        BOOL_unsigned_char_Array_0[0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L70]      CALL        assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L20]      COND FALSE  !(!cond)
[L70]      RET         assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L71]                  float_Array_0[0] = __VERIFIER_nondet_float()
[L72]      EXPR        float_Array_0[0]
[L72]      EXPR        float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F
[L72]      EXPR        float_Array_0[0]
[L72]      EXPR        float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F
[L72]      EXPR        (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L72]      CALL        assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L20]      COND FALSE  !(!cond)
[L72]      RET         assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L73]                  float_Array_0[1] = __VERIFIER_nondet_float()
[L74]      EXPR        float_Array_0[1]
[L74]      EXPR        float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F
[L74]      EXPR        float_Array_0[1]
[L74]      EXPR        float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F
[L74]      EXPR        (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L74]      CALL        assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L20]      COND FALSE  !(!cond)
[L74]      RET         assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ))
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L75]                  unsigned_char_Array_0[1][0][0] = __VERIFIER_nondet_uchar()
[L76]      EXPR        unsigned_char_Array_0[1][0][0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L76]      CALL        assume_abort_if_not(unsigned_char_Array_0[1][0][0] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L20]      COND FALSE  !(!cond)
[L76]      RET         assume_abort_if_not(unsigned_char_Array_0[1][0][0] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L77]      EXPR        unsigned_char_Array_0[1][0][0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L77]      CALL        assume_abort_if_not(unsigned_char_Array_0[1][0][0] <= 254)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L20]      COND FALSE  !(!cond)
[L77]      RET         assume_abort_if_not(unsigned_char_Array_0[1][0][0] <= 254)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L78]                  unsigned_char_Array_0[0][1][0] = __VERIFIER_nondet_uchar()
[L79]      EXPR        unsigned_char_Array_0[0][1][0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L79]      CALL        assume_abort_if_not(unsigned_char_Array_0[0][1][0] >= 127)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L20]      COND FALSE  !(!cond)
[L79]      RET         assume_abort_if_not(unsigned_char_Array_0[0][1][0] >= 127)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L80]      EXPR        unsigned_char_Array_0[0][1][0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L80]      CALL        assume_abort_if_not(unsigned_char_Array_0[0][1][0] <= 254)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L20]      COND FALSE  !(!cond)
[L80]      RET         assume_abort_if_not(unsigned_char_Array_0[0][1][0] <= 254)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L81]                  unsigned_char_Array_0[1][1][0] = __VERIFIER_nondet_uchar()
[L82]      EXPR        unsigned_char_Array_0[1][1][0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L82]      CALL        assume_abort_if_not(unsigned_char_Array_0[1][1][0] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L20]      COND FALSE  !(!cond)
[L82]      RET         assume_abort_if_not(unsigned_char_Array_0[1][1][0] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L83]      EXPR        unsigned_char_Array_0[1][1][0]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L83]      CALL        assume_abort_if_not(unsigned_char_Array_0[1][1][0] <= 127)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L20]      COND FALSE  !(!cond)
[L83]      RET         assume_abort_if_not(unsigned_char_Array_0[1][1][0] <= 127)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L84]                  unsigned_char_Array_0[1][0][1] = __VERIFIER_nondet_uchar()
[L85]      EXPR        unsigned_char_Array_0[1][0][1]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L85]      CALL        assume_abort_if_not(unsigned_char_Array_0[1][0][1] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L20]      COND FALSE  !(!cond)
[L85]      RET         assume_abort_if_not(unsigned_char_Array_0[1][0][1] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L86]      EXPR        unsigned_char_Array_0[1][0][1]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L86]      CALL        assume_abort_if_not(unsigned_char_Array_0[1][0][1] <= 254)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L20]      COND FALSE  !(!cond)
[L86]      RET         assume_abort_if_not(unsigned_char_Array_0[1][0][1] <= 254)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L87]                  unsigned_char_Array_0[0][1][1] = __VERIFIER_nondet_uchar()
[L88]      EXPR        unsigned_char_Array_0[0][1][1]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L88]      CALL        assume_abort_if_not(unsigned_char_Array_0[0][1][1] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L20]      COND FALSE  !(!cond)
[L88]      RET         assume_abort_if_not(unsigned_char_Array_0[0][1][1] >= 0)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L89]      EXPR        unsigned_char_Array_0[0][1][1]
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L89]      CALL        assume_abort_if_not(unsigned_char_Array_0[0][1][1] <= 127)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L20]      COND FALSE  !(!cond)
[L89]      RET         assume_abort_if_not(unsigned_char_Array_0[0][1][1] <= 127)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L105]     RET         updateVariables()
[L106]     CALL        step()
[L40]      EXPR        last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_
[L40]                  signed long int stepLocal_0 = last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_;
[L41]      COND FALSE  !((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= stepLocal_0)
[L44]      EXPR        unsigned_char_Array_0[0][1][0]
[L44]      EXPR        unsigned_char_Array_0[1][1][0]
[L44]      EXPR        ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])
[L44]      EXPR        unsigned_char_Array_0[1][1][0]
[L44]      EXPR        ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])
[L44]                  unsigned_char_Array_0[1][1][1] = (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]))))
[L46]      EXPR        BOOL_unsigned_char_Array_0[0]
[L46]      COND TRUE   ! BOOL_unsigned_char_Array_0[0]
[L47]                  BOOL_unsigned_char_Array_0[0]
[L47]      COND FALSE  !(BOOL_unsigned_char_Array_0[0])
[L51]      EXPR        float_Array_0[0]
[L51]                  double_Array_0[0] = float_Array_0[0]
[L52]      EXPR        unsigned_char_Array_0[1][0][0]
[L52]                  unsigned_char_Array_0[0][0][1] = unsigned_char_Array_0[1][0][0]
[L53]      EXPR        float_Array_0[1]
[L53]                  double_Array_0[1] = float_Array_0[1]
[L54]      EXPR        unsigned_char_Array_0[1][0][0]
[L54]                  unsigned char stepLocal_1 = unsigned_char_Array_0[1][0][0];
[L55]      EXPR        unsigned_char_Array_0[1][1][1]
[L55]      EXPR        unsigned_char_Array_0[1][1][0]
[L55]      COND TRUE   (unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= stepLocal_1
[L56]      EXPR        float_Array_0[0]
[L56]      EXPR        float_Array_0[2]
[L56]      EXPR        float_Array_0[1]
[L56]      EXPR        ((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1]))
[L56]      EXPR        float_Array_0[2]
[L56]      EXPR        float_Array_0[1]
[L56]      EXPR        ((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1]))
[L56]      EXPR        float_Array_0[2]
[L56]      COND FALSE  !(((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2])
[L59]                  BOOL_unsigned_char_Array_0[0]
[L59]      COND FALSE  !(BOOL_unsigned_char_Array_0[0])
[L106]     RET         step()
[L107]     CALL, EXPR  property()
[L97]      EXPR        BOOL_unsigned_char_Array_0[0]
[L97]      EXPR        (! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1
[L97]      EXPR        BOOL_unsigned_char_Array_0[0]
[L97]      EXPR        BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1
[L97]      EXPR        (! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1
[L97]      EXPR        ((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))
[L97]      EXPR        last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_
[L97]      EXPR        ((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]))))))
[L97]      EXPR        unsigned_char_Array_0[1][1][1]
[L97]      EXPR        unsigned_char_Array_0[0][1][0]
[L97]      EXPR        unsigned_char_Array_0[1][1][0]
[L97]      EXPR        ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])
[L97]      EXPR        unsigned_char_Array_0[1][1][0]
[L97]      EXPR        ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])
[L97]      EXPR        ((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]))))))
[L97]      EXPR        ((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))
[L97]      EXPR        (((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))
[L97]      EXPR        unsigned_char_Array_0[1][1][1]
[L97]      EXPR        unsigned_char_Array_0[1][1][0]
[L97]      EXPR        unsigned_char_Array_0[1][0][0]
[L97]      EXPR        ((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0]))
[L97]      EXPR        float_Array_0[0]
[L97]      EXPR        float_Array_0[2]
[L97]      EXPR        float_Array_0[1]
[L97]      EXPR        ((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1]))
[L97]      EXPR        float_Array_0[0]
[L97]      EXPR        ((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1]))
[L97]      EXPR        float_Array_0[2]
[L97]      EXPR        (((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)
[L97]      EXPR        unsigned_char_Array_0[0][0][0]
[L97]      EXPR        unsigned_char_Array_0[1][1][0]
[L97]      EXPR        unsigned_char_Array_0[1][0][1]
[L97]      EXPR        ((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1])
[L97]      EXPR        unsigned_char_Array_0[1][0][1]
[L97]      EXPR        ((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1])
[L97]      EXPR        (((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)
[L97]      EXPR        ((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0]))
[L97]      EXPR        (((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))
[L97]      EXPR        ((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))
[L97]      EXPR        (((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))
[L97]      EXPR        ((((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) && (double_Array_0[1] == ((double) float_Array_0[1]))
[L97-L98]              return ((((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) && (double_Array_0[1] == ((double) float_Array_0[1]))
;
[L107]     RET, EXPR   property()
[L107]     CALL        __VERIFIER_assert(property())
[L19]      COND TRUE   !(cond)
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]
[L19]                  reach_error()
           VAL         [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 1, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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
[2023-12-02 19:54:48,807 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67160a6df79d1049c73d7b3dbc4aa323b185d65b8c91424febe1ccb6e4daf12a
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2023-12-02 19:54:50,828 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-12-02 19:54:50,904 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf
[2023-12-02 19:54:50,909 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-12-02 19:54:50,910 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-12-02 19:54:50,937 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-12-02 19:54:50,938 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-12-02 19:54:50,938 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-12-02 19:54:50,939 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-12-02 19:54:50,939 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-12-02 19:54:50,940 INFO  L153        SettingsManager]:  * User list type=DISABLED
[2023-12-02 19:54:50,941 INFO  L151        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2023-12-02 19:54:50,941 INFO  L153        SettingsManager]:  * Explicit value domain=true
[2023-12-02 19:54:50,942 INFO  L153        SettingsManager]:  * Octagon Domain=false
[2023-12-02 19:54:50,942 INFO  L153        SettingsManager]:  * Abstract domain=CompoundDomain
[2023-12-02 19:54:50,943 INFO  L153        SettingsManager]:  * Interval Domain=false
[2023-12-02 19:54:50,944 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-12-02 19:54:50,944 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-12-02 19:54:50,945 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-12-02 19:54:50,945 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-12-02 19:54:50,946 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-12-02 19:54:50,946 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-12-02 19:54:50,947 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-12-02 19:54:50,947 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-12-02 19:54:50,948 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2023-12-02 19:54:50,948 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2023-12-02 19:54:50,949 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2023-12-02 19:54:50,949 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-12-02 19:54:50,950 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-12-02 19:54:50,950 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-12-02 19:54:50,951 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-12-02 19:54:50,951 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-12-02 19:54:50,951 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2023-12-02 19:54:50,951 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-12-02 19:54:50,952 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-12-02 19:54:50,952 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-12-02 19:54:50,952 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-12-02 19:54:50,952 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-12-02 19:54:50,953 INFO  L153        SettingsManager]:  * Trace refinement strategy=WALRUS
[2023-12-02 19:54:50,953 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt 
[2023-12-02 19:54:50,953 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2023-12-02 19:54:50,953 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-12-02 19:54:50,954 INFO  L153        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2023-12-02 19:54:50,954 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-12-02 19:54:50,954 INFO  L153        SettingsManager]:  * Logic for external solver=AUFBV
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh
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 -> Taipan
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 -> 67160a6df79d1049c73d7b3dbc4aa323b185d65b8c91424febe1ccb6e4daf12a
[2023-12-02 19:54:51,221 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-12-02 19:54:51,240 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-12-02 19:54:51,242 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-12-02 19:54:51,243 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-12-02 19:54:51,243 INFO  L274        PluginConnector]: CDTParser initialized
[2023-12-02 19:54:51,244 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i
[2023-12-02 19:54:53,987 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-12-02 19:54:54,204 INFO  L384              CDTParser]: Found 1 translation units.
[2023-12-02 19:54:54,205 INFO  L180              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i
[2023-12-02 19:54:54,215 INFO  L427              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/data/d7a44edd8/2ae1b275dea744c8971a4730b8ad8d86/FLAG15b9f9923
[2023-12-02 19:54:54,231 INFO  L435              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/data/d7a44edd8/2ae1b275dea744c8971a4730b8ad8d86
[2023-12-02 19:54:54,233 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-12-02 19:54:54,235 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-12-02 19:54:54,236 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-12-02 19:54:54,236 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-12-02 19:54:54,242 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-12-02 19:54:54,242 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:54:54" (1/1) ...
[2023-12-02 19:54:54,244 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35dcf36d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:54, skipping insertion in model container
[2023-12-02 19:54:54,244 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:54:54" (1/1) ...
[2023-12-02 19:54:54,275 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-12-02 19:54:54,426 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i[916,929]
[2023-12-02 19:54:54,499 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-02 19:54:54,513 INFO  L202         MainTranslator]: Completed pre-run
[2023-12-02 19:54:54,526 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i[916,929]
[2023-12-02 19:54:54,581 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-12-02 19:54:54,605 INFO  L206         MainTranslator]: Completed translation
[2023-12-02 19:54:54,605 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:54 WrapperNode
[2023-12-02 19:54:54,605 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-12-02 19:54:54,607 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-12-02 19:54:54,607 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-12-02 19:54:54,607 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-12-02 19:54:54,614 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:54" (1/1) ...
[2023-12-02 19:54:54,632 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:54" (1/1) ...
[2023-12-02 19:54:54,675 INFO  L138                Inliner]: procedures = 33, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 438
[2023-12-02 19:54:54,676 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-12-02 19:54:54,676 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-12-02 19:54:54,676 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-12-02 19:54:54,677 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-12-02 19:54:54,687 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:54" (1/1) ...
[2023-12-02 19:54:54,687 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:54" (1/1) ...
[2023-12-02 19:54:54,697 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:54" (1/1) ...
[2023-12-02 19:54:54,697 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:54" (1/1) ...
[2023-12-02 19:54:54,719 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:54" (1/1) ...
[2023-12-02 19:54:54,724 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:54" (1/1) ...
[2023-12-02 19:54:54,729 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:54" (1/1) ...
[2023-12-02 19:54:54,733 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:54" (1/1) ...
[2023-12-02 19:54:54,740 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-12-02 19:54:54,741 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-12-02 19:54:54,741 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-12-02 19:54:54,741 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-12-02 19:54:54,742 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:54" (1/1) ...
[2023-12-02 19:54:54,746 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-12-02 19:54:54,758 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3
[2023-12-02 19:54:54,772 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-12-02 19:54:54,774 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-12-02 19:54:54,802 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-12-02 19:54:54,803 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8
[2023-12-02 19:54:54,803 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8
[2023-12-02 19:54:54,803 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1
[2023-12-02 19:54:54,803 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1
[2023-12-02 19:54:54,803 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4
[2023-12-02 19:54:54,803 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8
[2023-12-02 19:54:54,804 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4
[2023-12-02 19:54:54,804 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4
[2023-12-02 19:54:54,804 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2023-12-02 19:54:54,804 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2023-12-02 19:54:54,804 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-12-02 19:54:54,805 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-12-02 19:54:54,805 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1
[2023-12-02 19:54:54,919 INFO  L241             CfgBuilder]: Building ICFG
[2023-12-02 19:54:54,921 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-12-02 19:54:57,569 INFO  L282             CfgBuilder]: Performing block encoding
[2023-12-02 19:54:57,614 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-12-02 19:54:57,614 INFO  L309             CfgBuilder]: Removed 1 assume(true) statements.
[2023-12-02 19:54:57,615 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:54:57 BoogieIcfgContainer
[2023-12-02 19:54:57,615 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-12-02 19:54:57,618 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-12-02 19:54:57,618 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-12-02 19:54:57,621 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-12-02 19:54:57,621 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:54:54" (1/3) ...
[2023-12-02 19:54:57,622 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e75244d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:54:57, skipping insertion in model container
[2023-12-02 19:54:57,622 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:54:54" (2/3) ...
[2023-12-02 19:54:57,622 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e75244d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:54:57, skipping insertion in model container
[2023-12-02 19:54:57,622 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:54:57" (3/3) ...
[2023-12-02 19:54:57,624 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-82.i
[2023-12-02 19:54:57,642 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-12-02 19:54:57,642 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-12-02 19:54:57,694 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-12-02 19:54:57,700 INFO  L357      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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@fe6c1a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-12-02 19:54:57,701 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-12-02 19:54:57,705 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 101 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14)
[2023-12-02 19:54:57,720 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2023-12-02 19:54:57,721 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:54:57,721 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:54:57,722 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:54:57,727 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:54:57,728 INFO  L85        PathProgramCache]: Analyzing trace with hash -1517865241, now seen corresponding path program 1 times
[2023-12-02 19:54:57,743 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:54:57,743 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885204662]
[2023-12-02 19:54:57,744 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:54:57,744 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
[2023-12-02 19:54:57,744 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:54:57,746 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:54:57,751 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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
[2023-12-02 19:54:58,069 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:54:58,079 INFO  L262         TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjunts are in the unsatisfiable core
[2023-12-02 19:54:58,089 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:54:58,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked.
[2023-12-02 19:54:58,146 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:54:58,147 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:54:58,147 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885204662]
[2023-12-02 19:54:58,147 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [885204662] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:54:58,148 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:54:58,148 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-12-02 19:54:58,149 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455784246]
[2023-12-02 19:54:58,150 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:54:58,154 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-12-02 19:54:58,155 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:54:58,178 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-12-02 19:54:58,179 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-12-02 19:54:58,181 INFO  L87              Difference]: Start difference. First operand  has 101 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand  has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-02 19:54:58,228 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:54:58,228 INFO  L93              Difference]: Finished difference Result 199 states and 312 transitions.
[2023-12-02 19:54:58,230 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-12-02 19:54:58,231 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114
[2023-12-02 19:54:58,231 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:54:58,240 INFO  L225             Difference]: With dead ends: 199
[2023-12-02 19:54:58,240 INFO  L226             Difference]: Without dead ends: 99
[2023-12-02 19:54:58,244 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-12-02 19:54:58,247 INFO  L413           NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-12-02 19:54:58,249 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-12-02 19:54:58,264 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2023-12-02 19:54:58,286 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99.
[2023-12-02 19:54:58,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 99 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14)
[2023-12-02 19:54:58,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions.
[2023-12-02 19:54:58,292 INFO  L78                 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 114
[2023-12-02 19:54:58,292 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:54:58,292 INFO  L495      AbstractCegarLoop]: Abstraction has 99 states and 141 transitions.
[2023-12-02 19:54:58,293 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-02 19:54:58,293 INFO  L276                IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions.
[2023-12-02 19:54:58,296 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2023-12-02 19:54:58,297 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:54:58,297 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:54:58,304 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Forceful destruction successful, exit code 0
[2023-12-02 19:54:58,498 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:54:58,499 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:54:58,499 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:54:58,500 INFO  L85        PathProgramCache]: Analyzing trace with hash 46136977, now seen corresponding path program 1 times
[2023-12-02 19:54:58,500 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:54:58,501 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299230315]
[2023-12-02 19:54:58,501 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:54:58,501 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
[2023-12-02 19:54:58,501 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:54:58,502 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:54:58,503 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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
[2023-12-02 19:54:58,742 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:54:58,752 INFO  L262         TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjunts are in the unsatisfiable core
[2023-12-02 19:54:58,758 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:54:58,811 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2023-12-02 19:54:58,811 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:54:58,811 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:54:58,812 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299230315]
[2023-12-02 19:54:58,812 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299230315] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:54:58,812 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:54:58,813 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-12-02 19:54:58,813 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664477901]
[2023-12-02 19:54:58,813 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:54:58,815 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-12-02 19:54:58,815 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:54:58,816 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-12-02 19:54:58,816 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-12-02 19:54:58,817 INFO  L87              Difference]: Start difference. First operand 99 states and 141 transitions. Second operand  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:54:58,911 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:54:58,912 INFO  L93              Difference]: Finished difference Result 224 states and 319 transitions.
[2023-12-02 19:54:58,912 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-12-02 19:54:58,912 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114
[2023-12-02 19:54:58,914 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:54:58,916 INFO  L225             Difference]: With dead ends: 224
[2023-12-02 19:54:58,916 INFO  L226             Difference]: Without dead ends: 126
[2023-12-02 19:54:58,917 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-12-02 19:54:58,919 INFO  L413           NwaCegarLoop]: 162 mSDtfsCounter, 49 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-12-02 19:54:58,919 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 446 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-12-02 19:54:58,921 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 126 states.
[2023-12-02 19:54:58,932 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101.
[2023-12-02 19:54:58,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14)
[2023-12-02 19:54:58,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions.
[2023-12-02 19:54:58,935 INFO  L78                 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 114
[2023-12-02 19:54:58,937 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:54:58,937 INFO  L495      AbstractCegarLoop]: Abstraction has 101 states and 143 transitions.
[2023-12-02 19:54:58,937 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:54:58,938 INFO  L276                IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions.
[2023-12-02 19:54:58,940 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2023-12-02 19:54:58,940 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:54:58,940 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:54:58,946 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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
[2023-12-02 19:54:59,142 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:54:59,143 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:54:59,143 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:54:59,143 INFO  L85        PathProgramCache]: Analyzing trace with hash -1288682049, now seen corresponding path program 1 times
[2023-12-02 19:54:59,144 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:54:59,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434494966]
[2023-12-02 19:54:59,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:54:59,144 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
[2023-12-02 19:54:59,144 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:54:59,145 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:54:59,146 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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
[2023-12-02 19:54:59,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:54:59,424 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-12-02 19:54:59,430 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:54:59,479 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2023-12-02 19:54:59,479 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:54:59,480 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:54:59,480 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434494966]
[2023-12-02 19:54:59,480 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434494966] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:54:59,480 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:54:59,480 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-12-02 19:54:59,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937572759]
[2023-12-02 19:54:59,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:54:59,481 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-12-02 19:54:59,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:54:59,482 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-12-02 19:54:59,482 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-12-02 19:54:59,483 INFO  L87              Difference]: Start difference. First operand 101 states and 143 transitions. Second operand  has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:54:59,633 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:54:59,633 INFO  L93              Difference]: Finished difference Result 254 states and 359 transitions.
[2023-12-02 19:54:59,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-12-02 19:54:59,634 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116
[2023-12-02 19:54:59,635 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:54:59,637 INFO  L225             Difference]: With dead ends: 254
[2023-12-02 19:54:59,637 INFO  L226             Difference]: Without dead ends: 154
[2023-12-02 19:54:59,638 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2023-12-02 19:54:59,640 INFO  L413           NwaCegarLoop]: 195 mSDtfsCounter, 86 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-12-02 19:54:59,640 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 662 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-12-02 19:54:59,641 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 154 states.
[2023-12-02 19:54:59,649 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 102.
[2023-12-02 19:54:59,649 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14)
[2023-12-02 19:54:59,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions.
[2023-12-02 19:54:59,651 INFO  L78                 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 116
[2023-12-02 19:54:59,651 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:54:59,652 INFO  L495      AbstractCegarLoop]: Abstraction has 102 states and 144 transitions.
[2023-12-02 19:54:59,652 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:54:59,652 INFO  L276                IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions.
[2023-12-02 19:54:59,654 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2023-12-02 19:54:59,654 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:54:59,655 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:54:59,661 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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
[2023-12-02 19:54:59,858 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:54:59,859 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:54:59,859 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:54:59,859 INFO  L85        PathProgramCache]: Analyzing trace with hash -1953839654, now seen corresponding path program 1 times
[2023-12-02 19:54:59,860 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:54:59,860 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701177926]
[2023-12-02 19:54:59,860 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:54:59,861 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:54:59,861 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:54:59,862 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:54:59,863 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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
[2023-12-02 19:55:00,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:55:00,108 INFO  L262         TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-12-02 19:55:00,113 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:55:00,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2023-12-02 19:55:00,158 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:55:00,158 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:55:00,158 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701177926]
[2023-12-02 19:55:00,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701177926] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:55:00,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:55:00,159 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-12-02 19:55:00,159 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652894147]
[2023-12-02 19:55:00,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:55:00,160 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-12-02 19:55:00,161 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:55:00,161 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-12-02 19:55:00,162 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-12-02 19:55:00,162 INFO  L87              Difference]: Start difference. First operand 102 states and 144 transitions. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:55:02,102 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 19:55:04,573 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 19:55:05,593 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 19:55:07,511 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:55:07,511 INFO  L93              Difference]: Finished difference Result 225 states and 317 transitions.
[2023-12-02 19:55:07,512 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-12-02 19:55:07,512 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118
[2023-12-02 19:55:07,512 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:55:07,513 INFO  L225             Difference]: With dead ends: 225
[2023-12-02 19:55:07,513 INFO  L226             Difference]: Without dead ends: 124
[2023-12-02 19:55:07,514 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-12-02 19:55:07,515 INFO  L413           NwaCegarLoop]: 129 mSDtfsCounter, 78 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time
[2023-12-02 19:55:07,516 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 286 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time]
[2023-12-02 19:55:07,517 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2023-12-02 19:55:07,522 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 97.
[2023-12-02 19:55:07,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14)
[2023-12-02 19:55:07,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions.
[2023-12-02 19:55:07,524 INFO  L78                 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 118
[2023-12-02 19:55:07,524 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:55:07,525 INFO  L495      AbstractCegarLoop]: Abstraction has 97 states and 136 transitions.
[2023-12-02 19:55:07,525 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:55:07,525 INFO  L276                IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions.
[2023-12-02 19:55:07,526 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2023-12-02 19:55:07,526 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:55:07,527 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:55:07,532 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0
[2023-12-02 19:55:07,727 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:55:07,727 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:55:07,728 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:55:07,728 INFO  L85        PathProgramCache]: Analyzing trace with hash 1971953921, now seen corresponding path program 1 times
[2023-12-02 19:55:07,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:55:07,729 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538198592]
[2023-12-02 19:55:07,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:55:07,729 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
[2023-12-02 19:55:07,729 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:55:07,730 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:55:07,731 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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
[2023-12-02 19:55:07,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:55:07,971 INFO  L262         TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjunts are in the unsatisfiable core
[2023-12-02 19:55:07,976 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:55:08,004 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2023-12-02 19:55:08,004 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:55:08,004 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:55:08,004 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538198592]
[2023-12-02 19:55:08,004 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538198592] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:55:08,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:55:08,005 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-12-02 19:55:08,005 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712021495]
[2023-12-02 19:55:08,005 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:55:08,005 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-12-02 19:55:08,006 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:55:08,006 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-12-02 19:55:08,007 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-12-02 19:55:08,007 INFO  L87              Difference]: Start difference. First operand 97 states and 136 transitions. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:55:08,128 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:55:08,128 INFO  L93              Difference]: Finished difference Result 205 states and 288 transitions.
[2023-12-02 19:55:08,129 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-12-02 19:55:08,129 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118
[2023-12-02 19:55:08,130 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:55:08,130 INFO  L225             Difference]: With dead ends: 205
[2023-12-02 19:55:08,131 INFO  L226             Difference]: Without dead ends: 109
[2023-12-02 19:55:08,131 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-12-02 19:55:08,132 INFO  L413           NwaCegarLoop]: 129 mSDtfsCounter, 21 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-12-02 19:55:08,132 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 387 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-12-02 19:55:08,133 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 109 states.
[2023-12-02 19:55:08,138 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99.
[2023-12-02 19:55:08,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 99 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14)
[2023-12-02 19:55:08,139 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions.
[2023-12-02 19:55:08,139 INFO  L78                 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 118
[2023-12-02 19:55:08,140 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:55:08,140 INFO  L495      AbstractCegarLoop]: Abstraction has 99 states and 138 transitions.
[2023-12-02 19:55:08,140 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:55:08,140 INFO  L276                IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions.
[2023-12-02 19:55:08,141 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2023-12-02 19:55:08,141 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:55:08,141 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:55:08,147 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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
[2023-12-02 19:55:08,342 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:55:08,342 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:55:08,342 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:55:08,342 INFO  L85        PathProgramCache]: Analyzing trace with hash 1162607295, now seen corresponding path program 1 times
[2023-12-02 19:55:08,343 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:55:08,343 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089539087]
[2023-12-02 19:55:08,343 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:55:08,343 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
[2023-12-02 19:55:08,343 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:55:08,344 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:55:08,345 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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
[2023-12-02 19:55:08,547 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:55:08,555 INFO  L262         TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-12-02 19:55:08,557 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:55:08,591 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2023-12-02 19:55:08,591 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:55:08,591 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:55:08,591 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089539087]
[2023-12-02 19:55:08,592 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089539087] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:55:08,592 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:55:08,592 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-12-02 19:55:08,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712053144]
[2023-12-02 19:55:08,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:55:08,593 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-12-02 19:55:08,593 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:55:08,594 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-12-02 19:55:08,594 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-12-02 19:55:08,594 INFO  L87              Difference]: Start difference. First operand 99 states and 138 transitions. Second operand  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:55:08,709 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:55:08,709 INFO  L93              Difference]: Finished difference Result 210 states and 293 transitions.
[2023-12-02 19:55:08,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-12-02 19:55:08,710 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118
[2023-12-02 19:55:08,710 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:55:08,711 INFO  L225             Difference]: With dead ends: 210
[2023-12-02 19:55:08,711 INFO  L226             Difference]: Without dead ends: 112
[2023-12-02 19:55:08,712 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2023-12-02 19:55:08,712 INFO  L413           NwaCegarLoop]: 127 mSDtfsCounter, 24 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-12-02 19:55:08,713 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 511 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-12-02 19:55:08,714 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2023-12-02 19:55:08,719 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 101.
[2023-12-02 19:55:08,719 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 85 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14)
[2023-12-02 19:55:08,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions.
[2023-12-02 19:55:08,720 INFO  L78                 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 118
[2023-12-02 19:55:08,720 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:55:08,721 INFO  L495      AbstractCegarLoop]: Abstraction has 101 states and 140 transitions.
[2023-12-02 19:55:08,721 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:55:08,721 INFO  L276                IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions.
[2023-12-02 19:55:08,722 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2023-12-02 19:55:08,722 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:55:08,722 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:55:08,727 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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
[2023-12-02 19:55:08,923 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:55:08,923 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:55:08,923 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:55:08,923 INFO  L85        PathProgramCache]: Analyzing trace with hash 1219865597, now seen corresponding path program 1 times
[2023-12-02 19:55:08,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:55:08,924 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579937163]
[2023-12-02 19:55:08,924 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:55:08,924 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
[2023-12-02 19:55:08,924 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:55:08,925 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:55:08,931 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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
[2023-12-02 19:55:09,129 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:55:09,137 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-12-02 19:55:09,141 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:55:09,188 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2023-12-02 19:55:09,188 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:55:09,189 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:55:09,189 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579937163]
[2023-12-02 19:55:09,189 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579937163] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:55:09,189 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:55:09,189 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-12-02 19:55:09,189 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044217636]
[2023-12-02 19:55:09,189 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:55:09,190 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-12-02 19:55:09,190 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:55:09,190 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-12-02 19:55:09,190 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-12-02 19:55:09,191 INFO  L87              Difference]: Start difference. First operand 101 states and 140 transitions. Second operand  has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:55:09,438 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:55:09,438 INFO  L93              Difference]: Finished difference Result 213 states and 294 transitions.
[2023-12-02 19:55:09,439 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-12-02 19:55:09,439 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118
[2023-12-02 19:55:09,439 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:55:09,440 INFO  L225             Difference]: With dead ends: 213
[2023-12-02 19:55:09,440 INFO  L226             Difference]: Without dead ends: 113
[2023-12-02 19:55:09,441 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132
[2023-12-02 19:55:09,442 INFO  L413           NwaCegarLoop]: 126 mSDtfsCounter, 19 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2023-12-02 19:55:09,442 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 628 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2023-12-02 19:55:09,443 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2023-12-02 19:55:09,448 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103.
[2023-12-02 19:55:09,449 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 103 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 87 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14)
[2023-12-02 19:55:09,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 142 transitions.
[2023-12-02 19:55:09,451 INFO  L78                 Accepts]: Start accepts. Automaton has 103 states and 142 transitions. Word has length 118
[2023-12-02 19:55:09,451 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:55:09,451 INFO  L495      AbstractCegarLoop]: Abstraction has 103 states and 142 transitions.
[2023-12-02 19:55:09,452 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:55:09,452 INFO  L276                IsEmpty]: Start isEmpty. Operand 103 states and 142 transitions.
[2023-12-02 19:55:09,453 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2023-12-02 19:55:09,453 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:55:09,454 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:55:09,459 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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
[2023-12-02 19:55:09,656 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:55:09,657 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:55:09,657 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:55:09,657 INFO  L85        PathProgramCache]: Analyzing trace with hash 1219925179, now seen corresponding path program 1 times
[2023-12-02 19:55:09,657 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:55:09,657 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936310389]
[2023-12-02 19:55:09,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:55:09,658 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
[2023-12-02 19:55:09,658 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:55:09,659 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:55:09,659 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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
[2023-12-02 19:55:10,038 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:55:10,050 INFO  L262         TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjunts are in the unsatisfiable core
[2023-12-02 19:55:10,058 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:55:10,433 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
[2023-12-02 19:55:10,535 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2023-12-02 19:55:10,629 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2023-12-02 19:55:10,722 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2023-12-02 19:55:10,951 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 19:55:10,951 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37
[2023-12-02 19:55:11,064 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 19:55:11,064 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 57
[2023-12-02 19:55:11,071 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30
[2023-12-02 19:55:11,124 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 19:55:11,124 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2023-12-02 19:55:11,398 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 19:55:11,398 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 31
[2023-12-02 19:55:11,590 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2023-12-02 19:55:11,590 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:55:11,590 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:55:11,590 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936310389]
[2023-12-02 19:55:11,591 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936310389] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:55:11,591 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:55:11,591 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2023-12-02 19:55:11,591 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926811647]
[2023-12-02 19:55:11,591 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:55:11,591 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2023-12-02 19:55:11,591 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:55:11,592 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2023-12-02 19:55:11,592 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156
[2023-12-02 19:55:11,592 INFO  L87              Difference]: Start difference. First operand 103 states and 142 transitions. Second operand  has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:55:15,416 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 19:55:20,070 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:55:22,329 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 19:55:24,204 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 19:55:26,882 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 19:55:27,401 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:55:27,401 INFO  L93              Difference]: Finished difference Result 326 states and 443 transitions.
[2023-12-02 19:55:27,406 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2023-12-02 19:55:27,407 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118
[2023-12-02 19:55:27,407 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:55:27,408 INFO  L225             Difference]: With dead ends: 326
[2023-12-02 19:55:27,408 INFO  L226             Difference]: Without dead ends: 224
[2023-12-02 19:55:27,409 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552
[2023-12-02 19:55:27,410 INFO  L413           NwaCegarLoop]: 81 mSDtfsCounter, 580 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time
[2023-12-02 19:55:27,410 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 597 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time]
[2023-12-02 19:55:27,410 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 224 states.
[2023-12-02 19:55:27,416 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 120.
[2023-12-02 19:55:27,416 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 120 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14)
[2023-12-02 19:55:27,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 164 transitions.
[2023-12-02 19:55:27,417 INFO  L78                 Accepts]: Start accepts. Automaton has 120 states and 164 transitions. Word has length 118
[2023-12-02 19:55:27,418 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:55:27,418 INFO  L495      AbstractCegarLoop]: Abstraction has 120 states and 164 transitions.
[2023-12-02 19:55:27,418 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:55:27,418 INFO  L276                IsEmpty]: Start isEmpty. Operand 120 states and 164 transitions.
[2023-12-02 19:55:27,419 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2023-12-02 19:55:27,419 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:55:27,419 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:55:27,425 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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
[2023-12-02 19:55:27,619 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:55:27,620 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:55:27,620 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:55:27,620 INFO  L85        PathProgramCache]: Analyzing trace with hash -862419118, now seen corresponding path program 1 times
[2023-12-02 19:55:27,621 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:55:27,621 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475531812]
[2023-12-02 19:55:27,621 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:55:27,621 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
[2023-12-02 19:55:27,621 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:55:27,622 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:55:27,623 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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
[2023-12-02 19:55:27,795 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:55:27,803 INFO  L262         TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 3 conjunts are in the unsatisfiable core
[2023-12-02 19:55:27,806 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:55:27,823 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9
[2023-12-02 19:55:28,083 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2023-12-02 19:55:28,083 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:55:28,083 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:55:28,083 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475531812]
[2023-12-02 19:55:28,083 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475531812] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:55:28,084 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:55:28,084 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-12-02 19:55:28,084 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968249854]
[2023-12-02 19:55:28,084 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:55:28,084 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-12-02 19:55:28,085 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:55:28,085 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-12-02 19:55:28,085 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-12-02 19:55:28,085 INFO  L87              Difference]: Start difference. First operand 120 states and 164 transitions. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:55:30,791 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 19:55:33,253 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 19:55:34,317 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:55:34,317 INFO  L93              Difference]: Finished difference Result 357 states and 489 transitions.
[2023-12-02 19:55:34,318 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-12-02 19:55:34,318 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118
[2023-12-02 19:55:34,319 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:55:34,321 INFO  L225             Difference]: With dead ends: 357
[2023-12-02 19:55:34,321 INFO  L226             Difference]: Without dead ends: 238
[2023-12-02 19:55:34,322 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-12-02 19:55:34,322 INFO  L413           NwaCegarLoop]: 129 mSDtfsCounter, 69 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time
[2023-12-02 19:55:34,323 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 326 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time]
[2023-12-02 19:55:34,324 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 238 states.
[2023-12-02 19:55:34,341 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 200.
[2023-12-02 19:55:34,342 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 200 states, 169 states have (on average 1.3076923076923077) internal successors, (221), 169 states have internal predecessors, (221), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2023-12-02 19:55:34,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 277 transitions.
[2023-12-02 19:55:34,344 INFO  L78                 Accepts]: Start accepts. Automaton has 200 states and 277 transitions. Word has length 118
[2023-12-02 19:55:34,345 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:55:34,351 INFO  L495      AbstractCegarLoop]: Abstraction has 200 states and 277 transitions.
[2023-12-02 19:55:34,351 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:55:34,351 INFO  L276                IsEmpty]: Start isEmpty. Operand 200 states and 277 transitions.
[2023-12-02 19:55:34,352 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2023-12-02 19:55:34,352 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:55:34,352 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:55:34,358 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0
[2023-12-02 19:55:34,553 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:55:34,553 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:55:34,554 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:55:34,554 INFO  L85        PathProgramCache]: Analyzing trace with hash -1236144700, now seen corresponding path program 1 times
[2023-12-02 19:55:34,554 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:55:34,554 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183578360]
[2023-12-02 19:55:34,555 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:55:34,555 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
[2023-12-02 19:55:34,555 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:55:34,556 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:55:34,557 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process
[2023-12-02 19:55:34,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:55:34,742 INFO  L262         TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-12-02 19:55:34,745 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:55:34,763 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9
[2023-12-02 19:55:35,017 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2023-12-02 19:55:35,017 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:55:35,017 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:55:35,017 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183578360]
[2023-12-02 19:55:35,017 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [183578360] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:55:35,017 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:55:35,018 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-12-02 19:55:35,018 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733034120]
[2023-12-02 19:55:35,018 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:55:35,018 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-12-02 19:55:35,019 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:55:35,019 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-12-02 19:55:35,019 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-12-02 19:55:35,020 INFO  L87              Difference]: Start difference. First operand 200 states and 277 transitions. Second operand  has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:55:37,216 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:55:39,037 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:55:39,037 INFO  L93              Difference]: Finished difference Result 374 states and 511 transitions.
[2023-12-02 19:55:39,037 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-12-02 19:55:39,038 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118
[2023-12-02 19:55:39,038 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:55:39,039 INFO  L225             Difference]: With dead ends: 374
[2023-12-02 19:55:39,039 INFO  L226             Difference]: Without dead ends: 233
[2023-12-02 19:55:39,040 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-12-02 19:55:39,040 INFO  L413           NwaCegarLoop]: 130 mSDtfsCounter, 77 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time
[2023-12-02 19:55:39,041 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 426 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time]
[2023-12-02 19:55:39,042 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 233 states.
[2023-12-02 19:55:39,050 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 195.
[2023-12-02 19:55:39,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 195 states, 164 states have (on average 1.298780487804878) internal successors, (213), 164 states have internal predecessors, (213), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2023-12-02 19:55:39,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 269 transitions.
[2023-12-02 19:55:39,052 INFO  L78                 Accepts]: Start accepts. Automaton has 195 states and 269 transitions. Word has length 118
[2023-12-02 19:55:39,053 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:55:39,053 INFO  L495      AbstractCegarLoop]: Abstraction has 195 states and 269 transitions.
[2023-12-02 19:55:39,053 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:55:39,053 INFO  L276                IsEmpty]: Start isEmpty. Operand 195 states and 269 transitions.
[2023-12-02 19:55:39,053 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2023-12-02 19:55:39,053 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:55:39,054 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:55:39,058 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0
[2023-12-02 19:55:39,254 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:55:39,254 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:55:39,255 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:55:39,255 INFO  L85        PathProgramCache]: Analyzing trace with hash -1967244764, now seen corresponding path program 1 times
[2023-12-02 19:55:39,255 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:55:39,256 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465569558]
[2023-12-02 19:55:39,256 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:55:39,256 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
[2023-12-02 19:55:39,256 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:55:39,257 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:55:39,258 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process
[2023-12-02 19:55:39,670 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:55:39,684 INFO  L262         TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-12-02 19:55:39,691 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:55:40,037 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2023-12-02 19:55:40,697 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54
[2023-12-02 19:55:41,185 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54
[2023-12-02 19:55:41,672 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54
[2023-12-02 19:55:42,118 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54
[2023-12-02 19:55:42,590 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54
[2023-12-02 19:55:43,181 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54
[2023-12-02 19:55:43,490 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 23 treesize of output 28
[2023-12-02 19:55:43,509 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 109 treesize of output 83
[2023-12-02 19:55:44,738 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 104
[2023-12-02 19:55:50,434 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 19:55:50,434 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 103
[2023-12-02 19:55:50,915 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked.
[2023-12-02 19:55:50,916 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:55:50,916 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:55:50,916 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465569558]
[2023-12-02 19:55:50,916 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465569558] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:55:50,916 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:55:50,916 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2023-12-02 19:55:50,916 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353363544]
[2023-12-02 19:55:50,916 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:55:50,917 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-12-02 19:55:50,917 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:55:50,917 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-12-02 19:55:50,917 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2023-12-02 19:55:50,917 INFO  L87              Difference]: Start difference. First operand 195 states and 269 transitions. Second operand  has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-02 19:55:56,900 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:55:58,747 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:56:01,544 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:56:03,550 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:56:05,747 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:56:08,946 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:56:11,971 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:56:18,025 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 19:56:20,244 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 19:56:20,868 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:56:20,868 INFO  L93              Difference]: Finished difference Result 422 states and 570 transitions.
[2023-12-02 19:56:20,869 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-12-02 19:56:20,870 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120
[2023-12-02 19:56:20,870 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:56:20,874 INFO  L225             Difference]: With dead ends: 422
[2023-12-02 19:56:20,874 INFO  L226             Difference]: Without dead ends: 420
[2023-12-02 19:56:20,874 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210
[2023-12-02 19:56:20,875 INFO  L413           NwaCegarLoop]: 71 mSDtfsCounter, 338 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time
[2023-12-02 19:56:20,876 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 414 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 732 Invalid, 3 Unknown, 0 Unchecked, 27.5s Time]
[2023-12-02 19:56:20,877 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 420 states.
[2023-12-02 19:56:20,912 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 350.
[2023-12-02 19:56:20,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 350 states, 295 states have (on average 1.2949152542372881) internal successors, (382), 295 states have internal predecessors, (382), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50)
[2023-12-02 19:56:20,915 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 482 transitions.
[2023-12-02 19:56:20,915 INFO  L78                 Accepts]: Start accepts. Automaton has 350 states and 482 transitions. Word has length 120
[2023-12-02 19:56:20,916 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:56:20,916 INFO  L495      AbstractCegarLoop]: Abstraction has 350 states and 482 transitions.
[2023-12-02 19:56:20,916 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-02 19:56:20,916 INFO  L276                IsEmpty]: Start isEmpty. Operand 350 states and 482 transitions.
[2023-12-02 19:56:20,918 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2023-12-02 19:56:20,918 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:56:20,918 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:56:20,926 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0
[2023-12-02 19:56:21,122 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:56:21,123 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:56:21,123 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:56:21,123 INFO  L85        PathProgramCache]: Analyzing trace with hash -1967185182, now seen corresponding path program 1 times
[2023-12-02 19:56:21,123 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:56:21,124 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821348099]
[2023-12-02 19:56:21,124 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:56:21,124 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
[2023-12-02 19:56:21,124 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:56:21,125 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:56:21,125 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process
[2023-12-02 19:56:21,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:56:21,542 INFO  L262         TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 32 conjunts are in the unsatisfiable core
[2023-12-02 19:56:21,547 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:56:21,765 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2023-12-02 19:56:21,849 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10
[2023-12-02 19:56:22,033 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24
[2023-12-02 19:56:22,298 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 19:56:22,299 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37
[2023-12-02 19:56:22,651 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 19:56:22,651 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40
[2023-12-02 19:56:23,028 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 19:56:23,028 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 55
[2023-12-02 19:56:23,226 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 19:56:23,227 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 86
[2023-12-02 19:56:23,232 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 56
[2023-12-02 19:56:23,368 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 19:56:23,369 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 90
[2023-12-02 19:56:24,627 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 19:56:24,627 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 123 treesize of output 53
[2023-12-02 19:56:24,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked.
[2023-12-02 19:56:24,733 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:56:24,733 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:56:24,734 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821348099]
[2023-12-02 19:56:24,734 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821348099] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:56:24,734 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:56:24,734 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2023-12-02 19:56:24,734 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156864432]
[2023-12-02 19:56:24,734 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:56:24,735 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2023-12-02 19:56:24,735 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:56:24,735 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2023-12-02 19:56:24,735 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182
[2023-12-02 19:56:24,736 INFO  L87              Difference]: Start difference. First operand 350 states and 482 transitions. Second operand  has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14)
[2023-12-02 19:56:26,264 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:56:30,934 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:56:34,292 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:56:35,337 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:56:37,494 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:56:40,448 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:56:44,334 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:56:46,258 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:56:50,429 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:56:50,593 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:56:50,593 INFO  L93              Difference]: Finished difference Result 835 states and 1105 transitions.
[2023-12-02 19:56:50,594 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2023-12-02 19:56:50,594 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 120
[2023-12-02 19:56:50,595 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:56:50,599 INFO  L225             Difference]: With dead ends: 835
[2023-12-02 19:56:50,599 INFO  L226             Difference]: Without dead ends: 621
[2023-12-02 19:56:50,600 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600
[2023-12-02 19:56:50,600 INFO  L413           NwaCegarLoop]: 77 mSDtfsCounter, 318 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time
[2023-12-02 19:56:50,601 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 576 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 862 Invalid, 3 Unknown, 0 Unchecked, 24.5s Time]
[2023-12-02 19:56:50,602 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 621 states.
[2023-12-02 19:56:50,635 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 559.
[2023-12-02 19:56:50,636 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 559 states, 488 states have (on average 1.278688524590164) internal successors, (624), 489 states have internal predecessors, (624), 52 states have call successors, (52), 18 states have call predecessors, (52), 18 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52)
[2023-12-02 19:56:50,638 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 728 transitions.
[2023-12-02 19:56:50,638 INFO  L78                 Accepts]: Start accepts. Automaton has 559 states and 728 transitions. Word has length 120
[2023-12-02 19:56:50,639 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:56:50,639 INFO  L495      AbstractCegarLoop]: Abstraction has 559 states and 728 transitions.
[2023-12-02 19:56:50,639 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14)
[2023-12-02 19:56:50,640 INFO  L276                IsEmpty]: Start isEmpty. Operand 559 states and 728 transitions.
[2023-12-02 19:56:50,641 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2023-12-02 19:56:50,641 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:56:50,641 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:56:50,648 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0
[2023-12-02 19:56:50,846 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:56:50,847 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:56:50,847 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:56:50,847 INFO  L85        PathProgramCache]: Analyzing trace with hash -1909926880, now seen corresponding path program 1 times
[2023-12-02 19:56:50,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:56:50,848 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394800884]
[2023-12-02 19:56:50,848 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:56:50,848 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
[2023-12-02 19:56:50,848 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:56:50,849 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:56:50,850 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process
[2023-12-02 19:56:51,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:56:51,256 INFO  L262         TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-12-02 19:56:51,262 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:56:51,532 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
[2023-12-02 19:56:52,164 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32
[2023-12-02 19:56:52,467 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42
[2023-12-02 19:56:52,885 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42
[2023-12-02 19:56:53,311 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42
[2023-12-02 19:56:53,768 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42
[2023-12-02 19:56:54,213 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42
[2023-12-02 19:56:54,769 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42
[2023-12-02 19:56:54,901 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 91
[2023-12-02 19:56:55,099 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 29
[2023-12-02 19:56:56,431 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 92
[2023-12-02 19:57:01,554 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 19:57:01,555 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 107
[2023-12-02 19:57:02,085 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked.
[2023-12-02 19:57:02,085 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:57:02,085 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:57:02,085 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394800884]
[2023-12-02 19:57:02,085 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394800884] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:57:02,086 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:57:02,086 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2023-12-02 19:57:02,086 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807915283]
[2023-12-02 19:57:02,086 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:57:02,086 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-12-02 19:57:02,087 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:57:02,087 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-12-02 19:57:02,087 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2023-12-02 19:57:02,087 INFO  L87              Difference]: Start difference. First operand 559 states and 728 transitions. Second operand  has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-02 19:57:06,581 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:57:08,249 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:57:11,031 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:57:13,122 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:57:15,478 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:57:17,579 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:57:20,903 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:57:26,193 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 19:57:31,671 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 19:57:32,203 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:57:32,204 INFO  L93              Difference]: Finished difference Result 1644 states and 2139 transitions.
[2023-12-02 19:57:32,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-12-02 19:57:32,204 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120
[2023-12-02 19:57:32,205 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:57:32,212 INFO  L225             Difference]: With dead ends: 1644
[2023-12-02 19:57:32,213 INFO  L226             Difference]: Without dead ends: 1275
[2023-12-02 19:57:32,214 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210
[2023-12-02 19:57:32,214 INFO  L413           NwaCegarLoop]: 72 mSDtfsCounter, 488 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 11 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.6s IncrementalHoareTripleChecker+Time
[2023-12-02 19:57:32,214 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 419 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 732 Invalid, 6 Unknown, 0 Unchecked, 27.6s Time]
[2023-12-02 19:57:32,216 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1275 states.
[2023-12-02 19:57:32,275 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1041.
[2023-12-02 19:57:32,277 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1041 states, 908 states have (on average 1.277533039647577) internal successors, (1160), 909 states have internal predecessors, (1160), 98 states have call successors, (98), 34 states have call predecessors, (98), 34 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98)
[2023-12-02 19:57:32,281 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1356 transitions.
[2023-12-02 19:57:32,282 INFO  L78                 Accepts]: Start accepts. Automaton has 1041 states and 1356 transitions. Word has length 120
[2023-12-02 19:57:32,282 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:57:32,282 INFO  L495      AbstractCegarLoop]: Abstraction has 1041 states and 1356 transitions.
[2023-12-02 19:57:32,282 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-02 19:57:32,282 INFO  L276                IsEmpty]: Start isEmpty. Operand 1041 states and 1356 transitions.
[2023-12-02 19:57:32,284 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2023-12-02 19:57:32,284 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:57:32,285 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:57:32,290 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0
[2023-12-02 19:57:32,485 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:57:32,485 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:57:32,486 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:57:32,486 INFO  L85        PathProgramCache]: Analyzing trace with hash -366173658, now seen corresponding path program 1 times
[2023-12-02 19:57:32,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:57:32,486 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533884612]
[2023-12-02 19:57:32,486 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:57:32,487 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
[2023-12-02 19:57:32,487 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:57:32,489 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:57:32,490 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process
[2023-12-02 19:57:32,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:57:32,725 INFO  L262         TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core
[2023-12-02 19:57:32,727 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:57:32,743 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked.
[2023-12-02 19:57:32,744 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:57:32,744 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:57:32,744 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533884612]
[2023-12-02 19:57:32,744 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [533884612] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:57:32,744 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:57:32,744 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-12-02 19:57:32,744 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618245084]
[2023-12-02 19:57:32,744 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:57:32,745 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-12-02 19:57:32,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:57:32,745 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-12-02 19:57:32,745 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-12-02 19:57:32,746 INFO  L87              Difference]: Start difference. First operand 1041 states and 1356 transitions. Second operand  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-02 19:57:32,897 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:57:32,897 INFO  L93              Difference]: Finished difference Result 1901 states and 2480 transitions.
[2023-12-02 19:57:32,897 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-12-02 19:57:32,898 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120
[2023-12-02 19:57:32,898 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:57:32,904 INFO  L225             Difference]: With dead ends: 1901
[2023-12-02 19:57:32,904 INFO  L226             Difference]: Without dead ends: 1057
[2023-12-02 19:57:32,906 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-12-02 19:57:32,906 INFO  L413           NwaCegarLoop]: 138 mSDtfsCounter, 7 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-12-02 19:57:32,907 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 393 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-12-02 19:57:32,909 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1057 states.
[2023-12-02 19:57:32,981 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1041.
[2023-12-02 19:57:32,984 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1041 states, 908 states have (on average 1.2731277533039647) internal successors, (1156), 909 states have internal predecessors, (1156), 98 states have call successors, (98), 34 states have call predecessors, (98), 34 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98)
[2023-12-02 19:57:32,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1352 transitions.
[2023-12-02 19:57:32,991 INFO  L78                 Accepts]: Start accepts. Automaton has 1041 states and 1352 transitions. Word has length 120
[2023-12-02 19:57:32,992 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:57:32,992 INFO  L495      AbstractCegarLoop]: Abstraction has 1041 states and 1352 transitions.
[2023-12-02 19:57:32,992 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-02 19:57:32,992 INFO  L276                IsEmpty]: Start isEmpty. Operand 1041 states and 1352 transitions.
[2023-12-02 19:57:32,994 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2023-12-02 19:57:32,994 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:57:32,995 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:57:33,001 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0
[2023-12-02 19:57:33,195 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:57:33,195 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:57:33,196 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:57:33,196 INFO  L85        PathProgramCache]: Analyzing trace with hash 1761758814, now seen corresponding path program 1 times
[2023-12-02 19:57:33,196 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:57:33,196 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151788907]
[2023-12-02 19:57:33,196 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:57:33,197 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
[2023-12-02 19:57:33,197 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:57:33,197 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:57:33,198 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process
[2023-12-02 19:57:33,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:57:33,391 INFO  L262         TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjunts are in the unsatisfiable core
[2023-12-02 19:57:33,394 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:57:33,415 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked.
[2023-12-02 19:57:33,423 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:57:33,423 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:57:33,423 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151788907]
[2023-12-02 19:57:33,423 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151788907] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:57:33,423 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:57:33,423 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-12-02 19:57:33,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871437401]
[2023-12-02 19:57:33,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:57:33,424 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-12-02 19:57:33,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:57:33,424 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-12-02 19:57:33,424 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-12-02 19:57:33,425 INFO  L87              Difference]: Start difference. First operand 1041 states and 1352 transitions. Second operand  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-02 19:57:33,546 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:57:33,547 INFO  L93              Difference]: Finished difference Result 1906 states and 2481 transitions.
[2023-12-02 19:57:33,547 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-12-02 19:57:33,547 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120
[2023-12-02 19:57:33,547 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:57:33,552 INFO  L225             Difference]: With dead ends: 1906
[2023-12-02 19:57:33,553 INFO  L226             Difference]: Without dead ends: 1049
[2023-12-02 19:57:33,554 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-12-02 19:57:33,555 INFO  L413           NwaCegarLoop]: 138 mSDtfsCounter, 7 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-12-02 19:57:33,556 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 393 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-12-02 19:57:33,557 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1049 states.
[2023-12-02 19:57:33,634 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1041.
[2023-12-02 19:57:33,636 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1041 states, 908 states have (on average 1.2709251101321586) internal successors, (1154), 909 states have internal predecessors, (1154), 98 states have call successors, (98), 34 states have call predecessors, (98), 34 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98)
[2023-12-02 19:57:33,641 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1350 transitions.
[2023-12-02 19:57:33,641 INFO  L78                 Accepts]: Start accepts. Automaton has 1041 states and 1350 transitions. Word has length 120
[2023-12-02 19:57:33,641 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:57:33,642 INFO  L495      AbstractCegarLoop]: Abstraction has 1041 states and 1350 transitions.
[2023-12-02 19:57:33,642 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-02 19:57:33,642 INFO  L276                IsEmpty]: Start isEmpty. Operand 1041 states and 1350 transitions.
[2023-12-02 19:57:33,644 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2023-12-02 19:57:33,644 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:57:33,644 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:57:33,651 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0
[2023-12-02 19:57:33,845 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:57:33,845 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:57:33,846 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:57:33,846 INFO  L85        PathProgramCache]: Analyzing trace with hash 865091634, now seen corresponding path program 1 times
[2023-12-02 19:57:33,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:57:33,846 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720473331]
[2023-12-02 19:57:33,846 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:57:33,846 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
[2023-12-02 19:57:33,847 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:57:33,847 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:57:33,848 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process
[2023-12-02 19:57:34,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:57:34,057 INFO  L262         TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-12-02 19:57:34,059 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:57:34,086 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2023-12-02 19:57:34,086 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:57:34,086 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:57:34,086 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720473331]
[2023-12-02 19:57:34,086 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [720473331] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:57:34,086 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:57:34,086 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-12-02 19:57:34,087 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918846106]
[2023-12-02 19:57:34,087 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:57:34,087 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-12-02 19:57:34,087 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:57:34,088 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-12-02 19:57:34,088 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-12-02 19:57:34,088 INFO  L87              Difference]: Start difference. First operand 1041 states and 1350 transitions. Second operand  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:57:37,110 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:57:37,110 INFO  L93              Difference]: Finished difference Result 1556 states and 2009 transitions.
[2023-12-02 19:57:37,111 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-12-02 19:57:37,111 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121
[2023-12-02 19:57:37,111 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:57:37,114 INFO  L225             Difference]: With dead ends: 1556
[2023-12-02 19:57:37,114 INFO  L226             Difference]: Without dead ends: 810
[2023-12-02 19:57:37,115 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-12-02 19:57:37,116 INFO  L413           NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time
[2023-12-02 19:57:37,116 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 316 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time]
[2023-12-02 19:57:37,117 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 810 states.
[2023-12-02 19:57:37,155 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 810.
[2023-12-02 19:57:37,156 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 810 states, 679 states have (on average 1.2135493372606774) internal successors, (824), 679 states have internal predecessors, (824), 96 states have call successors, (96), 34 states have call predecessors, (96), 34 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96)
[2023-12-02 19:57:37,159 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1016 transitions.
[2023-12-02 19:57:37,160 INFO  L78                 Accepts]: Start accepts. Automaton has 810 states and 1016 transitions. Word has length 121
[2023-12-02 19:57:37,160 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:57:37,160 INFO  L495      AbstractCegarLoop]: Abstraction has 810 states and 1016 transitions.
[2023-12-02 19:57:37,160 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 19:57:37,160 INFO  L276                IsEmpty]: Start isEmpty. Operand 810 states and 1016 transitions.
[2023-12-02 19:57:37,161 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2023-12-02 19:57:37,162 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:57:37,162 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:57:37,166 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0
[2023-12-02 19:57:37,362 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:57:37,362 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:57:37,363 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:57:37,363 INFO  L85        PathProgramCache]: Analyzing trace with hash -396901553, now seen corresponding path program 1 times
[2023-12-02 19:57:37,363 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:57:37,364 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559250394]
[2023-12-02 19:57:37,364 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:57:37,364 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
[2023-12-02 19:57:37,364 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:57:37,365 INFO  L229       MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:57:37,366 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process
[2023-12-02 19:57:37,802 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:57:37,818 INFO  L262         TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 41 conjunts are in the unsatisfiable core
[2023-12-02 19:57:37,823 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:57:37,912 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31
[2023-12-02 19:57:38,342 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23
[2023-12-02 19:57:39,219 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 54
[2023-12-02 19:57:40,686 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 115
[2023-12-02 19:57:41,640 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 115
[2023-12-02 19:57:42,610 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 115
[2023-12-02 19:57:43,542 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 115
[2023-12-02 19:57:44,496 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 115
[2023-12-02 19:57:45,718 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 115
[2023-12-02 19:57:45,951 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 153 treesize of output 115
[2023-12-02 19:57:49,696 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 19:57:49,696 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 260 treesize of output 104
[2023-12-02 19:57:53,509 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked.
[2023-12-02 19:57:53,509 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:57:53,509 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:57:53,509 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559250394]
[2023-12-02 19:57:53,509 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [559250394] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:57:53,509 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:57:53,510 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2023-12-02 19:57:53,510 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089344890]
[2023-12-02 19:57:53,510 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:57:53,510 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2023-12-02 19:57:53,510 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:57:53,511 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2023-12-02 19:57:53,511 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240
[2023-12-02 19:57:53,511 INFO  L87              Difference]: Start difference. First operand 810 states and 1016 transitions. Second operand  has 16 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14)
[2023-12-02 19:58:25,704 WARN  L293               SmtUtils]: Spent 9.01s on a formula simplification. DAG size of input: 99 DAG size of output: 90 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2023-12-02 19:58:37,167 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 19:58:40,164 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 19:58:43,405 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:58:43,405 INFO  L93              Difference]: Finished difference Result 1521 states and 1915 transitions.
[2023-12-02 19:58:43,406 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-12-02 19:58:43,407 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122
[2023-12-02 19:58:43,407 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:58:43,411 INFO  L225             Difference]: With dead ends: 1521
[2023-12-02 19:58:43,411 INFO  L226             Difference]: Without dead ends: 991
[2023-12-02 19:58:43,412 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812
[2023-12-02 19:58:43,413 INFO  L413           NwaCegarLoop]: 75 mSDtfsCounter, 442 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.1s IncrementalHoareTripleChecker+Time
[2023-12-02 19:58:43,413 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 587 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 31.1s Time]
[2023-12-02 19:58:43,414 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 991 states.
[2023-12-02 19:58:43,491 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 814.
[2023-12-02 19:58:43,493 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 814 states, 683 states have (on average 1.212298682284041) internal successors, (828), 683 states have internal predecessors, (828), 96 states have call successors, (96), 34 states have call predecessors, (96), 34 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96)
[2023-12-02 19:58:43,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1020 transitions.
[2023-12-02 19:58:43,497 INFO  L78                 Accepts]: Start accepts. Automaton has 814 states and 1020 transitions. Word has length 122
[2023-12-02 19:58:43,498 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:58:43,498 INFO  L495      AbstractCegarLoop]: Abstraction has 814 states and 1020 transitions.
[2023-12-02 19:58:43,498 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14)
[2023-12-02 19:58:43,498 INFO  L276                IsEmpty]: Start isEmpty. Operand 814 states and 1020 transitions.
[2023-12-02 19:58:43,500 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2023-12-02 19:58:43,500 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:58:43,500 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:58:43,508 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0
[2023-12-02 19:58:43,700 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:58:43,701 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:58:43,701 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:58:43,701 INFO  L85        PathProgramCache]: Analyzing trace with hash 2092627409, now seen corresponding path program 1 times
[2023-12-02 19:58:43,702 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:58:43,702 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032231064]
[2023-12-02 19:58:43,702 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:58:43,702 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
[2023-12-02 19:58:43,702 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:58:43,703 INFO  L229       MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:58:43,703 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process
[2023-12-02 19:58:44,215 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:58:44,233 INFO  L262         TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-12-02 19:58:44,239 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:58:44,343 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31
[2023-12-02 19:58:44,760 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23
[2023-12-02 19:58:45,082 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 23
[2023-12-02 19:58:46,090 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 79
[2023-12-02 19:58:46,788 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 79
[2023-12-02 19:58:47,497 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 79
[2023-12-02 19:58:48,182 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 79
[2023-12-02 19:58:48,786 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 79
[2023-12-02 19:58:49,626 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 79
[2023-12-02 19:58:49,793 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 105 treesize of output 79
[2023-12-02 19:58:51,820 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 19:58:51,820 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65
[2023-12-02 19:58:55,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked.
[2023-12-02 19:58:55,402 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 19:58:55,402 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 19:58:55,402 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032231064]
[2023-12-02 19:58:55,403 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032231064] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 19:58:55,403 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 19:58:55,403 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2023-12-02 19:58:55,403 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701443071]
[2023-12-02 19:58:55,403 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 19:58:55,403 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-12-02 19:58:55,403 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 19:58:55,404 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-12-02 19:58:55,404 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2023-12-02 19:58:55,404 INFO  L87              Difference]: Start difference. First operand 814 states and 1020 transitions. Second operand  has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-02 19:59:22,173 WARN  L293               SmtUtils]: Spent 12.37s on a formula simplification. DAG size of input: 75 DAG size of output: 66 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2023-12-02 19:59:32,738 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 19:59:34,870 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 19:59:38,285 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 19:59:38,285 INFO  L93              Difference]: Finished difference Result 1426 states and 1791 transitions.
[2023-12-02 19:59:38,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-12-02 19:59:38,286 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 122
[2023-12-02 19:59:38,287 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 19:59:38,290 INFO  L225             Difference]: With dead ends: 1426
[2023-12-02 19:59:38,291 INFO  L226             Difference]: Without dead ends: 886
[2023-12-02 19:59:38,292 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306
[2023-12-02 19:59:38,292 INFO  L413           NwaCegarLoop]: 82 mSDtfsCounter, 271 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.0s IncrementalHoareTripleChecker+Time
[2023-12-02 19:59:38,292 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 433 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 26.0s Time]
[2023-12-02 19:59:38,294 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 886 states.
[2023-12-02 19:59:38,357 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 858.
[2023-12-02 19:59:38,359 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 858 states, 720 states have (on average 1.2097222222222221) internal successors, (871), 722 states have internal predecessors, (871), 100 states have call successors, (100), 37 states have call predecessors, (100), 37 states have return successors, (100), 98 states have call predecessors, (100), 100 states have call successors, (100)
[2023-12-02 19:59:38,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1071 transitions.
[2023-12-02 19:59:38,361 INFO  L78                 Accepts]: Start accepts. Automaton has 858 states and 1071 transitions. Word has length 122
[2023-12-02 19:59:38,362 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 19:59:38,362 INFO  L495      AbstractCegarLoop]: Abstraction has 858 states and 1071 transitions.
[2023-12-02 19:59:38,362 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-02 19:59:38,362 INFO  L276                IsEmpty]: Start isEmpty. Operand 858 states and 1071 transitions.
[2023-12-02 19:59:38,363 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2023-12-02 19:59:38,364 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 19:59:38,364 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 19:59:38,371 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0
[2023-12-02 19:59:38,564 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 19:59:38,565 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 19:59:38,565 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 19:59:38,565 INFO  L85        PathProgramCache]: Analyzing trace with hash 392752618, now seen corresponding path program 1 times
[2023-12-02 19:59:38,565 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 19:59:38,565 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145062670]
[2023-12-02 19:59:38,565 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 19:59:38,565 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
[2023-12-02 19:59:38,566 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 19:59:38,566 INFO  L229       MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 19:59:38,568 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process
[2023-12-02 19:59:38,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 19:59:39,005 INFO  L262         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 34 conjunts are in the unsatisfiable core
[2023-12-02 19:59:39,011 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 19:59:39,434 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2023-12-02 19:59:40,531 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 19:59:41,068 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 19:59:41,613 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 19:59:42,192 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 19:59:42,749 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 19:59:43,427 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 19:59:43,822 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 23 treesize of output 28
[2023-12-02 19:59:43,848 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 107 treesize of output 81
[2023-12-02 19:59:45,519 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 102
[2023-12-02 19:59:52,343 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 19:59:52,343 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 275 treesize of output 101
[2023-12-02 19:59:52,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 142 proven. 30 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked.
[2023-12-02 19:59:52,875 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-02 20:00:08,749 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (_ BitVec 32)) (v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_79| (_ BitVec 64)) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (|~#double_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_622 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_620))) (or (not (= ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (select (select (store .cse1 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_619) |c_~#float_Array_0~0.base|) .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_79|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_79|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_79|)))) (let ((.cse6 (bvadd |~#double_Array_0~0.offset| (_ bv8 32))) (.cse5 (bvadd |~#double_Array_0~0.offset| (_ bv12 32)))) (let ((.cse7 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select (store .cse1 |c_~#unsigned_char_Array_0~0.base| (store (select .cse1 |c_~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_618)) |c_~#double_Array_0~0.base|) .cse6 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_79|)) .cse5 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_79|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_622))) (fp.eq (let ((.cse3 (let ((.cse4 (select .cse7 |c_~#double_Array_0~0.base|))) (concat (select .cse4 .cse5) (select .cse4 .cse6))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse8 (select (select .cse7 |c_~#float_Array_0~0.base|) .cse2))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))))))))) is different from false
[2023-12-02 20:00:13,623 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (_ BitVec 32)) (v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_79| (_ BitVec 64)) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (|~#double_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_622 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_620))) (or (not (= ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (select (select (store .cse1 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_619) |c_~#float_Array_0~0.base|) .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_79|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_79|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_79|)))) (let ((.cse6 (bvadd |~#double_Array_0~0.offset| (_ bv8 32))) (.cse5 (bvadd |~#double_Array_0~0.offset| (_ bv12 32)))) (let ((.cse7 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select (store .cse1 |c_~#unsigned_char_Array_0~0.base| (store (select (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_617) |c_~#double_Array_0~0.base| v_ArrVal_620) |c_~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_618)) |c_~#double_Array_0~0.base|) .cse6 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_79|)) .cse5 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_79|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_622))) (fp.eq (let ((.cse3 (let ((.cse4 (select .cse7 |c_~#double_Array_0~0.base|))) (concat (select .cse4 .cse5) (select .cse4 .cse6))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse8 (select (select .cse7 |c_~#float_Array_0~0.base|) .cse2))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))))))))) is different from false
[2023-12-02 20:00:18,768 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 20:00:18,768 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145062670]
[2023-12-02 20:00:18,768 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145062670] provided 0 perfect and 1 imperfect interpolant sequences
[2023-12-02 20:00:18,768 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1704897060]
[2023-12-02 20:00:18,769 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 20:00:18,769 INFO  L173          SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2023-12-02 20:00:18,769 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/cvc4
[2023-12-02 20:00:18,770 INFO  L229       MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2023-12-02 20:00:18,771 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process
[2023-12-02 20:00:19,868 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 20:00:19,881 INFO  L262         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 47 conjunts are in the unsatisfiable core
[2023-12-02 20:00:19,888 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 20:00:21,364 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2023-12-02 20:00:25,854 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 20:00:26,543 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 20:00:27,167 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 20:00:27,847 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 20:00:28,503 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 20:00:29,361 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 20:00:29,548 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 113 treesize of output 94
[2023-12-02 20:00:29,773 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17
[2023-12-02 20:00:31,770 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 98
[2023-12-02 20:00:44,722 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 101
[2023-12-02 20:00:45,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 142 proven. 30 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked.
[2023-12-02 20:00:45,076 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-02 20:01:14,009 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64)) (v_ArrVal_622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_660 (_ BitVec 32)) (v_ArrVal_658 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_658))) (or (not (= ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (select (select (store .cse1 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_662) |c_~#float_Array_0~0.base|) .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_84|)))) (let ((.cse6 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse5 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32)))) (let ((.cse7 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select (store .cse1 |c_~#unsigned_char_Array_0~0.base| (store (select .cse1 |c_~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_660)) |c_~#double_Array_0~0.base|) .cse6 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|)) .cse5 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_622))) (fp.eq (let ((.cse3 (let ((.cse4 (select .cse7 |c_~#double_Array_0~0.base|))) (concat (select .cse4 .cse5) (select .cse4 .cse6))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse8 (select (select .cse7 |c_~#float_Array_0~0.base|) .cse2))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))))))))) is different from false
[2023-12-02 20:01:19,207 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64)) (v_ArrVal_622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_660 (_ BitVec 32)) (v_ArrVal_657 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_658 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_658)) (.cse6 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|))) (or (let ((.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32)))) (let ((.cse4 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select (store .cse7 |c_~#unsigned_char_Array_0~0.base| (store (select (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_657) |c_~#double_Array_0~0.base| v_ArrVal_658) |c_~#unsigned_char_Array_0~0.base|) (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_660)) |c_~#double_Array_0~0.base|) .cse3 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_622))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse4 |c_~#double_Array_0~0.base|))) (concat (select .cse1 .cse2) (select .cse1 .cse3))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (select (select .cse4 |c_~#float_Array_0~0.base|) .cse6))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse8 (select (select (store .cse7 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_662) |c_~#float_Array_0~0.base|) .cse6))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_84|))))))) is different from false
[2023-12-02 20:01:24,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1704897060] provided 0 perfect and 1 imperfect interpolant sequences
[2023-12-02 20:01:24,625 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58335078]
[2023-12-02 20:01:24,625 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 20:01:24,625 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-02 20:01:24,625 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3
[2023-12-02 20:01:24,626 INFO  L229       MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-12-02 20:01:24,627 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process
[2023-12-02 20:01:30,791 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 20:01:30,820 INFO  L262         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 41 conjunts are in the unsatisfiable core
[2023-12-02 20:01:30,827 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 20:01:31,998 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2023-12-02 20:01:37,285 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 20:01:37,887 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 20:01:38,525 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 20:01:39,206 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 20:01:39,902 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 20:01:40,712 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52
[2023-12-02 20:01:41,065 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31
[2023-12-02 20:01:41,077 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 64
[2023-12-02 20:01:41,094 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 81
[2023-12-02 20:01:41,914 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 102
[2023-12-02 20:01:51,315 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 20:01:51,316 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 275 treesize of output 101
[2023-12-02 20:01:51,696 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 142 proven. 30 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked.
[2023-12-02 20:01:51,696 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-02 20:02:07,955 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_705 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_705))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 |c_~#double_Array_0~0.base|))) (concat (select .cse1 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (select .cse1 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (select (select .cse2 |c_~#float_Array_0~0.base|) (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) is different from false
[2023-12-02 20:02:09,896 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (_ BitVec 32)) (|~#double_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_700 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_88| (_ BitVec 64))) (let ((.cse7 (let ((.cse9 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_700))) (store .cse9 |c_~#unsigned_char_Array_0~0.base| (store (select .cse9 |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_702)))) (.cse6 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|))) (or (let ((.cse3 (bvadd |~#double_Array_0~0.offset| (_ bv8 32))) (.cse2 (bvadd |~#double_Array_0~0.offset| (_ bv12 32)))) (let ((.cse4 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select .cse7 |c_~#double_Array_0~0.base|) .cse3 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_88|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_88|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_705))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse4 |c_~#double_Array_0~0.base|))) (concat (select .cse1 .cse2) (select .cse1 .cse3))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (select (select .cse4 |c_~#float_Array_0~0.base|) .cse6))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse8 (select (select .cse7 |c_~#float_Array_0~0.base|) .cse6))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_88|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_88|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_88|))))))) is different from false
[2023-12-02 20:02:14,784 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (_ BitVec 32)) (|~#double_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_699 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_700 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_88| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)) (.cse1 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_700) |c_~#unsigned_char_Array_0~0.base| (store (select (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_699) |c_~#double_Array_0~0.base| v_ArrVal_700) |c_~#unsigned_char_Array_0~0.base|) (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)) v_ArrVal_702)))) (or (not (= ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (select (select .cse1 |c_~#float_Array_0~0.base|) .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_88|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_88|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_88|)))) (let ((.cse6 (bvadd |~#double_Array_0~0.offset| (_ bv8 32))) (.cse5 (bvadd |~#double_Array_0~0.offset| (_ bv12 32)))) (let ((.cse7 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select .cse1 |c_~#double_Array_0~0.base|) .cse6 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_88|)) .cse5 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_88|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_705))) (fp.eq (let ((.cse3 (let ((.cse4 (select .cse7 |c_~#double_Array_0~0.base|))) (concat (select .cse4 .cse5) (select .cse4 .cse6))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse8 (select (select .cse7 |c_~#float_Array_0~0.base|) .cse2))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))))))))) is different from false
[2023-12-02 20:02:20,882 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [58335078] provided 0 perfect and 1 imperfect interpolant sequences
[2023-12-02 20:02:20,882 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-12-02 20:02:20,883 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 35
[2023-12-02 20:02:20,883 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486226278]
[2023-12-02 20:02:20,883 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-12-02 20:02:20,884 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2023-12-02 20:02:20,884 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 20:02:20,884 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2023-12-02 20:02:20,885 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1572, Unknown=24, NotChecked=616, Total=2450
[2023-12-02 20:02:20,886 INFO  L87              Difference]: Start difference. First operand 858 states and 1071 transitions. Second operand  has 36 states, 33 states have (on average 4.878787878787879) internal successors, (161), 32 states have internal predecessors, (161), 9 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (42), 6 states have call predecessors, (42), 9 states have call successors, (42)
[2023-12-02 20:02:45,250 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:02:47,369 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:02:50,203 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:02:59,014 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:03:01,254 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:03:04,316 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:03:07,511 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:03:09,743 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:03:11,862 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:03:18,370 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:03:19,392 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:03:22,124 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:03:36,168 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:03:39,307 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:03:43,630 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 20:03:44,757 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 20:03:44,758 INFO  L93              Difference]: Finished difference Result 1809 states and 2229 transitions.
[2023-12-02 20:03:44,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2023-12-02 20:03:44,759 INFO  L78                 Accepts]: Start accepts. Automaton has  has 36 states, 33 states have (on average 4.878787878787879) internal successors, (161), 32 states have internal predecessors, (161), 9 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (42), 6 states have call predecessors, (42), 9 states have call successors, (42) Word has length 122
[2023-12-02 20:03:44,759 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 20:03:44,770 INFO  L225             Difference]: With dead ends: 1809
[2023-12-02 20:03:44,770 INFO  L226             Difference]: Without dead ends: 1807
[2023-12-02 20:03:44,773 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 400 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1441 ImplicationChecksByTransitivity, 110.4s TimeCoverageRelationStatistics Valid=786, Invalid=4188, Unknown=24, NotChecked=1008, Total=6006
[2023-12-02 20:03:44,773 INFO  L413           NwaCegarLoop]: 65 mSDtfsCounter, 1265 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 2036 mSolverCounterSat, 182 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 2036 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.9s IncrementalHoareTripleChecker+Time
[2023-12-02 20:03:44,774 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 816 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 2036 Invalid, 10 Unknown, 0 Unchecked, 53.9s Time]
[2023-12-02 20:03:44,775 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1807 states.
[2023-12-02 20:03:44,920 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1288.
[2023-12-02 20:03:44,921 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1288 states, 1070 states have (on average 1.2037383177570093) internal successors, (1288), 1076 states have internal predecessors, (1288), 156 states have call successors, (156), 61 states have call predecessors, (156), 61 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156)
[2023-12-02 20:03:44,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1600 transitions.
[2023-12-02 20:03:44,926 INFO  L78                 Accepts]: Start accepts. Automaton has 1288 states and 1600 transitions. Word has length 122
[2023-12-02 20:03:44,926 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 20:03:44,926 INFO  L495      AbstractCegarLoop]: Abstraction has 1288 states and 1600 transitions.
[2023-12-02 20:03:44,926 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 36 states, 33 states have (on average 4.878787878787879) internal successors, (161), 32 states have internal predecessors, (161), 9 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (42), 6 states have call predecessors, (42), 9 states have call successors, (42)
[2023-12-02 20:03:44,926 INFO  L276                IsEmpty]: Start isEmpty. Operand 1288 states and 1600 transitions.
[2023-12-02 20:03:44,928 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2023-12-02 20:03:44,928 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 20:03:44,928 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 20:03:44,958 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0
[2023-12-02 20:03:45,136 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0
[2023-12-02 20:03:45,335 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0
[2023-12-02 20:03:45,529 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt
[2023-12-02 20:03:45,530 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 20:03:45,530 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 20:03:45,530 INFO  L85        PathProgramCache]: Analyzing trace with hash -663978584, now seen corresponding path program 1 times
[2023-12-02 20:03:45,531 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 20:03:45,531 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261686401]
[2023-12-02 20:03:45,531 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 20:03:45,531 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
[2023-12-02 20:03:45,531 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 20:03:45,532 INFO  L229       MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 20:03:45,533 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process
[2023-12-02 20:03:45,737 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 20:03:45,747 INFO  L262         TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-12-02 20:03:45,749 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 20:03:45,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked.
[2023-12-02 20:03:45,808 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 20:03:45,808 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 20:03:45,808 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261686401]
[2023-12-02 20:03:45,808 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [261686401] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 20:03:45,808 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 20:03:45,809 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-12-02 20:03:45,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540282329]
[2023-12-02 20:03:45,809 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 20:03:45,809 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-12-02 20:03:45,809 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 20:03:45,810 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-12-02 20:03:45,810 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-12-02 20:03:45,810 INFO  L87              Difference]: Start difference. First operand 1288 states and 1600 transitions. Second operand  has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14)
[2023-12-02 20:03:46,214 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 20:03:46,215 INFO  L93              Difference]: Finished difference Result 1958 states and 2411 transitions.
[2023-12-02 20:03:46,215 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-12-02 20:03:46,215 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122
[2023-12-02 20:03:46,215 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 20:03:46,220 INFO  L225             Difference]: With dead ends: 1958
[2023-12-02 20:03:46,220 INFO  L226             Difference]: Without dead ends: 950
[2023-12-02 20:03:46,223 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2023-12-02 20:03:46,224 INFO  L413           NwaCegarLoop]: 113 mSDtfsCounter, 7 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2023-12-02 20:03:46,224 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 521 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2023-12-02 20:03:46,226 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 950 states.
[2023-12-02 20:03:46,334 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 727.
[2023-12-02 20:03:46,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 727 states, 588 states have (on average 1.1887755102040816) internal successors, (699), 588 states have internal predecessors, (699), 96 states have call successors, (96), 42 states have call predecessors, (96), 42 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96)
[2023-12-02 20:03:46,339 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 891 transitions.
[2023-12-02 20:03:46,339 INFO  L78                 Accepts]: Start accepts. Automaton has 727 states and 891 transitions. Word has length 122
[2023-12-02 20:03:46,339 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 20:03:46,339 INFO  L495      AbstractCegarLoop]: Abstraction has 727 states and 891 transitions.
[2023-12-02 20:03:46,339 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14)
[2023-12-02 20:03:46,339 INFO  L276                IsEmpty]: Start isEmpty. Operand 727 states and 891 transitions.
[2023-12-02 20:03:46,341 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2023-12-02 20:03:46,341 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 20:03:46,341 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 20:03:46,348 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0
[2023-12-02 20:03:46,542 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 20:03:46,542 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 20:03:46,542 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 20:03:46,542 INFO  L85        PathProgramCache]: Analyzing trace with hash -705738406, now seen corresponding path program 1 times
[2023-12-02 20:03:46,543 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 20:03:46,543 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752133559]
[2023-12-02 20:03:46,543 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 20:03:46,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
[2023-12-02 20:03:46,543 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 20:03:46,544 INFO  L229       MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 20:03:46,545 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process
[2023-12-02 20:03:46,960 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 20:03:46,975 INFO  L262         TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 35 conjunts are in the unsatisfiable core
[2023-12-02 20:03:46,980 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 20:03:47,304 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2023-12-02 20:03:48,279 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30
[2023-12-02 20:03:48,669 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:03:49,192 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:03:49,671 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:03:50,187 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:03:50,739 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:03:51,379 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:03:51,510 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 90
[2023-12-02 20:03:51,688 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 39
[2023-12-02 20:03:53,489 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 98
[2023-12-02 20:03:59,695 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 20:03:59,695 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 251 treesize of output 109
[2023-12-02 20:04:00,358 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 107 proven. 33 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked.
[2023-12-02 20:04:00,359 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-02 20:04:04,628 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_774))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 |c_~#double_Array_0~0.base|))) (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (select (select .cse2 |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) is different from false
[2023-12-02 20:04:06,648 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 (Array (_ BitVec 32) (_ BitVec 32))) (|~#double_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_770 (Array (_ BitVec 32) (_ BitVec 32))) (v_skolemized_v_prenex_5_27 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_97| (_ BitVec 64))) (or (not (= ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (fp ((_ extract 63 63) v_skolemized_v_prenex_5_27) ((_ extract 62 52) v_skolemized_v_prenex_5_27) ((_ extract 51 0) v_skolemized_v_prenex_5_27)))) (let ((.cse3 (bvadd |~#double_Array_0~0.offset| (_ bv4 32)))) (let ((.cse4 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#double_Array_0~0.base|) |~#double_Array_0~0.offset| ((_ extract 31 0) v_skolemized_v_prenex_5_27)) .cse3 ((_ extract 63 32) v_skolemized_v_prenex_5_27))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_770) |c_~#double_Array_0~0.base|) (bvadd |~#double_Array_0~0.offset| (_ bv8 32)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_97|)) (bvadd |~#double_Array_0~0.offset| (_ bv12 32)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_97|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_774))) (fp.eq (let ((.cse1 (let ((.cse2 (select .cse4 |c_~#double_Array_0~0.base|))) (concat (select .cse2 .cse3) (select .cse2 |~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (select (select .cse4 |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))))))) is different from false
[2023-12-02 20:04:11,666 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 (Array (_ BitVec 32) (_ BitVec 32))) (|~#double_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_770 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_769 (Array (_ BitVec 32) (_ BitVec 32))) (v_skolemized_v_prenex_5_27 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_97| (_ BitVec 64))) (let ((.cse5 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_769))) (or (let ((.cse2 (bvadd |~#double_Array_0~0.offset| (_ bv4 32)))) (let ((.cse3 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select .cse5 |c_~#double_Array_0~0.base|) |~#double_Array_0~0.offset| ((_ extract 31 0) v_skolemized_v_prenex_5_27)) .cse2 ((_ extract 63 32) v_skolemized_v_prenex_5_27))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_770) |c_~#double_Array_0~0.base|) (bvadd |~#double_Array_0~0.offset| (_ bv8 32)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_97|)) (bvadd |~#double_Array_0~0.offset| (_ bv12 32)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_97|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_774))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 |c_~#double_Array_0~0.base|))) (concat (select .cse1 .cse2) (select .cse1 |~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse4 (select (select .cse3 |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse6 (select (select .cse5 |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (fp ((_ extract 63 63) v_skolemized_v_prenex_5_27) ((_ extract 62 52) v_skolemized_v_prenex_5_27) ((_ extract 51 0) v_skolemized_v_prenex_5_27))))))) is different from false
[2023-12-02 20:04:16,822 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 20:04:16,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752133559]
[2023-12-02 20:04:16,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [752133559] provided 0 perfect and 1 imperfect interpolant sequences
[2023-12-02 20:04:16,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [964644673]
[2023-12-02 20:04:16,822 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 20:04:16,822 INFO  L173          SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2023-12-02 20:04:16,822 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/cvc4
[2023-12-02 20:04:16,823 INFO  L229       MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2023-12-02 20:04:16,824 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process
[2023-12-02 20:04:17,925 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 20:04:17,956 INFO  L262         TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 45 conjunts are in the unsatisfiable core
[2023-12-02 20:04:17,964 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 20:04:18,622 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2023-12-02 20:04:23,261 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30
[2023-12-02 20:04:23,864 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:04:24,725 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:04:25,477 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:04:26,154 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:04:26,909 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:04:27,934 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:04:28,108 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82
[2023-12-02 20:04:28,436 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17
[2023-12-02 20:04:34,852 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 80
[2023-12-02 20:04:42,544 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 101
[2023-12-02 20:04:42,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 107 proven. 33 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked.
[2023-12-02 20:04:42,848 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-02 20:04:45,012 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_819))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 |c_~#double_Array_0~0.base|))) (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (select (select .cse2 |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) is different from false
[2023-12-02 20:04:46,964 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (_ BitVec 32)) (v_skolemized_v_prenex_5_29 (_ BitVec 64)) (v_ArrVal_813 (_ BitVec 32)) (v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#double_Array_0~0.base|) |c_~#double_Array_0~0.offset| ((_ extract 31 0) v_skolemized_v_prenex_5_29)) .cse2 ((_ extract 63 32) v_skolemized_v_prenex_5_29))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_812) |c_~#double_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|) v_ArrVal_813) (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32)) v_ArrVal_814)) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_819))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 |c_~#double_Array_0~0.base|))) (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse4 (select (select .cse3 |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (fp ((_ extract 63 63) v_skolemized_v_prenex_5_29) ((_ extract 62 52) v_skolemized_v_prenex_5_29) ((_ extract 51 0) v_skolemized_v_prenex_5_29)))))) is different from false
[2023-12-02 20:04:51,021 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (_ BitVec 32)) (v_skolemized_v_prenex_5_29 (_ BitVec 64)) (v_ArrVal_813 (_ BitVec 32)) (v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_811))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select .cse5 |c_~#double_Array_0~0.base|) |c_~#double_Array_0~0.offset| ((_ extract 31 0) v_skolemized_v_prenex_5_29)) .cse2 ((_ extract 63 32) v_skolemized_v_prenex_5_29))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_812) |c_~#double_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|) v_ArrVal_813) (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32)) v_ArrVal_814)) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_819))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 |c_~#double_Array_0~0.base|))) (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse4 (select (select .cse3 |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_5_29) ((_ extract 62 52) v_skolemized_v_prenex_5_29) ((_ extract 51 0) v_skolemized_v_prenex_5_29)) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse6 (select (select .cse5 |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))))) is different from false
[2023-12-02 20:04:55,307 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleCvc4 [964644673] provided 0 perfect and 1 imperfect interpolant sequences
[2023-12-02 20:04:55,307 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306398326]
[2023-12-02 20:04:55,307 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 20:04:55,307 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-02 20:04:55,307 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3
[2023-12-02 20:04:55,308 INFO  L229       MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-12-02 20:04:55,309 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process
[2023-12-02 20:05:01,587 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 20:05:01,599 INFO  L262         TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 38 conjunts are in the unsatisfiable core
[2023-12-02 20:05:01,603 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 20:05:04,980 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30
[2023-12-02 20:05:05,292 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:05:05,717 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:05:06,106 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:05:06,537 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:05:06,968 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:05:07,488 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40
[2023-12-02 20:05:07,597 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 90
[2023-12-02 20:05:07,750 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 39
[2023-12-02 20:05:08,354 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 98
[2023-12-02 20:05:12,316 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 20:05:12,316 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 251 treesize of output 109
[2023-12-02 20:05:12,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 107 proven. 33 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked.
[2023-12-02 20:05:12,584 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-12-02 20:05:14,327 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_861 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_861))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 |c_~#double_Array_0~0.base|))) (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (select (select .cse2 |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) is different from false
[2023-12-02 20:05:15,761 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_861 (Array (_ BitVec 32) (_ BitVec 32))) (v_skolemized_v_prenex_5_31 (_ BitVec 64)) (|~#double_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_857 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_106| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_5_31) ((_ extract 62 52) v_skolemized_v_prenex_5_31) ((_ extract 51 0) v_skolemized_v_prenex_5_31)) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))))) (let ((.cse3 (bvadd |~#double_Array_0~0.offset| (_ bv4 32)))) (let ((.cse4 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select |c_#memory_int| |c_~#double_Array_0~0.base|) |~#double_Array_0~0.offset| ((_ extract 31 0) v_skolemized_v_prenex_5_31)) .cse3 ((_ extract 63 32) v_skolemized_v_prenex_5_31))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_857) |c_~#double_Array_0~0.base|) (bvadd |~#double_Array_0~0.offset| (_ bv8 32)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_106|)) (bvadd |~#double_Array_0~0.offset| (_ bv12 32)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_106|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_861))) (fp.eq (let ((.cse1 (let ((.cse2 (select .cse4 |c_~#double_Array_0~0.base|))) (concat (select .cse2 .cse3) (select .cse2 |~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (select (select .cse4 |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))))))) is different from false
[2023-12-02 20:05:19,510 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_861 (Array (_ BitVec 32) (_ BitVec 32))) (v_skolemized_v_prenex_5_31 (_ BitVec 64)) (|~#double_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_857 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_106| (_ BitVec 64)) (v_ArrVal_855 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_855))) (or (let ((.cse2 (bvadd |~#double_Array_0~0.offset| (_ bv4 32)))) (let ((.cse3 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select .cse5 |c_~#double_Array_0~0.base|) |~#double_Array_0~0.offset| ((_ extract 31 0) v_skolemized_v_prenex_5_31)) .cse2 ((_ extract 63 32) v_skolemized_v_prenex_5_31))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_857) |c_~#double_Array_0~0.base|) (bvadd |~#double_Array_0~0.offset| (_ bv8 32)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_106|)) (bvadd |~#double_Array_0~0.offset| (_ bv12 32)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_106|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_861))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 |c_~#double_Array_0~0.base|))) (concat (select .cse1 .cse2) (select .cse1 |~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse4 (select (select .cse3 |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_5_31) ((_ extract 62 52) v_skolemized_v_prenex_5_31) ((_ extract 51 0) v_skolemized_v_prenex_5_31)) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse6 (select (select .cse5 |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))))) is different from false
[2023-12-02 20:05:23,132 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [306398326] provided 0 perfect and 1 imperfect interpolant sequences
[2023-12-02 20:05:23,132 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-12-02 20:05:23,132 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 33
[2023-12-02 20:05:23,132 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973919062]
[2023-12-02 20:05:23,132 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-12-02 20:05:23,133 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2023-12-02 20:05:23,133 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 20:05:23,134 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2023-12-02 20:05:23,135 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1004, Unknown=12, NotChecked=666, Total=1892
[2023-12-02 20:05:23,135 INFO  L87              Difference]: Start difference. First operand 727 states and 891 transitions. Second operand  has 34 states, 31 states have (on average 4.0) internal successors, (124), 30 states have internal predecessors, (124), 7 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 4 states have call predecessors, (29), 7 states have call successors, (29)
[2023-12-02 20:05:38,366 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:05:44,449 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:05:46,198 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:05:48,328 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:05:49,599 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:05:52,052 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:05:54,266 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:05:56,299 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:05:58,352 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:06:01,694 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:06:09,905 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:06:15,642 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:06:18,660 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:06:21,235 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 20:06:22,524 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 20:06:23,475 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 20:06:23,475 INFO  L93              Difference]: Finished difference Result 2025 states and 2482 transitions.
[2023-12-02 20:06:23,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2023-12-02 20:06:23,476 INFO  L78                 Accepts]: Start accepts. Automaton has  has 34 states, 31 states have (on average 4.0) internal successors, (124), 30 states have internal predecessors, (124), 7 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 4 states have call predecessors, (29), 7 states have call successors, (29) Word has length 122
[2023-12-02 20:06:23,477 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 20:06:23,482 INFO  L225             Difference]: With dead ends: 2025
[2023-12-02 20:06:23,482 INFO  L226             Difference]: Without dead ends: 1585
[2023-12-02 20:06:23,484 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=461, Invalid=2112, Unknown=13, NotChecked=954, Total=3540
[2023-12-02 20:06:23,484 INFO  L413           NwaCegarLoop]: 74 mSDtfsCounter, 862 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 118 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 2453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.5s IncrementalHoareTripleChecker+Time
[2023-12-02 20:06:23,485 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1001 Invalid, 2453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2329 Invalid, 6 Unknown, 0 Unchecked, 49.5s Time]
[2023-12-02 20:06:23,486 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1585 states.
[2023-12-02 20:06:23,613 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1012.
[2023-12-02 20:06:23,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1012 states, 807 states have (on average 1.1871127633209417) internal successors, (958), 807 states have internal predecessors, (958), 142 states have call successors, (142), 62 states have call predecessors, (142), 62 states have return successors, (142), 142 states have call predecessors, (142), 142 states have call successors, (142)
[2023-12-02 20:06:23,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1242 transitions.
[2023-12-02 20:06:23,619 INFO  L78                 Accepts]: Start accepts. Automaton has 1012 states and 1242 transitions. Word has length 122
[2023-12-02 20:06:23,619 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 20:06:23,620 INFO  L495      AbstractCegarLoop]: Abstraction has 1012 states and 1242 transitions.
[2023-12-02 20:06:23,620 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 31 states have (on average 4.0) internal successors, (124), 30 states have internal predecessors, (124), 7 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 4 states have call predecessors, (29), 7 states have call successors, (29)
[2023-12-02 20:06:23,620 INFO  L276                IsEmpty]: Start isEmpty. Operand 1012 states and 1242 transitions.
[2023-12-02 20:06:23,622 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2023-12-02 20:06:23,622 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 20:06:23,622 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 20:06:23,630 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0
[2023-12-02 20:06:23,830 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0
[2023-12-02 20:06:24,035 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0
[2023-12-02 20:06:24,223 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-12-02 20:06:24,223 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 20:06:24,224 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 20:06:24,224 INFO  L85        PathProgramCache]: Analyzing trace with hash -587296932, now seen corresponding path program 1 times
[2023-12-02 20:06:24,224 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 20:06:24,224 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363020138]
[2023-12-02 20:06:24,224 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 20:06:24,224 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 20:06:24,224 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 20:06:24,225 INFO  L229       MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 20:06:24,226 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process
[2023-12-02 20:06:24,419 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 20:06:24,427 INFO  L262         TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-12-02 20:06:24,428 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 20:06:24,481 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked.
[2023-12-02 20:06:24,481 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 20:06:24,481 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 20:06:24,481 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363020138]
[2023-12-02 20:06:24,481 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [363020138] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 20:06:24,481 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 20:06:24,481 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-12-02 20:06:24,482 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259134067]
[2023-12-02 20:06:24,482 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 20:06:24,482 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-12-02 20:06:24,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 20:06:24,483 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-12-02 20:06:24,483 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-12-02 20:06:24,483 INFO  L87              Difference]: Start difference. First operand 1012 states and 1242 transitions. Second operand  has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14)
[2023-12-02 20:06:24,850 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 20:06:24,850 INFO  L93              Difference]: Finished difference Result 1491 states and 1822 transitions.
[2023-12-02 20:06:24,850 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-12-02 20:06:24,851 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122
[2023-12-02 20:06:24,851 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 20:06:24,854 INFO  L225             Difference]: With dead ends: 1491
[2023-12-02 20:06:24,854 INFO  L226             Difference]: Without dead ends: 742
[2023-12-02 20:06:24,855 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2023-12-02 20:06:24,856 INFO  L413           NwaCegarLoop]: 112 mSDtfsCounter, 7 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2023-12-02 20:06:24,856 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 516 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2023-12-02 20:06:24,857 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 742 states.
[2023-12-02 20:06:24,939 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 690.
[2023-12-02 20:06:24,940 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 690 states, 551 states have (on average 1.1833030852994555) internal successors, (652), 551 states have internal predecessors, (652), 96 states have call successors, (96), 42 states have call predecessors, (96), 42 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96)
[2023-12-02 20:06:24,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 844 transitions.
[2023-12-02 20:06:24,943 INFO  L78                 Accepts]: Start accepts. Automaton has 690 states and 844 transitions. Word has length 122
[2023-12-02 20:06:24,943 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 20:06:24,943 INFO  L495      AbstractCegarLoop]: Abstraction has 690 states and 844 transitions.
[2023-12-02 20:06:24,943 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14)
[2023-12-02 20:06:24,943 INFO  L276                IsEmpty]: Start isEmpty. Operand 690 states and 844 transitions.
[2023-12-02 20:06:24,945 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2023-12-02 20:06:24,945 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 20:06:24,945 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 20:06:24,952 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0
[2023-12-02 20:06:25,145 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 20:06:25,146 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 20:06:25,146 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 20:06:25,146 INFO  L85        PathProgramCache]: Analyzing trace with hash 1946739277, now seen corresponding path program 1 times
[2023-12-02 20:06:25,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 20:06:25,147 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682475268]
[2023-12-02 20:06:25,147 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 20:06:25,147 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
[2023-12-02 20:06:25,147 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 20:06:25,148 INFO  L229       MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 20:06:25,150 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process
[2023-12-02 20:06:25,636 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 20:06:25,650 INFO  L262         TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 30 conjunts are in the unsatisfiable core
[2023-12-02 20:06:25,654 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 20:06:25,926 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10
[2023-12-02 20:06:26,108 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14
[2023-12-02 20:06:26,263 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14
[2023-12-02 20:06:26,416 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14
[2023-12-02 20:06:26,692 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 20:06:26,692 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 41
[2023-12-02 20:06:26,854 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 20:06:26,854 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 61
[2023-12-02 20:06:26,859 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38
[2023-12-02 20:06:27,036 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 20:06:27,036 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 44
[2023-12-02 20:06:27,281 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 20:06:27,281 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 30
[2023-12-02 20:06:27,452 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked.
[2023-12-02 20:06:27,452 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 20:06:27,452 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 20:06:27,452 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682475268]
[2023-12-02 20:06:27,452 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [682475268] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 20:06:27,452 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 20:06:27,452 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2023-12-02 20:06:27,453 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849221248]
[2023-12-02 20:06:27,453 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 20:06:27,453 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2023-12-02 20:06:27,453 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 20:06:27,454 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2023-12-02 20:06:27,454 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2023-12-02 20:06:27,454 INFO  L87              Difference]: Start difference. First operand 690 states and 844 transitions. Second operand  has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-02 20:06:31,270 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:06:33,814 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:06:38,292 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:06:40,897 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:06:41,589 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 20:06:41,590 INFO  L93              Difference]: Finished difference Result 1293 states and 1609 transitions.
[2023-12-02 20:06:41,595 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2023-12-02 20:06:41,595 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123
[2023-12-02 20:06:41,595 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 20:06:41,599 INFO  L225             Difference]: With dead ends: 1293
[2023-12-02 20:06:41,599 INFO  L226             Difference]: Without dead ends: 883
[2023-12-02 20:06:41,599 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420
[2023-12-02 20:06:41,600 INFO  L413           NwaCegarLoop]: 71 mSDtfsCounter, 324 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time
[2023-12-02 20:06:41,600 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 510 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time]
[2023-12-02 20:06:41,601 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 883 states.
[2023-12-02 20:06:41,682 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 743.
[2023-12-02 20:06:41,683 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 743 states, 604 states have (on average 1.195364238410596) internal successors, (722), 604 states have internal predecessors, (722), 96 states have call successors, (96), 42 states have call predecessors, (96), 42 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96)
[2023-12-02 20:06:41,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 914 transitions.
[2023-12-02 20:06:41,686 INFO  L78                 Accepts]: Start accepts. Automaton has 743 states and 914 transitions. Word has length 123
[2023-12-02 20:06:41,686 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 20:06:41,687 INFO  L495      AbstractCegarLoop]: Abstraction has 743 states and 914 transitions.
[2023-12-02 20:06:41,687 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2023-12-02 20:06:41,687 INFO  L276                IsEmpty]: Start isEmpty. Operand 743 states and 914 transitions.
[2023-12-02 20:06:41,689 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2023-12-02 20:06:41,689 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 20:06:41,689 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 20:06:41,698 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0
[2023-12-02 20:06:41,889 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 20:06:41,890 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 20:06:41,890 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 20:06:41,890 INFO  L85        PathProgramCache]: Analyzing trace with hash 773719346, now seen corresponding path program 1 times
[2023-12-02 20:06:41,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 20:06:41,891 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489190127]
[2023-12-02 20:06:41,891 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 20:06:41,891 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
[2023-12-02 20:06:41,891 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 20:06:41,891 INFO  L229       MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 20:06:41,892 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process
[2023-12-02 20:06:42,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 20:06:42,312 INFO  L262         TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 10 conjunts are in the unsatisfiable core
[2023-12-02 20:06:42,314 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 20:06:42,413 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 20:06:42,414 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 39
[2023-12-02 20:06:42,491 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 20:06:42,491 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 24
[2023-12-02 20:06:42,586 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2023-12-02 20:06:42,586 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 20:06:42,586 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 20:06:42,586 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489190127]
[2023-12-02 20:06:42,587 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489190127] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 20:06:42,587 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 20:06:42,587 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-12-02 20:06:42,587 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720151981]
[2023-12-02 20:06:42,587 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 20:06:42,587 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-12-02 20:06:42,592 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 20:06:42,592 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-12-02 20:06:42,592 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-12-02 20:06:42,592 INFO  L87              Difference]: Start difference. First operand 743 states and 914 transitions. Second operand  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 20:06:49,042 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:06:51,608 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2023-12-02 20:06:52,905 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 20:06:52,905 INFO  L93              Difference]: Finished difference Result 1250 states and 1541 transitions.
[2023-12-02 20:06:52,906 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-12-02 20:06:52,906 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125
[2023-12-02 20:06:52,906 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 20:06:52,909 INFO  L225             Difference]: With dead ends: 1250
[2023-12-02 20:06:52,910 INFO  L226             Difference]: Without dead ends: 787
[2023-12-02 20:06:52,910 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2023-12-02 20:06:52,911 INFO  L413           NwaCegarLoop]: 147 mSDtfsCounter, 69 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time
[2023-12-02 20:06:52,911 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 432 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time]
[2023-12-02 20:06:52,912 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 787 states.
[2023-12-02 20:06:52,984 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 743.
[2023-12-02 20:06:52,985 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 743 states, 604 states have (on average 1.1903973509933774) internal successors, (719), 604 states have internal predecessors, (719), 96 states have call successors, (96), 42 states have call predecessors, (96), 42 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96)
[2023-12-02 20:06:52,986 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 911 transitions.
[2023-12-02 20:06:52,986 INFO  L78                 Accepts]: Start accepts. Automaton has 743 states and 911 transitions. Word has length 125
[2023-12-02 20:06:52,986 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 20:06:52,986 INFO  L495      AbstractCegarLoop]: Abstraction has 743 states and 911 transitions.
[2023-12-02 20:06:52,986 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 20:06:52,987 INFO  L276                IsEmpty]: Start isEmpty. Operand 743 states and 911 transitions.
[2023-12-02 20:06:52,988 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2023-12-02 20:06:52,988 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 20:06:52,988 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 20:06:52,995 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0
[2023-12-02 20:06:53,189 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 20:06:53,189 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 20:06:53,189 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 20:06:53,189 INFO  L85        PathProgramCache]: Analyzing trace with hash -134217815, now seen corresponding path program 1 times
[2023-12-02 20:06:53,190 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 20:06:53,190 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343098622]
[2023-12-02 20:06:53,190 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 20:06:53,190 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
[2023-12-02 20:06:53,190 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 20:06:53,191 INFO  L229       MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 20:06:53,191 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process
[2023-12-02 20:06:53,628 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 20:06:53,641 INFO  L262         TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 10 conjunts are in the unsatisfiable core
[2023-12-02 20:06:53,643 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 20:06:53,694 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 20:06:53,694 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49
[2023-12-02 20:06:53,862 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 20:06:53,863 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 30
[2023-12-02 20:06:53,925 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked.
[2023-12-02 20:06:53,925 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 20:06:53,925 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 20:06:53,925 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343098622]
[2023-12-02 20:06:53,925 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343098622] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 20:06:53,925 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 20:06:53,925 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-12-02 20:06:53,925 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869277738]
[2023-12-02 20:06:53,925 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 20:06:53,926 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-12-02 20:06:53,926 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 20:06:53,926 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-12-02 20:06:53,926 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-12-02 20:06:53,926 INFO  L87              Difference]: Start difference. First operand 743 states and 911 transitions. Second operand  has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 20:06:56,033 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 20:06:58,342 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2023-12-02 20:06:58,924 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-12-02 20:06:58,924 INFO  L93              Difference]: Finished difference Result 1224 states and 1504 transitions.
[2023-12-02 20:06:58,925 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-12-02 20:06:58,925 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 126
[2023-12-02 20:06:58,925 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-12-02 20:06:58,929 INFO  L225             Difference]: With dead ends: 1224
[2023-12-02 20:06:58,929 INFO  L226             Difference]: Without dead ends: 761
[2023-12-02 20:06:58,930 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2023-12-02 20:06:58,930 INFO  L413           NwaCegarLoop]: 118 mSDtfsCounter, 36 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time
[2023-12-02 20:06:58,930 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 380 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time]
[2023-12-02 20:06:58,931 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 761 states.
[2023-12-02 20:06:59,030 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 743.
[2023-12-02 20:06:59,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 743 states, 604 states have (on average 1.1887417218543046) internal successors, (718), 604 states have internal predecessors, (718), 96 states have call successors, (96), 42 states have call predecessors, (96), 42 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96)
[2023-12-02 20:06:59,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 910 transitions.
[2023-12-02 20:06:59,033 INFO  L78                 Accepts]: Start accepts. Automaton has 743 states and 910 transitions. Word has length 126
[2023-12-02 20:06:59,033 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-12-02 20:06:59,033 INFO  L495      AbstractCegarLoop]: Abstraction has 743 states and 910 transitions.
[2023-12-02 20:06:59,033 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)
[2023-12-02 20:06:59,033 INFO  L276                IsEmpty]: Start isEmpty. Operand 743 states and 910 transitions.
[2023-12-02 20:06:59,034 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2023-12-02 20:06:59,034 INFO  L187           NwaCegarLoop]: Found error trace
[2023-12-02 20:06:59,035 INFO  L195           NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-12-02 20:06:59,041 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0
[2023-12-02 20:06:59,235 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-12-02 20:06:59,235 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-12-02 20:06:59,235 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-12-02 20:06:59,236 INFO  L85        PathProgramCache]: Analyzing trace with hash 100286845, now seen corresponding path program 1 times
[2023-12-02 20:06:59,236 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WALRUS
[2023-12-02 20:06:59,236 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637016069]
[2023-12-02 20:06:59,236 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-12-02 20:06:59,236 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
[2023-12-02 20:06:59,236 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat
[2023-12-02 20:06:59,237 INFO  L229       MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)
[2023-12-02 20:06:59,238 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6d44d7e-e071-4930-b23d-c4448ff64ce2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process
[2023-12-02 20:06:59,786 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-12-02 20:06:59,802 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjunts are in the unsatisfiable core
[2023-12-02 20:06:59,806 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-12-02 20:07:00,133 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2023-12-02 20:07:00,746 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54
[2023-12-02 20:07:01,235 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54
[2023-12-02 20:07:01,721 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54
[2023-12-02 20:07:02,182 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54
[2023-12-02 20:07:02,653 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54
[2023-12-02 20:07:03,264 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54
[2023-12-02 20:07:03,374 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 74 treesize of output 54
[2023-12-02 20:07:36,300 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 141
[2023-12-02 20:08:45,812 WARN  L293               SmtUtils]: Spent 14.59s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2023-12-02 20:08:45,895 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-12-02 20:08:45,896 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 274 treesize of output 100
[2023-12-02 20:09:20,918 WARN  L293               SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2023-12-02 20:09:20,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked.
[2023-12-02 20:09:20,921 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-12-02 20:09:20,921 INFO  L136   FreeRefinementEngine]: Strategy WALRUS found an infeasible trace
[2023-12-02 20:09:20,921 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637016069]
[2023-12-02 20:09:20,921 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [637016069] provided 1 perfect and 0 imperfect interpolant sequences
[2023-12-02 20:09:20,921 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-12-02 20:09:20,921 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2023-12-02 20:09:20,921 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583502730]
[2023-12-02 20:09:20,921 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-12-02 20:09:20,922 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2023-12-02 20:09:20,922 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS
[2023-12-02 20:09:20,922 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2023-12-02 20:09:20,922 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=197, Unknown=2, NotChecked=0, Total=240
[2023-12-02 20:09:20,923 INFO  L87              Difference]: Start difference. First operand 743 states and 910 transitions. Second operand  has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)