./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 5e519f3a
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_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267
--- Real Ultimate output ---
[0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset.
This is Ultimate 0.2.2-dev-5e519f3
[2022-11-02 20:54:17,133 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-11-02 20:54:17,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-11-02 20:54:17,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-11-02 20:54:17,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-11-02 20:54:17,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-11-02 20:54:17,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-11-02 20:54:17,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-11-02 20:54:17,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-11-02 20:54:17,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-11-02 20:54:17,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-11-02 20:54:17,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-11-02 20:54:17,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-11-02 20:54:17,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-11-02 20:54:17,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-11-02 20:54:17,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-11-02 20:54:17,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-11-02 20:54:17,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-11-02 20:54:17,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-11-02 20:54:17,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-11-02 20:54:17,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-11-02 20:54:17,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-11-02 20:54:17,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-11-02 20:54:17,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-11-02 20:54:17,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-11-02 20:54:17,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-11-02 20:54:17,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-11-02 20:54:17,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-11-02 20:54:17,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-11-02 20:54:17,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-11-02 20:54:17,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-11-02 20:54:17,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-11-02 20:54:17,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-11-02 20:54:17,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-11-02 20:54:17,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-11-02 20:54:17,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-11-02 20:54:17,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-11-02 20:54:17,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-11-02 20:54:17,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-11-02 20:54:17,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-11-02 20:54:17,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-11-02 20:54:17,273 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf
[2022-11-02 20:54:17,316 INFO L113 SettingsManager]: Loading preferences was successful
[2022-11-02 20:54:17,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-11-02 20:54:17,317 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-11-02 20:54:17,317 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-11-02 20:54:17,318 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-11-02 20:54:17,318 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-11-02 20:54:17,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-11-02 20:54:17,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-11-02 20:54:17,321 INFO L138 SettingsManager]: * Use SBE=true
[2022-11-02 20:54:17,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-11-02 20:54:17,322 INFO L138 SettingsManager]: * sizeof long=4
[2022-11-02 20:54:17,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-11-02 20:54:17,323 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-11-02 20:54:17,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-11-02 20:54:17,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-11-02 20:54:17,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-11-02 20:54:17,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-11-02 20:54:17,324 INFO L138 SettingsManager]: * sizeof long double=12
[2022-11-02 20:54:17,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-11-02 20:54:17,324 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-11-02 20:54:17,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-11-02 20:54:17,325 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-11-02 20:54:17,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-11-02 20:54:17,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-11-02 20:54:17,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:54:17,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-11-02 20:54:17,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-11-02 20:54:17,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-11-02 20:54:17,326 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-11-02 20:54:17,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-11-02 20:54:17,327 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2022-11-02 20:54:17,327 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2022-11-02 20:54:17,327 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-11-02 20:54:17,328 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
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_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/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_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267
[2022-11-02 20:54:17,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-11-02 20:54:17,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-11-02 20:54:17,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-11-02 20:54:17,655 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-11-02 20:54:17,656 INFO L275 PluginConnector]: CDTParser initialized
[2022-11-02 20:54:17,658 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c
[2022-11-02 20:54:17,730 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/data/9a7859a0f/25760ab0b8484c8ba21a0528e61a67ae/FLAG1d461fd83
[2022-11-02 20:54:18,399 INFO L306 CDTParser]: Found 1 translation units.
[2022-11-02 20:54:18,399 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c
[2022-11-02 20:54:18,419 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/data/9a7859a0f/25760ab0b8484c8ba21a0528e61a67ae/FLAG1d461fd83
[2022-11-02 20:54:18,622 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/data/9a7859a0f/25760ab0b8484c8ba21a0528e61a67ae
[2022-11-02 20:54:18,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-11-02 20:54:18,629 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-11-02 20:54:18,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-11-02 20:54:18,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-11-02 20:54:18,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-11-02 20:54:18,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:54:18" (1/1) ...
[2022-11-02 20:54:18,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1a2f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:18, skipping insertion in model container
[2022-11-02 20:54:18,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:54:18" (1/1) ...
[2022-11-02 20:54:18,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-11-02 20:54:18,731 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-11-02 20:54:19,216 WARN L230 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_7ec1e989-13e1-46ec-8836-d206c4860960/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382]
[2022-11-02 20:54:19,224 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:54:19,242 INFO L203 MainTranslator]: Completed pre-run
[2022-11-02 20:54:19,374 WARN L230 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_7ec1e989-13e1-46ec-8836-d206c4860960/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382]
[2022-11-02 20:54:19,377 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:54:19,395 INFO L208 MainTranslator]: Completed translation
[2022-11-02 20:54:19,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:19 WrapperNode
[2022-11-02 20:54:19,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-11-02 20:54:19,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-11-02 20:54:19,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-11-02 20:54:19,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-11-02 20:54:19,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:19" (1/1) ...
[2022-11-02 20:54:19,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:19" (1/1) ...
[2022-11-02 20:54:19,542 INFO L138 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 792
[2022-11-02 20:54:19,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-11-02 20:54:19,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-11-02 20:54:19,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-11-02 20:54:19,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-11-02 20:54:19,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:19" (1/1) ...
[2022-11-02 20:54:19,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:19" (1/1) ...
[2022-11-02 20:54:19,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:19" (1/1) ...
[2022-11-02 20:54:19,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:19" (1/1) ...
[2022-11-02 20:54:19,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:19" (1/1) ...
[2022-11-02 20:54:19,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:19" (1/1) ...
[2022-11-02 20:54:19,686 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:19" (1/1) ...
[2022-11-02 20:54:19,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:19" (1/1) ...
[2022-11-02 20:54:19,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-11-02 20:54:19,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-11-02 20:54:19,695 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-11-02 20:54:19,703 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-11-02 20:54:19,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:19" (1/1) ...
[2022-11-02 20:54:19,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:54:19,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:54:19,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-11-02 20:54:19,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-11-02 20:54:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-11-02 20:54:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2022-11-02 20:54:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-11-02 20:54:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-11-02 20:54:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2022-11-02 20:54:19,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-11-02 20:54:19,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2022-11-02 20:54:19,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-11-02 20:54:19,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-11-02 20:54:19,981 INFO L235 CfgBuilder]: Building ICFG
[2022-11-02 20:54:19,983 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-11-02 20:54:20,001 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2022-11-02 20:54:22,893 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false;
[2022-11-02 20:54:22,893 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false;
[2022-11-02 20:54:22,894 INFO L276 CfgBuilder]: Performing block encoding
[2022-11-02 20:54:22,902 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-11-02 20:54:22,902 INFO L300 CfgBuilder]: Removed 1 assume(true) statements.
[2022-11-02 20:54:22,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:22 BoogieIcfgContainer
[2022-11-02 20:54:22,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-11-02 20:54:22,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-11-02 20:54:22,907 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-11-02 20:54:22,911 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-11-02 20:54:22,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:54:18" (1/3) ...
[2022-11-02 20:54:22,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2834c0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:22, skipping insertion in model container
[2022-11-02 20:54:22,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:19" (2/3) ...
[2022-11-02 20:54:22,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2834c0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:22, skipping insertion in model container
[2022-11-02 20:54:22,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:22" (3/3) ...
[2022-11-02 20:54:22,915 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c
[2022-11-02 20:54:22,934 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-11-02 20:54:22,934 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-11-02 20:54:23,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-02 20:54:23,012 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@104f48df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-02 20:54:23,012 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-11-02 20:54:23,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:23,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2022-11-02 20:54:23,036 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:23,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:23,037 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:23,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:23,043 INFO L85 PathProgramCache]: Analyzing trace with hash -442385417, now seen corresponding path program 1 times
[2022-11-02 20:54:23,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:23,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794746127]
[2022-11-02 20:54:23,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:23,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:54:24,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:24,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794746127]
[2022-11-02 20:54:24,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794746127] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:24,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:24,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626908745]
[2022-11-02 20:54:24,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:24,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:24,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:24,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:24,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:24,168 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:25,435 INFO L93 Difference]: Finished difference Result 421 states and 717 transitions.
[2022-11-02 20:54:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:25,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37
[2022-11-02 20:54:25,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:25,464 INFO L225 Difference]: With dead ends: 421
[2022-11-02 20:54:25,464 INFO L226 Difference]: Without dead ends: 256
[2022-11-02 20:54:25,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:25,475 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 169 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:25,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 439 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-11-02 20:54:25,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states.
[2022-11-02 20:54:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 165.
[2022-11-02 20:54:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5853658536585367) internal successors, (260), 164 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:25,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions.
[2022-11-02 20:54:25,553 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 37
[2022-11-02 20:54:25,554 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:25,554 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions.
[2022-11-02 20:54:25,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions.
[2022-11-02 20:54:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2022-11-02 20:54:25,560 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:25,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:25,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-11-02 20:54:25,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:25,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:25,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1559591931, now seen corresponding path program 1 times
[2022-11-02 20:54:25,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:25,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122168207]
[2022-11-02 20:54:25,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:25,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:54:26,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:26,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122168207]
[2022-11-02 20:54:26,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122168207] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:26,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:26,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:26,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825173911]
[2022-11-02 20:54:26,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:26,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:26,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:26,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:26,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:26,138 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:27,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:27,147 INFO L93 Difference]: Finished difference Result 439 states and 692 transitions.
[2022-11-02 20:54:27,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:27,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38
[2022-11-02 20:54:27,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:27,150 INFO L225 Difference]: With dead ends: 439
[2022-11-02 20:54:27,150 INFO L226 Difference]: Without dead ends: 284
[2022-11-02 20:54:27,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:27,152 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 134 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:27,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 330 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-11-02 20:54:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states.
[2022-11-02 20:54:27,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 194.
[2022-11-02 20:54:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:27,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 312 transitions.
[2022-11-02 20:54:27,165 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 312 transitions. Word has length 38
[2022-11-02 20:54:27,165 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:27,166 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 312 transitions.
[2022-11-02 20:54:27,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 312 transitions.
[2022-11-02 20:54:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2022-11-02 20:54:27,167 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:27,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:27,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-11-02 20:54:27,168 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:27,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:27,169 INFO L85 PathProgramCache]: Analyzing trace with hash 917746377, now seen corresponding path program 1 times
[2022-11-02 20:54:27,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:27,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892287963]
[2022-11-02 20:54:27,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:27,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:54:27,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:27,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892287963]
[2022-11-02 20:54:27,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892287963] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:27,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:27,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:27,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492386847]
[2022-11-02 20:54:27,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:27,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:27,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:27,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:27,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:27,546 INFO L87 Difference]: Start difference. First operand 194 states and 312 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:28,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:28,586 INFO L93 Difference]: Finished difference Result 406 states and 651 transitions.
[2022-11-02 20:54:28,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:28,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44
[2022-11-02 20:54:28,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:28,589 INFO L225 Difference]: With dead ends: 406
[2022-11-02 20:54:28,589 INFO L226 Difference]: Without dead ends: 222
[2022-11-02 20:54:28,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:28,591 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 22 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:28,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 469 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-11-02 20:54:28,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states.
[2022-11-02 20:54:28,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205.
[2022-11-02 20:54:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.6225490196078431) internal successors, (331), 204 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 331 transitions.
[2022-11-02 20:54:28,602 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 331 transitions. Word has length 44
[2022-11-02 20:54:28,602 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:28,602 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 331 transitions.
[2022-11-02 20:54:28,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:28,603 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 331 transitions.
[2022-11-02 20:54:28,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2022-11-02 20:54:28,604 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:28,605 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:28,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-11-02 20:54:28,605 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:28,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:28,606 INFO L85 PathProgramCache]: Analyzing trace with hash 868700126, now seen corresponding path program 1 times
[2022-11-02 20:54:28,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:28,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668419728]
[2022-11-02 20:54:28,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:28,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:29,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:54:29,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:29,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668419728]
[2022-11-02 20:54:29,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668419728] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:29,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:29,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:29,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911690009]
[2022-11-02 20:54:29,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:29,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:29,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:29,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:29,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:29,034 INFO L87 Difference]: Start difference. First operand 205 states and 331 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:29,944 INFO L93 Difference]: Finished difference Result 406 states and 650 transitions.
[2022-11-02 20:54:29,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:29,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57
[2022-11-02 20:54:29,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:29,946 INFO L225 Difference]: With dead ends: 406
[2022-11-02 20:54:29,946 INFO L226 Difference]: Without dead ends: 222
[2022-11-02 20:54:29,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:29,948 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 24 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:29,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 471 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-11-02 20:54:29,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states.
[2022-11-02 20:54:29,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205.
[2022-11-02 20:54:29,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.6176470588235294) internal successors, (330), 204 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 330 transitions.
[2022-11-02 20:54:29,959 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 330 transitions. Word has length 57
[2022-11-02 20:54:29,959 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:29,960 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 330 transitions.
[2022-11-02 20:54:29,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 330 transitions.
[2022-11-02 20:54:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2022-11-02 20:54:29,962 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:29,962 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:29,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-11-02 20:54:29,962 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:29,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:29,963 INFO L85 PathProgramCache]: Analyzing trace with hash 642771885, now seen corresponding path program 1 times
[2022-11-02 20:54:29,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:29,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394425413]
[2022-11-02 20:54:29,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:29,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:54:30,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:30,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394425413]
[2022-11-02 20:54:30,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394425413] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:30,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:30,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:30,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588967654]
[2022-11-02 20:54:30,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:30,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:30,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:30,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:30,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:30,357 INFO L87 Difference]: Start difference. First operand 205 states and 330 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:32,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:54:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:32,728 INFO L93 Difference]: Finished difference Result 405 states and 648 transitions.
[2022-11-02 20:54:32,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:32,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58
[2022-11-02 20:54:32,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:32,730 INFO L225 Difference]: With dead ends: 405
[2022-11-02 20:54:32,730 INFO L226 Difference]: Without dead ends: 221
[2022-11-02 20:54:32,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:32,731 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 28 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:32,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 473 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time]
[2022-11-02 20:54:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states.
[2022-11-02 20:54:32,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 205.
[2022-11-02 20:54:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.6127450980392157) internal successors, (329), 204 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 329 transitions.
[2022-11-02 20:54:32,740 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 329 transitions. Word has length 58
[2022-11-02 20:54:32,741 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:32,741 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 329 transitions.
[2022-11-02 20:54:32,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 329 transitions.
[2022-11-02 20:54:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2022-11-02 20:54:32,743 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:32,743 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:32,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-11-02 20:54:32,744 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:32,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:32,745 INFO L85 PathProgramCache]: Analyzing trace with hash -404738919, now seen corresponding path program 1 times
[2022-11-02 20:54:32,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:32,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864944793]
[2022-11-02 20:54:32,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:32,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:54:33,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:33,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864944793]
[2022-11-02 20:54:33,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864944793] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:33,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:33,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:33,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827174030]
[2022-11-02 20:54:33,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:33,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:33,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:33,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:33,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:33,158 INFO L87 Difference]: Start difference. First operand 205 states and 329 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:34,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:34,342 INFO L93 Difference]: Finished difference Result 479 states and 760 transitions.
[2022-11-02 20:54:34,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:34,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58
[2022-11-02 20:54:34,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:34,344 INFO L225 Difference]: With dead ends: 479
[2022-11-02 20:54:34,344 INFO L226 Difference]: Without dead ends: 295
[2022-11-02 20:54:34,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:34,346 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 150 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:34,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 330 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-11-02 20:54:34,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states.
[2022-11-02 20:54:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 205.
[2022-11-02 20:54:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5980392156862746) internal successors, (326), 204 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:34,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 326 transitions.
[2022-11-02 20:54:34,355 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 326 transitions. Word has length 58
[2022-11-02 20:54:34,355 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:34,355 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 326 transitions.
[2022-11-02 20:54:34,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:34,356 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 326 transitions.
[2022-11-02 20:54:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2022-11-02 20:54:34,357 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:34,357 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:34,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-11-02 20:54:34,358 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:34,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:34,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1540605214, now seen corresponding path program 1 times
[2022-11-02 20:54:34,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:34,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057170285]
[2022-11-02 20:54:34,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:34,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:54:34,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:34,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057170285]
[2022-11-02 20:54:34,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057170285] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:34,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:34,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:34,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689940762]
[2022-11-02 20:54:34,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:34,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:34,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:34,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:34,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:34,754 INFO L87 Difference]: Start difference. First operand 205 states and 326 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:35,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:54:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:36,381 INFO L93 Difference]: Finished difference Result 478 states and 754 transitions.
[2022-11-02 20:54:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:36,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58
[2022-11-02 20:54:36,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:36,384 INFO L225 Difference]: With dead ends: 478
[2022-11-02 20:54:36,384 INFO L226 Difference]: Without dead ends: 294
[2022-11-02 20:54:36,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:36,385 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:36,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-11-02 20:54:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states.
[2022-11-02 20:54:36,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205.
[2022-11-02 20:54:36,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5833333333333333) internal successors, (323), 204 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:36,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 323 transitions.
[2022-11-02 20:54:36,396 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 323 transitions. Word has length 58
[2022-11-02 20:54:36,396 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:36,397 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 323 transitions.
[2022-11-02 20:54:36,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:36,397 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 323 transitions.
[2022-11-02 20:54:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2022-11-02 20:54:36,398 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:36,398 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:36,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-11-02 20:54:36,399 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:36,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:36,400 INFO L85 PathProgramCache]: Analyzing trace with hash -219751902, now seen corresponding path program 1 times
[2022-11-02 20:54:36,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:36,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057247416]
[2022-11-02 20:54:36,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:36,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:54:36,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:36,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057247416]
[2022-11-02 20:54:36,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057247416] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:36,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:36,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:36,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555541375]
[2022-11-02 20:54:36,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:36,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:36,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:36,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:36,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:36,843 INFO L87 Difference]: Start difference. First operand 205 states and 323 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:37,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:54:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:38,462 INFO L93 Difference]: Finished difference Result 478 states and 749 transitions.
[2022-11-02 20:54:38,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:38,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58
[2022-11-02 20:54:38,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:38,464 INFO L225 Difference]: With dead ends: 478
[2022-11-02 20:54:38,464 INFO L226 Difference]: Without dead ends: 294
[2022-11-02 20:54:38,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:38,465 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:38,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2022-11-02 20:54:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states.
[2022-11-02 20:54:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205.
[2022-11-02 20:54:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5686274509803921) internal successors, (320), 204 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 320 transitions.
[2022-11-02 20:54:38,474 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 320 transitions. Word has length 58
[2022-11-02 20:54:38,475 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:38,475 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 320 transitions.
[2022-11-02 20:54:38,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 320 transitions.
[2022-11-02 20:54:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2022-11-02 20:54:38,476 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:38,476 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:38,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-11-02 20:54:38,477 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:38,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:38,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1716593643, now seen corresponding path program 1 times
[2022-11-02 20:54:38,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:38,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616577782]
[2022-11-02 20:54:38,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:38,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:54:38,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:38,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616577782]
[2022-11-02 20:54:38,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616577782] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:38,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:38,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:38,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907405413]
[2022-11-02 20:54:38,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:38,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:38,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:38,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:38,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:38,861 INFO L87 Difference]: Start difference. First operand 205 states and 320 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:40,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:54:41,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:41,405 INFO L93 Difference]: Finished difference Result 478 states and 744 transitions.
[2022-11-02 20:54:41,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:41,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59
[2022-11-02 20:54:41,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:41,407 INFO L225 Difference]: With dead ends: 478
[2022-11-02 20:54:41,407 INFO L226 Difference]: Without dead ends: 294
[2022-11-02 20:54:41,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:41,408 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 146 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:41,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time]
[2022-11-02 20:54:41,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states.
[2022-11-02 20:54:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205.
[2022-11-02 20:54:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.553921568627451) internal successors, (317), 204 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:41,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 317 transitions.
[2022-11-02 20:54:41,421 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 317 transitions. Word has length 59
[2022-11-02 20:54:41,421 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:41,421 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 317 transitions.
[2022-11-02 20:54:41,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 317 transitions.
[2022-11-02 20:54:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2022-11-02 20:54:41,422 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:41,423 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:41,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-11-02 20:54:41,427 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:41,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:41,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1056186316, now seen corresponding path program 1 times
[2022-11-02 20:54:41,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:41,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461718752]
[2022-11-02 20:54:41,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:41,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:54:41,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:41,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461718752]
[2022-11-02 20:54:41,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461718752] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:41,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:41,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:41,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76745190]
[2022-11-02 20:54:41,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:41,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:41,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:41,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:41,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:41,813 INFO L87 Difference]: Start difference. First operand 205 states and 317 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:43,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:54:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:43,673 INFO L93 Difference]: Finished difference Result 402 states and 624 transitions.
[2022-11-02 20:54:43,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:43,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60
[2022-11-02 20:54:43,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:43,676 INFO L225 Difference]: With dead ends: 402
[2022-11-02 20:54:43,676 INFO L226 Difference]: Without dead ends: 218
[2022-11-02 20:54:43,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:43,677 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 20 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:43,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 479 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2022-11-02 20:54:43,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states.
[2022-11-02 20:54:43,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 205.
[2022-11-02 20:54:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5490196078431373) internal successors, (316), 204 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 316 transitions.
[2022-11-02 20:54:43,684 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 316 transitions. Word has length 60
[2022-11-02 20:54:43,684 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:43,684 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 316 transitions.
[2022-11-02 20:54:43,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 316 transitions.
[2022-11-02 20:54:43,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2022-11-02 20:54:43,686 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:43,686 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:43,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-11-02 20:54:43,686 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:43,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:43,687 INFO L85 PathProgramCache]: Analyzing trace with hash 614802448, now seen corresponding path program 1 times
[2022-11-02 20:54:43,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:43,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73805367]
[2022-11-02 20:54:43,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:43,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:54:44,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:44,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73805367]
[2022-11-02 20:54:44,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73805367] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:44,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:44,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:44,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945885238]
[2022-11-02 20:54:44,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:44,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:44,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:44,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:44,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:44,051 INFO L87 Difference]: Start difference. First operand 205 states and 316 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:44,987 INFO L93 Difference]: Finished difference Result 478 states and 738 transitions.
[2022-11-02 20:54:44,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:44,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61
[2022-11-02 20:54:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:44,989 INFO L225 Difference]: With dead ends: 478
[2022-11-02 20:54:44,990 INFO L226 Difference]: Without dead ends: 294
[2022-11-02 20:54:44,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:44,991 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:44,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-11-02 20:54:44,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states.
[2022-11-02 20:54:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205.
[2022-11-02 20:54:44,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5343137254901962) internal successors, (313), 204 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 313 transitions.
[2022-11-02 20:54:45,000 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 313 transitions. Word has length 61
[2022-11-02 20:54:45,000 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:45,000 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 313 transitions.
[2022-11-02 20:54:45,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 313 transitions.
[2022-11-02 20:54:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2022-11-02 20:54:45,002 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:45,002 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:45,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-11-02 20:54:45,002 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:45,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:45,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1287801256, now seen corresponding path program 1 times
[2022-11-02 20:54:45,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:45,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601760284]
[2022-11-02 20:54:45,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:45,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:54:45,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:45,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601760284]
[2022-11-02 20:54:45,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601760284] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:45,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:45,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:45,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52871560]
[2022-11-02 20:54:45,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:45,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:45,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:45,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:45,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:45,339 INFO L87 Difference]: Start difference. First operand 205 states and 313 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:46,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:46,612 INFO L93 Difference]: Finished difference Result 508 states and 780 transitions.
[2022-11-02 20:54:46,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:46,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61
[2022-11-02 20:54:46,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:46,614 INFO L225 Difference]: With dead ends: 508
[2022-11-02 20:54:46,614 INFO L226 Difference]: Without dead ends: 324
[2022-11-02 20:54:46,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:46,615 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 119 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:46,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-11-02 20:54:46,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states.
[2022-11-02 20:54:46,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 245.
[2022-11-02 20:54:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.5532786885245902) internal successors, (379), 244 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 379 transitions.
[2022-11-02 20:54:46,624 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 379 transitions. Word has length 61
[2022-11-02 20:54:46,624 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:46,624 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 379 transitions.
[2022-11-02 20:54:46,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 379 transitions.
[2022-11-02 20:54:46,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2022-11-02 20:54:46,625 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:46,626 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:46,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-11-02 20:54:46,626 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:46,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:46,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1049026987, now seen corresponding path program 1 times
[2022-11-02 20:54:46,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:46,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112385392]
[2022-11-02 20:54:46,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:46,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:54:46,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:46,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112385392]
[2022-11-02 20:54:46,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112385392] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:46,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:46,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:46,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278335575]
[2022-11-02 20:54:46,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:46,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:46,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:46,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:46,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:46,865 INFO L87 Difference]: Start difference. First operand 245 states and 379 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:47,647 INFO L93 Difference]: Finished difference Result 511 states and 793 transitions.
[2022-11-02 20:54:47,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:47,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62
[2022-11-02 20:54:47,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:47,650 INFO L225 Difference]: With dead ends: 511
[2022-11-02 20:54:47,650 INFO L226 Difference]: Without dead ends: 287
[2022-11-02 20:54:47,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:47,651 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 29 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:47,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 493 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-11-02 20:54:47,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states.
[2022-11-02 20:54:47,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 267.
[2022-11-02 20:54:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5488721804511278) internal successors, (412), 266 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:47,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 412 transitions.
[2022-11-02 20:54:47,661 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 412 transitions. Word has length 62
[2022-11-02 20:54:47,661 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:47,661 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 412 transitions.
[2022-11-02 20:54:47,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 412 transitions.
[2022-11-02 20:54:47,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2022-11-02 20:54:47,662 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:47,662 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:47,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-11-02 20:54:47,663 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:47,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:47,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1947485908, now seen corresponding path program 1 times
[2022-11-02 20:54:47,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:47,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463779309]
[2022-11-02 20:54:47,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:47,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:54:48,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:48,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463779309]
[2022-11-02 20:54:48,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463779309] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:48,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:48,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:48,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156239888]
[2022-11-02 20:54:48,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:48,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:48,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:48,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:48,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:48,007 INFO L87 Difference]: Start difference. First operand 267 states and 412 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:49,293 INFO L93 Difference]: Finished difference Result 531 states and 823 transitions.
[2022-11-02 20:54:49,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:49,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75
[2022-11-02 20:54:49,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:49,295 INFO L225 Difference]: With dead ends: 531
[2022-11-02 20:54:49,295 INFO L226 Difference]: Without dead ends: 285
[2022-11-02 20:54:49,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:49,296 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 34 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:49,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 497 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-11-02 20:54:49,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states.
[2022-11-02 20:54:49,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 267.
[2022-11-02 20:54:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5451127819548873) internal successors, (411), 266 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 411 transitions.
[2022-11-02 20:54:49,307 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 411 transitions. Word has length 75
[2022-11-02 20:54:49,307 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:49,307 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 411 transitions.
[2022-11-02 20:54:49,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 411 transitions.
[2022-11-02 20:54:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2022-11-02 20:54:49,309 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:49,309 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:49,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-11-02 20:54:49,309 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:49,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:49,310 INFO L85 PathProgramCache]: Analyzing trace with hash -655331449, now seen corresponding path program 1 times
[2022-11-02 20:54:49,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:49,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30235629]
[2022-11-02 20:54:49,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:49,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:49,660 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:54:49,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:49,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30235629]
[2022-11-02 20:54:49,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30235629] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:49,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:49,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:49,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316691384]
[2022-11-02 20:54:49,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:49,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:49,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:49,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:49,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:49,663 INFO L87 Difference]: Start difference. First operand 267 states and 411 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:51,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:54:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:51,423 INFO L93 Difference]: Finished difference Result 530 states and 820 transitions.
[2022-11-02 20:54:51,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:51,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2022-11-02 20:54:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:51,426 INFO L225 Difference]: With dead ends: 530
[2022-11-02 20:54:51,426 INFO L226 Difference]: Without dead ends: 284
[2022-11-02 20:54:51,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:51,427 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 38 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:51,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 499 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2022-11-02 20:54:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states.
[2022-11-02 20:54:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 267.
[2022-11-02 20:54:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5413533834586466) internal successors, (410), 266 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 410 transitions.
[2022-11-02 20:54:51,436 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 410 transitions. Word has length 76
[2022-11-02 20:54:51,436 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:51,436 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 410 transitions.
[2022-11-02 20:54:51,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 410 transitions.
[2022-11-02 20:54:51,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2022-11-02 20:54:51,438 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:51,438 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:51,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-11-02 20:54:51,438 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:51,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:51,439 INFO L85 PathProgramCache]: Analyzing trace with hash 280248224, now seen corresponding path program 1 times
[2022-11-02 20:54:51,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:51,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584850423]
[2022-11-02 20:54:51,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:51,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:54:51,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:51,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584850423]
[2022-11-02 20:54:51,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584850423] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:51,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:51,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:51,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545789970]
[2022-11-02 20:54:51,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:51,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:51,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:51,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:51,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:51,754 INFO L87 Difference]: Start difference. First operand 267 states and 410 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:53,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:53,080 INFO L93 Difference]: Finished difference Result 602 states and 927 transitions.
[2022-11-02 20:54:53,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:53,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78
[2022-11-02 20:54:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:53,082 INFO L225 Difference]: With dead ends: 602
[2022-11-02 20:54:53,082 INFO L226 Difference]: Without dead ends: 356
[2022-11-02 20:54:53,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:53,083 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 144 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:53,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 334 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-11-02 20:54:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states.
[2022-11-02 20:54:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 267.
[2022-11-02 20:54:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5263157894736843) internal successors, (406), 266 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 406 transitions.
[2022-11-02 20:54:53,093 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 406 transitions. Word has length 78
[2022-11-02 20:54:53,093 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:53,093 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 406 transitions.
[2022-11-02 20:54:53,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:53,094 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 406 transitions.
[2022-11-02 20:54:53,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2022-11-02 20:54:53,095 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:53,095 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:53,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2022-11-02 20:54:53,095 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:53,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:53,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1344832479, now seen corresponding path program 1 times
[2022-11-02 20:54:53,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:53,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900928134]
[2022-11-02 20:54:53,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:53,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2022-11-02 20:54:53,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:53,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900928134]
[2022-11-02 20:54:53,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900928134] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:53,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:53,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:53,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441648094]
[2022-11-02 20:54:53,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:53,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:53,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:53,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:53,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:53,478 INFO L87 Difference]: Start difference. First operand 267 states and 406 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:54,302 INFO L93 Difference]: Finished difference Result 603 states and 918 transitions.
[2022-11-02 20:54:54,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:54,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2022-11-02 20:54:54,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:54,306 INFO L225 Difference]: With dead ends: 603
[2022-11-02 20:54:54,306 INFO L226 Difference]: Without dead ends: 357
[2022-11-02 20:54:54,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:54,307 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 67 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:54,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 469 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-11-02 20:54:54,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states.
[2022-11-02 20:54:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 309.
[2022-11-02 20:54:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.5357142857142858) internal successors, (473), 308 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 473 transitions.
[2022-11-02 20:54:54,317 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 473 transitions. Word has length 84
[2022-11-02 20:54:54,318 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:54,318 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 473 transitions.
[2022-11-02 20:54:54,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 473 transitions.
[2022-11-02 20:54:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2022-11-02 20:54:54,320 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:54,321 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:54,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2022-11-02 20:54:54,321 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:54,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:54,322 INFO L85 PathProgramCache]: Analyzing trace with hash -921185757, now seen corresponding path program 1 times
[2022-11-02 20:54:54,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:54,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558915710]
[2022-11-02 20:54:54,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:54,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2022-11-02 20:54:54,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:54,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558915710]
[2022-11-02 20:54:54,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558915710] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:54,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:54,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:54,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782477791]
[2022-11-02 20:54:54,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:54,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:54,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:54,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:54,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:54,710 INFO L87 Difference]: Start difference. First operand 309 states and 473 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:55,521 INFO L93 Difference]: Finished difference Result 646 states and 991 transitions.
[2022-11-02 20:54:55,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:55,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2022-11-02 20:54:55,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:55,524 INFO L225 Difference]: With dead ends: 646
[2022-11-02 20:54:55,525 INFO L226 Difference]: Without dead ends: 358
[2022-11-02 20:54:55,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:55,526 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 36 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:55,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 591 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-11-02 20:54:55,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states.
[2022-11-02 20:54:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 333.
[2022-11-02 20:54:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.533132530120482) internal successors, (509), 332 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 509 transitions.
[2022-11-02 20:54:55,536 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 509 transitions. Word has length 84
[2022-11-02 20:54:55,537 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:55,537 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 509 transitions.
[2022-11-02 20:54:55,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 509 transitions.
[2022-11-02 20:54:55,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2022-11-02 20:54:55,540 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:55,540 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:55,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2022-11-02 20:54:55,541 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:55,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:55,541 INFO L85 PathProgramCache]: Analyzing trace with hash 742972446, now seen corresponding path program 1 times
[2022-11-02 20:54:55,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:55,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018633550]
[2022-11-02 20:54:55,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:55,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2022-11-02 20:54:55,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:55,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018633550]
[2022-11-02 20:54:55,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018633550] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:55,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:55,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:55,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883228645]
[2022-11-02 20:54:55,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:55,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:55,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:55,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:55,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:55,993 INFO L87 Difference]: Start difference. First operand 333 states and 509 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:57,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:54:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:54:57,525 INFO L93 Difference]: Finished difference Result 771 states and 1187 transitions.
[2022-11-02 20:54:57,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:54:57,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97
[2022-11-02 20:54:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:54:57,528 INFO L225 Difference]: With dead ends: 771
[2022-11-02 20:54:57,529 INFO L226 Difference]: Without dead ends: 459
[2022-11-02 20:54:57,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:54:57,530 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 141 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2022-11-02 20:54:57,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 362 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-11-02 20:54:57,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states.
[2022-11-02 20:54:57,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 349.
[2022-11-02 20:54:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.514367816091954) internal successors, (527), 348 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:57,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 527 transitions.
[2022-11-02 20:54:57,545 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 527 transitions. Word has length 97
[2022-11-02 20:54:57,545 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:54:57,545 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 527 transitions.
[2022-11-02 20:54:57,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:57,546 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 527 transitions.
[2022-11-02 20:54:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2022-11-02 20:54:57,547 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:54:57,548 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:54:57,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2022-11-02 20:54:57,548 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:54:57,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:54:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash 659456893, now seen corresponding path program 1 times
[2022-11-02 20:54:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:54:57,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438731753]
[2022-11-02 20:54:57,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:54:57,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:54:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:54:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2022-11-02 20:54:57,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:54:57,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438731753]
[2022-11-02 20:54:57,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438731753] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:54:57,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:54:58,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:54:58,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763811683]
[2022-11-02 20:54:58,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:54:58,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:54:58,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:54:58,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:54:58,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:54:58,001 INFO L87 Difference]: Start difference. First operand 349 states and 527 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:54:59,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:55:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:00,135 INFO L93 Difference]: Finished difference Result 755 states and 1147 transitions.
[2022-11-02 20:55:00,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:55:00,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98
[2022-11-02 20:55:00,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:00,138 INFO L225 Difference]: With dead ends: 755
[2022-11-02 20:55:00,138 INFO L226 Difference]: Without dead ends: 427
[2022-11-02 20:55:00,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:55:00,139 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 139 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:00,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 356 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2022-11-02 20:55:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states.
[2022-11-02 20:55:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 349.
[2022-11-02 20:55:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4971264367816093) internal successors, (521), 348 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 521 transitions.
[2022-11-02 20:55:00,153 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 521 transitions. Word has length 98
[2022-11-02 20:55:00,153 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:00,153 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 521 transitions.
[2022-11-02 20:55:00,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 521 transitions.
[2022-11-02 20:55:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2022-11-02 20:55:00,155 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:00,155 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:00,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2022-11-02 20:55:00,155 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:00,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:00,156 INFO L85 PathProgramCache]: Analyzing trace with hash 280390343, now seen corresponding path program 1 times
[2022-11-02 20:55:00,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:55:00,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476964923]
[2022-11-02 20:55:00,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:00,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:55:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2022-11-02 20:55:00,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:55:00,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476964923]
[2022-11-02 20:55:00,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476964923] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:00,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:00,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:55:00,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422943089]
[2022-11-02 20:55:00,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:00,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:55:00,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:55:00,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:55:00,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:55:00,616 INFO L87 Difference]: Start difference. First operand 349 states and 521 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:01,547 INFO L93 Difference]: Finished difference Result 712 states and 1064 transitions.
[2022-11-02 20:55:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:55:01,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104
[2022-11-02 20:55:01,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:01,549 INFO L225 Difference]: With dead ends: 712
[2022-11-02 20:55:01,550 INFO L226 Difference]: Without dead ends: 384
[2022-11-02 20:55:01,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:55:01,551 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 71 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:01,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 489 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-11-02 20:55:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states.
[2022-11-02 20:55:01,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 349.
[2022-11-02 20:55:01,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4942528735632183) internal successors, (520), 348 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 520 transitions.
[2022-11-02 20:55:01,563 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 520 transitions. Word has length 104
[2022-11-02 20:55:01,563 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:01,563 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 520 transitions.
[2022-11-02 20:55:01,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 520 transitions.
[2022-11-02 20:55:01,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2022-11-02 20:55:01,565 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:01,565 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:01,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2022-11-02 20:55:01,566 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:01,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash 509759261, now seen corresponding path program 1 times
[2022-11-02 20:55:01,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:55:01,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934125518]
[2022-11-02 20:55:01,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:01,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:55:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2022-11-02 20:55:01,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:55:01,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934125518]
[2022-11-02 20:55:01,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934125518] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:01,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:01,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:55:01,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196126500]
[2022-11-02 20:55:01,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:01,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:55:01,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:55:01,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:55:01,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:55:01,959 INFO L87 Difference]: Start difference. First operand 349 states and 520 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:02,802 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions.
[2022-11-02 20:55:02,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:55:02,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105
[2022-11-02 20:55:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:02,804 INFO L225 Difference]: With dead ends: 710
[2022-11-02 20:55:02,804 INFO L226 Difference]: Without dead ends: 382
[2022-11-02 20:55:02,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:55:02,805 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 68 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:02,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 495 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-11-02 20:55:02,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states.
[2022-11-02 20:55:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 349.
[2022-11-02 20:55:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4913793103448276) internal successors, (519), 348 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 519 transitions.
[2022-11-02 20:55:02,818 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 519 transitions. Word has length 105
[2022-11-02 20:55:02,818 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:02,818 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 519 transitions.
[2022-11-02 20:55:02,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 519 transitions.
[2022-11-02 20:55:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2022-11-02 20:55:02,820 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:02,820 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:02,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2022-11-02 20:55:02,821 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:02,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:02,821 INFO L85 PathProgramCache]: Analyzing trace with hash -213108826, now seen corresponding path program 1 times
[2022-11-02 20:55:02,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:55:02,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469983119]
[2022-11-02 20:55:02,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:02,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:55:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2022-11-02 20:55:03,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:55:03,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469983119]
[2022-11-02 20:55:03,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469983119] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:03,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:03,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:55:03,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730371388]
[2022-11-02 20:55:03,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:03,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:55:03,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:55:03,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:55:03,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:55:03,200 INFO L87 Difference]: Start difference. First operand 349 states and 519 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:04,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:04,046 INFO L93 Difference]: Finished difference Result 707 states and 1053 transitions.
[2022-11-02 20:55:04,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:55:04,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105
[2022-11-02 20:55:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:04,049 INFO L225 Difference]: With dead ends: 707
[2022-11-02 20:55:04,049 INFO L226 Difference]: Without dead ends: 379
[2022-11-02 20:55:04,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:55:04,051 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 61 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:04,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 501 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-11-02 20:55:04,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states.
[2022-11-02 20:55:04,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 349.
[2022-11-02 20:55:04,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4885057471264367) internal successors, (518), 348 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 518 transitions.
[2022-11-02 20:55:04,062 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 518 transitions. Word has length 105
[2022-11-02 20:55:04,063 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:04,063 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 518 transitions.
[2022-11-02 20:55:04,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 518 transitions.
[2022-11-02 20:55:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2022-11-02 20:55:04,065 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:04,065 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:04,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2022-11-02 20:55:04,065 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:04,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:04,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1295545029, now seen corresponding path program 1 times
[2022-11-02 20:55:04,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:55:04,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277417598]
[2022-11-02 20:55:04,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:04,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:55:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:04,462 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2022-11-02 20:55:04,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:55:04,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277417598]
[2022-11-02 20:55:04,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277417598] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:04,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:04,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:55:04,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64398603]
[2022-11-02 20:55:04,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:04,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:55:04,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:55:04,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:55:04,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:55:04,465 INFO L87 Difference]: Start difference. First operand 349 states and 518 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:06,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:55:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:06,963 INFO L93 Difference]: Finished difference Result 755 states and 1129 transitions.
[2022-11-02 20:55:06,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:55:06,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106
[2022-11-02 20:55:06,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:06,966 INFO L225 Difference]: With dead ends: 755
[2022-11-02 20:55:06,966 INFO L226 Difference]: Without dead ends: 427
[2022-11-02 20:55:06,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:55:06,967 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 125 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:06,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 368 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 245 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time]
[2022-11-02 20:55:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states.
[2022-11-02 20:55:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 349.
[2022-11-02 20:55:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4770114942528736) internal successors, (514), 348 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 514 transitions.
[2022-11-02 20:55:06,979 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 514 transitions. Word has length 106
[2022-11-02 20:55:06,979 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:06,979 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 514 transitions.
[2022-11-02 20:55:06,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 514 transitions.
[2022-11-02 20:55:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2022-11-02 20:55:06,981 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:06,981 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:06,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2022-11-02 20:55:06,982 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:06,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:06,982 INFO L85 PathProgramCache]: Analyzing trace with hash 878148423, now seen corresponding path program 1 times
[2022-11-02 20:55:06,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:55:06,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789544782]
[2022-11-02 20:55:06,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:06,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:55:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2022-11-02 20:55:07,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:55:07,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789544782]
[2022-11-02 20:55:07,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789544782] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:07,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:07,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:55:07,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447245541]
[2022-11-02 20:55:07,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:07,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:55:07,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:55:07,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:55:07,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:07,167 INFO L87 Difference]: Start difference. First operand 349 states and 514 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:07,226 INFO L93 Difference]: Finished difference Result 1000 states and 1488 transitions.
[2022-11-02 20:55:07,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:55:07,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106
[2022-11-02 20:55:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:07,229 INFO L225 Difference]: With dead ends: 1000
[2022-11-02 20:55:07,229 INFO L226 Difference]: Without dead ends: 672
[2022-11-02 20:55:07,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:07,231 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 136 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:07,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 428 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-11-02 20:55:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states.
[2022-11-02 20:55:07,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672.
[2022-11-02 20:55:07,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 1.473919523099851) internal successors, (989), 671 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 989 transitions.
[2022-11-02 20:55:07,252 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 989 transitions. Word has length 106
[2022-11-02 20:55:07,252 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:07,252 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 989 transitions.
[2022-11-02 20:55:07,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 989 transitions.
[2022-11-02 20:55:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2022-11-02 20:55:07,254 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:07,254 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:07,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2022-11-02 20:55:07,255 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:07,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:07,255 INFO L85 PathProgramCache]: Analyzing trace with hash -808031415, now seen corresponding path program 1 times
[2022-11-02 20:55:07,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:55:07,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272776970]
[2022-11-02 20:55:07,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:07,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:55:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:07,379 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2022-11-02 20:55:07,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:55:07,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272776970]
[2022-11-02 20:55:07,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272776970] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:07,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:07,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:55:07,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172342808]
[2022-11-02 20:55:07,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:07,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:55:07,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:55:07,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:55:07,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:07,382 INFO L87 Difference]: Start difference. First operand 672 states and 989 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:07,427 INFO L93 Difference]: Finished difference Result 1350 states and 1990 transitions.
[2022-11-02 20:55:07,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:55:07,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106
[2022-11-02 20:55:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:07,431 INFO L225 Difference]: With dead ends: 1350
[2022-11-02 20:55:07,432 INFO L226 Difference]: Without dead ends: 699
[2022-11-02 20:55:07,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:07,435 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 15 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:07,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 410 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-11-02 20:55:07,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states.
[2022-11-02 20:55:07,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699.
[2022-11-02 20:55:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.4670487106017192) internal successors, (1024), 698 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1024 transitions.
[2022-11-02 20:55:07,460 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1024 transitions. Word has length 106
[2022-11-02 20:55:07,460 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:07,461 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 1024 transitions.
[2022-11-02 20:55:07,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1024 transitions.
[2022-11-02 20:55:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2022-11-02 20:55:07,463 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:07,463 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:07,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2022-11-02 20:55:07,463 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:07,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:07,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1068451403, now seen corresponding path program 1 times
[2022-11-02 20:55:07,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:55:07,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099091046]
[2022-11-02 20:55:07,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:07,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:55:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked.
[2022-11-02 20:55:07,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:55:07,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099091046]
[2022-11-02 20:55:07,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099091046] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:07,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:07,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:55:07,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096965580]
[2022-11-02 20:55:07,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:07,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:55:07,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:55:07,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:55:07,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:07,590 INFO L87 Difference]: Start difference. First operand 699 states and 1024 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:07,624 INFO L93 Difference]: Finished difference Result 1379 states and 2026 transitions.
[2022-11-02 20:55:07,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:55:07,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106
[2022-11-02 20:55:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:07,628 INFO L225 Difference]: With dead ends: 1379
[2022-11-02 20:55:07,628 INFO L226 Difference]: Without dead ends: 701
[2022-11-02 20:55:07,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:07,630 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:07,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 389 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-11-02 20:55:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states.
[2022-11-02 20:55:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701.
[2022-11-02 20:55:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 1.4657142857142857) internal successors, (1026), 700 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1026 transitions.
[2022-11-02 20:55:07,652 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1026 transitions. Word has length 106
[2022-11-02 20:55:07,653 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:07,653 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 1026 transitions.
[2022-11-02 20:55:07,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1026 transitions.
[2022-11-02 20:55:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2022-11-02 20:55:07,655 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:07,655 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:07,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2022-11-02 20:55:07,655 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:07,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:07,656 INFO L85 PathProgramCache]: Analyzing trace with hash -414944271, now seen corresponding path program 1 times
[2022-11-02 20:55:07,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:55:07,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128247401]
[2022-11-02 20:55:07,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:07,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:55:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked.
[2022-11-02 20:55:07,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:55:07,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128247401]
[2022-11-02 20:55:07,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128247401] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:07,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:07,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:55:07,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376431390]
[2022-11-02 20:55:07,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:07,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:55:07,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:55:07,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:55:07,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:07,853 INFO L87 Difference]: Start difference. First operand 701 states and 1026 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:07,921 INFO L93 Difference]: Finished difference Result 1707 states and 2514 transitions.
[2022-11-02 20:55:07,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:55:07,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108
[2022-11-02 20:55:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:07,928 INFO L225 Difference]: With dead ends: 1707
[2022-11-02 20:55:07,928 INFO L226 Difference]: Without dead ends: 1029
[2022-11-02 20:55:07,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:07,930 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 148 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:07,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 569 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-11-02 20:55:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states.
[2022-11-02 20:55:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1027.
[2022-11-02 20:55:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 1.4688109161793372) internal successors, (1507), 1026 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1507 transitions.
[2022-11-02 20:55:07,963 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1507 transitions. Word has length 108
[2022-11-02 20:55:07,964 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:07,964 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1507 transitions.
[2022-11-02 20:55:07,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1507 transitions.
[2022-11-02 20:55:07,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2022-11-02 20:55:07,967 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:07,967 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:07,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2022-11-02 20:55:07,967 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:07,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:07,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2063160218, now seen corresponding path program 1 times
[2022-11-02 20:55:07,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:55:07,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236937257]
[2022-11-02 20:55:07,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:07,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:55:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked.
[2022-11-02 20:55:08,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:55:08,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236937257]
[2022-11-02 20:55:08,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236937257] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:08,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:08,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:55:08,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970143140]
[2022-11-02 20:55:08,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:08,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:55:08,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:55:08,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:55:08,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:08,133 INFO L87 Difference]: Start difference. First operand 1027 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:08,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:08,208 INFO L93 Difference]: Finished difference Result 2353 states and 3470 transitions.
[2022-11-02 20:55:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:55:08,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125
[2022-11-02 20:55:08,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:08,213 INFO L225 Difference]: With dead ends: 2353
[2022-11-02 20:55:08,214 INFO L226 Difference]: Without dead ends: 1349
[2022-11-02 20:55:08,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:08,224 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 141 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:08,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 567 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-11-02 20:55:08,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states.
[2022-11-02 20:55:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349.
[2022-11-02 20:55:08,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.4688427299703264) internal successors, (1980), 1348 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1980 transitions.
[2022-11-02 20:55:08,265 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1980 transitions. Word has length 125
[2022-11-02 20:55:08,266 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:08,266 INFO L495 AbstractCegarLoop]: Abstraction has 1349 states and 1980 transitions.
[2022-11-02 20:55:08,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1980 transitions.
[2022-11-02 20:55:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2022-11-02 20:55:08,269 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:08,269 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:08,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2022-11-02 20:55:08,269 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:08,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:08,270 INFO L85 PathProgramCache]: Analyzing trace with hash 726227607, now seen corresponding path program 1 times
[2022-11-02 20:55:08,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:55:08,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192464283]
[2022-11-02 20:55:08,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:08,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:55:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2022-11-02 20:55:08,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:55:08,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192464283]
[2022-11-02 20:55:08,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192464283] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:08,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:08,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:55:08,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233668697]
[2022-11-02 20:55:08,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:08,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:55:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:55:08,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:55:08,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:08,462 INFO L87 Difference]: Start difference. First operand 1349 states and 1980 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:08,549 INFO L93 Difference]: Finished difference Result 2005 states and 2944 transitions.
[2022-11-02 20:55:08,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:55:08,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128
[2022-11-02 20:55:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:08,555 INFO L225 Difference]: With dead ends: 2005
[2022-11-02 20:55:08,555 INFO L226 Difference]: Without dead ends: 1677
[2022-11-02 20:55:08,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:08,557 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 157 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:08,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 373 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-11-02 20:55:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states.
[2022-11-02 20:55:08,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1675.
[2022-11-02 20:55:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1674 states have (on average 1.467741935483871) internal successors, (2457), 1674 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2457 transitions.
[2022-11-02 20:55:08,608 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2457 transitions. Word has length 128
[2022-11-02 20:55:08,609 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:08,609 INFO L495 AbstractCegarLoop]: Abstraction has 1675 states and 2457 transitions.
[2022-11-02 20:55:08,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2457 transitions.
[2022-11-02 20:55:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2022-11-02 20:55:08,612 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:08,612 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:08,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2022-11-02 20:55:08,613 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:08,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:08,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1329906676, now seen corresponding path program 1 times
[2022-11-02 20:55:08,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:55:08,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611845532]
[2022-11-02 20:55:08,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:08,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:55:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked.
[2022-11-02 20:55:10,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:55:10,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611845532]
[2022-11-02 20:55:10,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611845532] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:10,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:10,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-11-02 20:55:10,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999236757]
[2022-11-02 20:55:10,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:10,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-11-02 20:55:10,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:55:10,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-11-02 20:55:10,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:55:10,758 INFO L87 Difference]: Start difference. First operand 1675 states and 2457 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:11,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:55:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:12,803 INFO L93 Difference]: Finished difference Result 3347 states and 4910 transitions.
[2022-11-02 20:55:12,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-11-02 20:55:12,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129
[2022-11-02 20:55:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:12,810 INFO L225 Difference]: With dead ends: 3347
[2022-11-02 20:55:12,810 INFO L226 Difference]: Without dead ends: 1675
[2022-11-02 20:55:12,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2022-11-02 20:55:12,813 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:12,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2022-11-02 20:55:12,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states.
[2022-11-02 20:55:12,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1675.
[2022-11-02 20:55:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1674 states have (on average 1.4671445639187575) internal successors, (2456), 1674 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2456 transitions.
[2022-11-02 20:55:12,865 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2456 transitions. Word has length 129
[2022-11-02 20:55:12,865 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:12,865 INFO L495 AbstractCegarLoop]: Abstraction has 1675 states and 2456 transitions.
[2022-11-02 20:55:12,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2456 transitions.
[2022-11-02 20:55:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2022-11-02 20:55:12,868 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:12,869 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:12,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2022-11-02 20:55:12,869 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:12,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:12,870 INFO L85 PathProgramCache]: Analyzing trace with hash 895401078, now seen corresponding path program 1 times
[2022-11-02 20:55:12,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:55:12,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348325287]
[2022-11-02 20:55:12,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:12,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:55:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 20:55:13,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-02 20:55:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 20:55:14,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-11-02 20:55:14,121 INFO L359 BasicCegarLoop]: Counterexample is feasible
[2022-11-02 20:55:14,122 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-11-02 20:55:14,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2022-11-02 20:55:14,127 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:14,132 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-11-02 20:55:14,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:55:14 BoogieIcfgContainer
[2022-11-02 20:55:14,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-11-02 20:55:14,325 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2022-11-02 20:55:14,325 INFO L271 PluginConnector]: Initializing Witness Printer...
[2022-11-02 20:55:14,325 INFO L275 PluginConnector]: Witness Printer initialized
[2022-11-02 20:55:14,325 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:22" (3/4) ...
[2022-11-02 20:55:14,328 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2022-11-02 20:55:14,328 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2022-11-02 20:55:14,329 INFO L158 Benchmark]: Toolchain (without parser) took 55699.79ms. Allocated memory was 138.4MB in the beginning and 453.0MB in the end (delta: 314.6MB). Free memory was 101.8MB in the beginning and 352.4MB in the end (delta: -250.6MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB.
[2022-11-02 20:55:14,329 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 96.5MB. Free memory was 69.9MB in the beginning and 69.9MB in the end (delta: 31.3kB). There was no memory consumed. Max. memory is 16.1GB.
[2022-11-02 20:55:14,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 765.95ms. Allocated memory is still 138.4MB. Free memory was 101.5MB in the beginning and 92.3MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2022-11-02 20:55:14,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 152.23ms. Allocated memory is still 138.4MB. Free memory was 92.3MB in the beginning and 87.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2022-11-02 20:55:14,332 INFO L158 Benchmark]: Boogie Preprocessor took 141.33ms. Allocated memory is still 138.4MB. Free memory was 87.6MB in the beginning and 79.9MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2022-11-02 20:55:14,338 INFO L158 Benchmark]: RCFGBuilder took 3210.31ms. Allocated memory is still 138.4MB. Free memory was 79.9MB in the beginning and 101.6MB in the end (delta: -21.7MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB.
[2022-11-02 20:55:14,341 INFO L158 Benchmark]: TraceAbstraction took 51416.68ms. Allocated memory was 138.4MB in the beginning and 453.0MB in the end (delta: 314.6MB). Free memory was 101.3MB in the beginning and 352.4MB in the end (delta: -251.0MB). Peak memory consumption was 269.9MB. Max. memory is 16.1GB.
[2022-11-02 20:55:14,341 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 453.0MB. Free memory is still 352.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2022-11-02 20:55:14,342 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.31ms. Allocated memory is still 96.5MB. Free memory was 69.9MB in the beginning and 69.9MB in the end (delta: 31.3kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 765.95ms. Allocated memory is still 138.4MB. Free memory was 101.5MB in the beginning and 92.3MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 152.23ms. Allocated memory is still 138.4MB. Free memory was 92.3MB in the beginning and 87.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 141.33ms. Allocated memory is still 138.4MB. Free memory was 87.6MB in the beginning and 79.9MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 3210.31ms. Allocated memory is still 138.4MB. Free memory was 79.9MB in the beginning and 101.6MB in the end (delta: -21.7MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB.
* TraceAbstraction took 51416.68ms. Allocated memory was 138.4MB in the beginning and 453.0MB in the end (delta: 314.6MB). Free memory was 101.3MB in the beginning and 352.4MB in the end (delta: -251.0MB). Peak memory consumption was 269.9MB. Max. memory is 16.1GB.
* Witness Printer took 3.98ms. Allocated memory is still 453.0MB. Free memory is still 352.4MB. There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 1757]: Unable to prove that call to reach_error is unreachable
Unable to prove that call to reach_error is unreachable
Reason: overapproximation of bitwiseAnd at line 1475.
Possible FailurePath:
[L1054] static int init = 1;
[L1055] static SSL_METHOD SSLv3_server_data ;
VAL [init=1, SSLv3_server_data={4:0}]
[L1077] SSL *s ;
[L1078] int tmp ;
[L1082] s = malloc(sizeof(SSL))
[L1083] s->s3 = malloc(sizeof(struct ssl3_state_st))
[L1084] s->ctx = malloc(sizeof(SSL_CTX))
[L1085] s->session = malloc(sizeof(SSL_SESSION))
[L1087] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong()
[L1088] s->options = __VERIFIER_nondet_ulong()
[L1089] s->verify_mode = __VERIFIER_nondet_int()
[L1090] EXPR s->session
[L1090] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong()
[L1091] EXPR s->s3
[L1091] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int()
[L1092] EXPR s->s3
[L1092] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st))
[L1093] EXPR s->s3
[L1093] EXPR (s->s3)->tmp.new_cipher
[L1093] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong()
[L1094] EXPR s->s3
[L1094] EXPR (s->s3)->tmp.new_cipher
[L1094] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong()
[L1095] COND FALSE !(__VERIFIER_nondet_int())
[L1101] s->cert = malloc(sizeof(struct cert_st))
[L1102] EXPR s->cert
[L1102] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong()
[L1105] CALL ssl3_accept(s)
[L1111] BUF_MEM *buf ;
[L1112] unsigned long l ;
[L1113] unsigned long Time ;
[L1114] unsigned long tmp ;
[L1115] void (*cb)() ;
[L1116] long num1 ;
[L1117] int ret ;
[L1118] int new_state ;
[L1119] int state ;
[L1120] int skip ;
[L1121] int got_new_session ;
[L1122] int tmp___1 = __VERIFIER_nondet_int() ;
[L1123] int tmp___2 = __VERIFIER_nondet_int() ;
[L1124] int tmp___3 = __VERIFIER_nondet_int() ;
[L1125] int tmp___4 = __VERIFIER_nondet_int() ;
[L1126] int tmp___5 = __VERIFIER_nondet_int() ;
[L1127] int tmp___6 = __VERIFIER_nondet_int() ;
[L1128] int tmp___7 ;
[L1129] long tmp___8 = __VERIFIER_nondet_long() ;
[L1130] int tmp___9 = __VERIFIER_nondet_int() ;
[L1131] int tmp___10 = __VERIFIER_nondet_int() ;
[L1132] int blastFlag ;
[L1136] s->state = 8464
[L1137] blastFlag = 0
[L1138] s->hit=__VERIFIER_nondet_int ()
[L1139] s->state = 8464
[L1140] tmp = __VERIFIER_nondet_int()
[L1141] Time = tmp
[L1142] cb = (void (*)())((void *)0)
[L1143] ret = -1
[L1144] skip = 0
[L1145] got_new_session = 0
[L1146] EXPR s->info_callback
VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->info_callback={0:-10}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0)
[L1147] EXPR s->info_callback
[L1147] cb = s->info_callback
[L1151] EXPR s->in_handshake
[L1151] s->in_handshake += 1
[L1152] COND FALSE !(tmp___1 & 12288)
VAL [={0:-10}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1161] EXPR s->cert
VAL [={0:-10}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0))
[L1167] COND TRUE 1
VAL [={0:-10}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1169] EXPR s->state
[L1169] state = s->state
[L1170] EXPR s->state
VAL [={0:-10}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1170] COND FALSE !(s->state == 12292)
[L1173] EXPR s->state
VAL [={0:-10}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1173] COND FALSE !(s->state == 16384)
[L1176] EXPR s->state
VAL [={0:-10}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1176] COND FALSE !(s->state == 8192)
[L1179] EXPR s->state
VAL [={0:-10}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1179] COND FALSE !(s->state == 24576)
[L1182] EXPR s->state
VAL [={0:-10}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1182] COND FALSE !(s->state == 8195)
[L1185] EXPR s->state
VAL [={0:-10}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1185] COND FALSE !(s->state == 8480)
[L1188] EXPR s->state
VAL [={0:-10}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1188] COND FALSE !(s->state == 8481)
[L1191] EXPR s->state
VAL [={0:-10}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1191] COND FALSE !(s->state == 8482)
[L1194] EXPR s->state
VAL [={0:-10}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1194] COND TRUE s->state == 8464
[L1354] s->shutdown = 0
[L1355] ret = __VERIFIER_nondet_int()
[L1356] COND TRUE blastFlag == 0
[L1357] blastFlag = 1
VAL [={0:-10}, blastFlag=1, got_new_session=0, init=1, ret=8, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1361] COND FALSE !(ret <= 0)
[L1366] got_new_session = 1
[L1367] s->state = 8496
[L1368] s->init_num = 0
VAL [={0:-10}, blastFlag=1, got_new_session=1, init=1, ret=8, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1716] EXPR s->s3
[L1716] EXPR (s->s3)->tmp.reuse_message
VAL [={0:-10}, (s->s3)->tmp.reuse_message=4294967335, blastFlag=1, got_new_session=1, init=1, ret=8, s={-6:0}, s={-6:0}, s->s3={-13:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1716] COND FALSE !(! (s->s3)->tmp.reuse_message)
[L1745] skip = 0
VAL [={0:-10}, blastFlag=1, got_new_session=1, init=1, ret=8, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1167] COND TRUE 1
VAL [={0:-10}, blastFlag=1, got_new_session=1, init=1, ret=8, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1169] EXPR s->state
[L1169] state = s->state
[L1170] EXPR s->state
VAL [={0:-10}, blastFlag=1, got_new_session=1, init=1, ret=8, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1170] COND FALSE !(s->state == 12292)
[L1173] EXPR s->state
VAL [={0:-10}, blastFlag=1, got_new_session=1, init=1, ret=8, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1173] COND FALSE !(s->state == 16384)
[L1176] EXPR s->state
VAL [={0:-10}, blastFlag=1, got_new_session=1, init=1, ret=8, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1176] COND FALSE !(s->state == 8192)
[L1179] EXPR s->state
VAL [={0:-10}, blastFlag=1, got_new_session=1, init=1, ret=8, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1179] COND FALSE !(s->state == 24576)
[L1182] EXPR s->state
VAL [={0:-10}, blastFlag=1, got_new_session=1, init=1, ret=8, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1182] COND FALSE !(s->state == 8195)
[L1185] EXPR s->state
VAL [={0:-10}, blastFlag=1, got_new_session=1, init=1, ret=8, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1185] COND FALSE !(s->state == 8480)
[L1188] EXPR s->state
VAL [={0:-10}, blastFlag=1, got_new_session=1, init=1, ret=8, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1188] COND FALSE !(s->state == 8481)
[L1191] EXPR s->state
VAL [={0:-10}, blastFlag=1, got_new_session=1, init=1, ret=8, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1191] COND FALSE !(s->state == 8482)
[L1194] EXPR s->state
VAL [={0:-10}, blastFlag=1, got_new_session=1, init=1, ret=8, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1194] COND FALSE !(s->state == 8464)
[L1197] EXPR s->state
VAL [={0:-10}, blastFlag=1, got_new_session=1, init=1, ret=8, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1197] COND FALSE !(s->state == 8465)
[L1200] EXPR s->state
VAL [={0:-10}, blastFlag=1, got_new_session=1, init=1, ret=8, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1200] COND FALSE !(s->state == 8466)
[L1203] EXPR s->state
VAL [={0:-10}, blastFlag=1, got_new_session=1, init=1, ret=8, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1203] COND TRUE s->state == 8496
[L1372] ret = __VERIFIER_nondet_int()
[L1373] COND TRUE blastFlag == 1
[L1374] blastFlag = 2
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1378] COND FALSE !(ret <= 0)
[L1383] s->hit
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->hit=0, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1383] COND FALSE !(s->hit)
[L1386] s->state = 8512
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1388] s->init_num = 0
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1716] EXPR s->s3
[L1716] EXPR (s->s3)->tmp.reuse_message
VAL [={0:-10}, (s->s3)->tmp.reuse_message=4294967335, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->s3={-13:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1716] COND FALSE !(! (s->s3)->tmp.reuse_message)
[L1745] skip = 0
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1167] COND TRUE 1
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1169] EXPR s->state
[L1169] state = s->state
[L1170] EXPR s->state
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1170] COND FALSE !(s->state == 12292)
[L1173] EXPR s->state
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1173] COND FALSE !(s->state == 16384)
[L1176] EXPR s->state
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1176] COND FALSE !(s->state == 8192)
[L1179] EXPR s->state
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1179] COND FALSE !(s->state == 24576)
[L1182] EXPR s->state
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1182] COND FALSE !(s->state == 8195)
[L1185] EXPR s->state
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1185] COND FALSE !(s->state == 8480)
[L1188] EXPR s->state
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1188] COND FALSE !(s->state == 8481)
[L1191] EXPR s->state
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1191] COND FALSE !(s->state == 8482)
[L1194] EXPR s->state
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1194] COND FALSE !(s->state == 8464)
[L1197] EXPR s->state
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1197] COND FALSE !(s->state == 8465)
[L1200] EXPR s->state
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1200] COND FALSE !(s->state == 8466)
[L1203] EXPR s->state
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1203] COND FALSE !(s->state == 8496)
[L1206] EXPR s->state
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1206] COND FALSE !(s->state == 8497)
[L1209] EXPR s->state
VAL [={0:-10}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1209] COND TRUE s->state == 8512
[L1392] EXPR s->s3
[L1392] EXPR (s->s3)->tmp.new_cipher
[L1392] EXPR ((s->s3)->tmp.new_cipher)->algorithms
VAL [={0:-10}, ((s->s3)->tmp.new_cipher)->algorithms=4294967319, (s->s3)->tmp.new_cipher={-8:0}, blastFlag=2, got_new_session=1, init=1, ret=9, s={-6:0}, s={-6:0}, s->s3={-13:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1392] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL)
[L1395] ret = __VERIFIER_nondet_int()
[L1396] COND TRUE blastFlag == 2
[L1397] blastFlag = 6
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1401] COND FALSE !(ret <= 0)
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1407] s->state = 8528
[L1408] s->init_num = 0
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1716] EXPR s->s3
[L1716] EXPR (s->s3)->tmp.reuse_message
VAL [={0:-10}, (s->s3)->tmp.reuse_message=4294967335, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->s3={-13:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1716] COND FALSE !(! (s->s3)->tmp.reuse_message)
[L1745] skip = 0
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1167] COND TRUE 1
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1169] EXPR s->state
[L1169] state = s->state
[L1170] EXPR s->state
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1170] COND FALSE !(s->state == 12292)
[L1173] EXPR s->state
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1173] COND FALSE !(s->state == 16384)
[L1176] EXPR s->state
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1176] COND FALSE !(s->state == 8192)
[L1179] EXPR s->state
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1179] COND FALSE !(s->state == 24576)
[L1182] EXPR s->state
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1182] COND FALSE !(s->state == 8195)
[L1185] EXPR s->state
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1185] COND FALSE !(s->state == 8480)
[L1188] EXPR s->state
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1188] COND FALSE !(s->state == 8481)
[L1191] EXPR s->state
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1191] COND FALSE !(s->state == 8482)
[L1194] EXPR s->state
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1194] COND FALSE !(s->state == 8464)
[L1197] EXPR s->state
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1197] COND FALSE !(s->state == 8465)
[L1200] EXPR s->state
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1200] COND FALSE !(s->state == 8466)
[L1203] EXPR s->state
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1203] COND FALSE !(s->state == 8496)
[L1206] EXPR s->state
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1206] COND FALSE !(s->state == 8497)
[L1209] EXPR s->state
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1209] COND FALSE !(s->state == 8512)
[L1212] EXPR s->state
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1212] COND FALSE !(s->state == 8513)
[L1215] EXPR s->state
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1215] COND TRUE s->state == 8528
[L1412] EXPR s->s3
[L1412] EXPR (s->s3)->tmp.new_cipher
[L1412] EXPR ((s->s3)->tmp.new_cipher)->algorithms
[L1412] l = ((s->s3)->tmp.new_cipher)->algorithms
[L1413] EXPR s->options
VAL [={0:-10}, blastFlag=6, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->options=4294967297, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1413] COND TRUE s->options & 2097152UL
[L1414] EXPR s->s3
[L1414] (s->s3)->tmp.use_rsa_tmp = 1
[L1418] EXPR s->s3
[L1418] (s->s3)->tmp.use_rsa_tmp
VAL [={0:-10}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=6, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->s3={-13:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1418] COND TRUE (s->s3)->tmp.use_rsa_tmp
[L1436] ret = __VERIFIER_nondet_int()
[L1437] COND TRUE blastFlag == 6
[L1438] blastFlag = 7
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1442] COND FALSE !(ret <= 0)
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1459] s->state = 8544
[L1460] s->init_num = 0
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1716] EXPR s->s3
[L1716] EXPR (s->s3)->tmp.reuse_message
VAL [={0:-10}, (s->s3)->tmp.reuse_message=4294967335, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->s3={-13:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1716] COND FALSE !(! (s->s3)->tmp.reuse_message)
[L1745] skip = 0
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1167] COND TRUE 1
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1169] EXPR s->state
[L1169] state = s->state
[L1170] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1170] COND FALSE !(s->state == 12292)
[L1173] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1173] COND FALSE !(s->state == 16384)
[L1176] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1176] COND FALSE !(s->state == 8192)
[L1179] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1179] COND FALSE !(s->state == 24576)
[L1182] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1182] COND FALSE !(s->state == 8195)
[L1185] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1185] COND FALSE !(s->state == 8480)
[L1188] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1188] COND FALSE !(s->state == 8481)
[L1191] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1191] COND FALSE !(s->state == 8482)
[L1194] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1194] COND FALSE !(s->state == 8464)
[L1197] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1197] COND FALSE !(s->state == 8465)
[L1200] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1200] COND FALSE !(s->state == 8466)
[L1203] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1203] COND FALSE !(s->state == 8496)
[L1206] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1206] COND FALSE !(s->state == 8497)
[L1209] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1209] COND FALSE !(s->state == 8512)
[L1212] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1212] COND FALSE !(s->state == 8513)
[L1215] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1215] COND FALSE !(s->state == 8528)
[L1218] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1218] COND FALSE !(s->state == 8529)
[L1221] EXPR s->state
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1221] COND TRUE s->state == 8544
[L1464] EXPR s->verify_mode
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->verify_mode=5, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1464] COND TRUE s->verify_mode & 1
[L1465] EXPR s->session
[L1465] EXPR (s->session)->peer
VAL [={0:-10}, (s->session)->peer={0:0}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->session={-5:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1465] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0))
[L1475] EXPR s->s3
[L1475] EXPR (s->s3)->tmp.new_cipher
[L1475] EXPR ((s->s3)->tmp.new_cipher)->algorithms
VAL [={0:-10}, ((s->s3)->tmp.new_cipher)->algorithms=4294967319, (s->s3)->tmp.new_cipher={-8:0}, blastFlag=7, got_new_session=1, init=1, l=23, ret=1, s={-6:0}, s={-6:0}, s->s3={-13:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1475] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL)
[L1485] EXPR s->s3
[L1485] (s->s3)->tmp.cert_request = 1
[L1486] ret = __VERIFIER_nondet_int()
[L1487] COND TRUE blastFlag == 7
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=0, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
[L1757] reach_error()
VAL [={0:-10}, blastFlag=7, got_new_session=1, init=1, l=23, ret=0, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.1s, OverallIterations: 32, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 35.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 2802 SdHoareTripleChecker+Valid, 34.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2802 mSDsluCounter, 13512 SdHoareTripleChecker+Invalid, 32.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7878 mSDsCounter, 836 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5589 IncrementalHoareTripleChecker+Invalid, 6428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 836 mSolverCounterUnsat, 5634 mSDtfsCounter, 5589 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1675occurred in iteration=30, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 1354 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 2660 NumberOfCodeBlocks, 2660 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2500 ConstructedInterpolants, 0 QuantifiedInterpolants, 6359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 1458/1458 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
[2022-11-02 20:55:14,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/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_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267
--- Real Ultimate output ---
[0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset.
This is Ultimate 0.2.2-dev-5e519f3
[2022-11-02 20:55:16,691 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-11-02 20:55:16,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-11-02 20:55:16,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-11-02 20:55:16,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-11-02 20:55:16,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-11-02 20:55:16,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-11-02 20:55:16,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-11-02 20:55:16,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-11-02 20:55:16,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-11-02 20:55:16,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-11-02 20:55:16,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-11-02 20:55:16,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-11-02 20:55:16,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-11-02 20:55:16,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-11-02 20:55:16,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-11-02 20:55:16,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-11-02 20:55:16,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-11-02 20:55:16,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-11-02 20:55:16,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-11-02 20:55:16,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-11-02 20:55:16,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-11-02 20:55:16,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-11-02 20:55:16,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-11-02 20:55:16,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-11-02 20:55:16,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-11-02 20:55:16,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-11-02 20:55:16,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-11-02 20:55:16,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-11-02 20:55:16,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-11-02 20:55:16,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-11-02 20:55:16,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-11-02 20:55:16,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-11-02 20:55:16,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-11-02 20:55:16,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-11-02 20:55:16,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-11-02 20:55:16,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-11-02 20:55:16,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-11-02 20:55:16,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-11-02 20:55:16,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-11-02 20:55:16,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-11-02 20:55:16,824 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2022-11-02 20:55:16,864 INFO L113 SettingsManager]: Loading preferences was successful
[2022-11-02 20:55:16,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-11-02 20:55:16,866 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-11-02 20:55:16,866 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-11-02 20:55:16,867 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-11-02 20:55:16,868 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-11-02 20:55:16,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-11-02 20:55:16,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-11-02 20:55:16,870 INFO L138 SettingsManager]: * Use SBE=true
[2022-11-02 20:55:16,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-11-02 20:55:16,871 INFO L138 SettingsManager]: * sizeof long=4
[2022-11-02 20:55:16,871 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-11-02 20:55:16,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-11-02 20:55:16,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-11-02 20:55:16,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-11-02 20:55:16,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-11-02 20:55:16,872 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2022-11-02 20:55:16,873 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true
[2022-11-02 20:55:16,873 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2022-11-02 20:55:16,873 INFO L138 SettingsManager]: * sizeof long double=12
[2022-11-02 20:55:16,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-11-02 20:55:16,874 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-11-02 20:55:16,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-11-02 20:55:16,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-11-02 20:55:16,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-11-02 20:55:16,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-11-02 20:55:16,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:55:16,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-11-02 20:55:16,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-11-02 20:55:16,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-11-02 20:55:16,876 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF
[2022-11-02 20:55:16,876 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2022-11-02 20:55:16,877 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2022-11-02 20:55:16,877 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2022-11-02 20:55:16,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-11-02 20:55:16,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2022-11-02 20:55:16,877 INFO L138 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_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/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_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267
[2022-11-02 20:55:17,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-11-02 20:55:17,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-11-02 20:55:17,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-11-02 20:55:17,268 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-11-02 20:55:17,269 INFO L275 PluginConnector]: CDTParser initialized
[2022-11-02 20:55:17,271 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c
[2022-11-02 20:55:17,345 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/data/d70f24625/1a8967726d9f4322b93433f03bc2699d/FLAG28c92db8f
[2022-11-02 20:55:18,075 INFO L306 CDTParser]: Found 1 translation units.
[2022-11-02 20:55:18,076 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c
[2022-11-02 20:55:18,116 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/data/d70f24625/1a8967726d9f4322b93433f03bc2699d/FLAG28c92db8f
[2022-11-02 20:55:18,284 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/data/d70f24625/1a8967726d9f4322b93433f03bc2699d
[2022-11-02 20:55:18,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-11-02 20:55:18,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-11-02 20:55:18,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-11-02 20:55:18,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-11-02 20:55:18,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-11-02 20:55:18,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:55:18" (1/1) ...
[2022-11-02 20:55:18,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12630a61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:18, skipping insertion in model container
[2022-11-02 20:55:18,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:55:18" (1/1) ...
[2022-11-02 20:55:18,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-11-02 20:55:18,372 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-11-02 20:55:18,895 WARN L230 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_7ec1e989-13e1-46ec-8836-d206c4860960/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382]
[2022-11-02 20:55:18,907 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:55:18,940 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution]
[2022-11-02 20:55:18,955 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-11-02 20:55:19,113 WARN L230 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_7ec1e989-13e1-46ec-8836-d206c4860960/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382]
[2022-11-02 20:55:19,118 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:55:19,127 INFO L203 MainTranslator]: Completed pre-run
[2022-11-02 20:55:19,291 WARN L230 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_7ec1e989-13e1-46ec-8836-d206c4860960/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382]
[2022-11-02 20:55:19,294 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:55:19,317 INFO L208 MainTranslator]: Completed translation
[2022-11-02 20:55:19,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:19 WrapperNode
[2022-11-02 20:55:19,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-11-02 20:55:19,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-11-02 20:55:19,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-11-02 20:55:19,320 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-11-02 20:55:19,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:19" (1/1) ...
[2022-11-02 20:55:19,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:19" (1/1) ...
[2022-11-02 20:55:19,449 INFO L138 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 762
[2022-11-02 20:55:19,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-11-02 20:55:19,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-11-02 20:55:19,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-11-02 20:55:19,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-11-02 20:55:19,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:19" (1/1) ...
[2022-11-02 20:55:19,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:19" (1/1) ...
[2022-11-02 20:55:19,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:19" (1/1) ...
[2022-11-02 20:55:19,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:19" (1/1) ...
[2022-11-02 20:55:19,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:19" (1/1) ...
[2022-11-02 20:55:19,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:19" (1/1) ...
[2022-11-02 20:55:19,523 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:19" (1/1) ...
[2022-11-02 20:55:19,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:19" (1/1) ...
[2022-11-02 20:55:19,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-11-02 20:55:19,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-11-02 20:55:19,533 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-11-02 20:55:19,534 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-11-02 20:55:19,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:19" (1/1) ...
[2022-11-02 20:55:19,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:55:19,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:55:19,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-11-02 20:55:19,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-11-02 20:55:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-11-02 20:55:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1
[2022-11-02 20:55:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2022-11-02 20:55:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4
[2022-11-02 20:55:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2022-11-02 20:55:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2022-11-02 20:55:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-11-02 20:55:19,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-11-02 20:55:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2022-11-02 20:55:19,876 INFO L235 CfgBuilder]: Building ICFG
[2022-11-02 20:55:19,878 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-11-02 20:55:19,914 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2022-11-02 20:55:28,483 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false;
[2022-11-02 20:55:28,484 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false;
[2022-11-02 20:55:28,484 INFO L276 CfgBuilder]: Performing block encoding
[2022-11-02 20:55:28,497 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-11-02 20:55:28,497 INFO L300 CfgBuilder]: Removed 1 assume(true) statements.
[2022-11-02 20:55:28,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:55:28 BoogieIcfgContainer
[2022-11-02 20:55:28,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-11-02 20:55:28,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-11-02 20:55:28,504 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-11-02 20:55:28,507 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-11-02 20:55:28,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:55:18" (1/3) ...
[2022-11-02 20:55:28,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654bac95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:55:28, skipping insertion in model container
[2022-11-02 20:55:28,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:19" (2/3) ...
[2022-11-02 20:55:28,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654bac95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:55:28, skipping insertion in model container
[2022-11-02 20:55:28,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:55:28" (3/3) ...
[2022-11-02 20:55:28,512 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c
[2022-11-02 20:55:28,530 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-11-02 20:55:28,530 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-11-02 20:55:28,604 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-02 20:55:28,615 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@b4d88f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-02 20:55:28,615 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-11-02 20:55:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2022-11-02 20:55:28,637 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:28,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:28,639 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:28,646 INFO L85 PathProgramCache]: Analyzing trace with hash -442385417, now seen corresponding path program 1 times
[2022-11-02 20:55:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-02 20:55:28,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541611106]
[2022-11-02 20:55:28,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:28,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-11-02 20:55:28,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat
[2022-11-02 20:55:28,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2022-11-02 20:55:28,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2022-11-02 20:55:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:29,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-11-02 20:55:29,386 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:55:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:55:29,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:55:29,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-02 20:55:29,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541611106]
[2022-11-02 20:55:29,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541611106] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:29,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:29,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:55:29,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13830882]
[2022-11-02 20:55:29,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:29,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:55:29,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-02 20:55:29,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:55:29,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:29,634 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:29,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:29,817 INFO L93 Difference]: Finished difference Result 427 states and 728 transitions.
[2022-11-02 20:55:29,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:55:29,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37
[2022-11-02 20:55:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:29,845 INFO L225 Difference]: With dead ends: 427
[2022-11-02 20:55:29,845 INFO L226 Difference]: Without dead ends: 261
[2022-11-02 20:55:29,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:29,861 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 201 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:29,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 461 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-11-02 20:55:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states.
[2022-11-02 20:55:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261.
[2022-11-02 20:55:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.5153846153846153) internal successors, (394), 260 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 394 transitions.
[2022-11-02 20:55:29,941 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 394 transitions. Word has length 37
[2022-11-02 20:55:29,942 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:29,942 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 394 transitions.
[2022-11-02 20:55:29,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 394 transitions.
[2022-11-02 20:55:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2022-11-02 20:55:29,950 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:29,951 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:29,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0
[2022-11-02 20:55:30,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3
[2022-11-02 20:55:30,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:30,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:30,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1297584632, now seen corresponding path program 1 times
[2022-11-02 20:55:30,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-02 20:55:30,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356264371]
[2022-11-02 20:55:30,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:30,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-11-02 20:55:30,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat
[2022-11-02 20:55:30,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2022-11-02 20:55:30,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2022-11-02 20:55:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:30,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-11-02 20:55:30,939 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:55:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:55:31,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:55:31,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-02 20:55:31,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356264371]
[2022-11-02 20:55:31,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356264371] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:31,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:31,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:55:31,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016561601]
[2022-11-02 20:55:31,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:31,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:55:31,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-02 20:55:31,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:55:31,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:31,094 INFO L87 Difference]: Start difference. First operand 261 states and 394 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:32,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:55:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:32,241 INFO L93 Difference]: Finished difference Result 510 states and 781 transitions.
[2022-11-02 20:55:32,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:55:32,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54
[2022-11-02 20:55:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:32,244 INFO L225 Difference]: With dead ends: 510
[2022-11-02 20:55:32,244 INFO L226 Difference]: Without dead ends: 383
[2022-11-02 20:55:32,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:32,246 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 150 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:32,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 567 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-11-02 20:55:32,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states.
[2022-11-02 20:55:32,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383.
[2022-11-02 20:55:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5052356020942408) internal successors, (575), 382 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 575 transitions.
[2022-11-02 20:55:32,272 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 575 transitions. Word has length 54
[2022-11-02 20:55:32,273 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:32,273 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 575 transitions.
[2022-11-02 20:55:32,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 575 transitions.
[2022-11-02 20:55:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2022-11-02 20:55:32,280 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:32,280 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:32,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2022-11-02 20:55:32,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3
[2022-11-02 20:55:32,497 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:32,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:32,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2072838766, now seen corresponding path program 1 times
[2022-11-02 20:55:32,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-02 20:55:32,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458358199]
[2022-11-02 20:55:32,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:32,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-11-02 20:55:32,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat
[2022-11-02 20:55:32,502 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2022-11-02 20:55:32,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2022-11-02 20:55:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:33,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-11-02 20:55:33,285 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:55:33,422 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2022-11-02 20:55:33,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:55:33,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-02 20:55:33,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458358199]
[2022-11-02 20:55:33,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458358199] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:33,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:33,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:55:33,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344051853]
[2022-11-02 20:55:33,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:33,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:55:33,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-02 20:55:33,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:55:33,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:33,425 INFO L87 Difference]: Start difference. First operand 383 states and 575 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:33,987 INFO L93 Difference]: Finished difference Result 754 states and 1144 transitions.
[2022-11-02 20:55:33,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:55:33,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2022-11-02 20:55:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:33,990 INFO L225 Difference]: With dead ends: 754
[2022-11-02 20:55:33,990 INFO L226 Difference]: Without dead ends: 505
[2022-11-02 20:55:33,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:33,992 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 148 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:33,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-11-02 20:55:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states.
[2022-11-02 20:55:34,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505.
[2022-11-02 20:55:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.501984126984127) internal successors, (757), 504 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 757 transitions.
[2022-11-02 20:55:34,021 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 757 transitions. Word has length 76
[2022-11-02 20:55:34,024 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:34,025 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 757 transitions.
[2022-11-02 20:55:34,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 757 transitions.
[2022-11-02 20:55:34,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2022-11-02 20:55:34,029 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:34,030 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:34,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0
[2022-11-02 20:55:34,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3
[2022-11-02 20:55:34,236 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:34,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1458485308, now seen corresponding path program 1 times
[2022-11-02 20:55:34,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-02 20:55:34,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301568568]
[2022-11-02 20:55:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:34,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-11-02 20:55:34,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat
[2022-11-02 20:55:34,243 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2022-11-02 20:55:34,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2022-11-02 20:55:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:35,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-11-02 20:55:35,020 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:55:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked.
[2022-11-02 20:55:35,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:55:35,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-02 20:55:35,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301568568]
[2022-11-02 20:55:35,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301568568] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:35,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:35,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:55:35,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175329290]
[2022-11-02 20:55:35,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:35,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:55:35,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-02 20:55:35,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:55:35,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:35,157 INFO L87 Difference]: Start difference. First operand 505 states and 757 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:35,909 INFO L93 Difference]: Finished difference Result 1000 states and 1510 transitions.
[2022-11-02 20:55:35,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:55:35,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100
[2022-11-02 20:55:35,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:35,913 INFO L225 Difference]: With dead ends: 1000
[2022-11-02 20:55:35,913 INFO L226 Difference]: Without dead ends: 629
[2022-11-02 20:55:35,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:35,915 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 152 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:35,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 572 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-11-02 20:55:35,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states.
[2022-11-02 20:55:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629.
[2022-11-02 20:55:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 1.4984076433121019) internal successors, (941), 628 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:35,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 941 transitions.
[2022-11-02 20:55:35,948 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 941 transitions. Word has length 100
[2022-11-02 20:55:35,948 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:35,949 INFO L495 AbstractCegarLoop]: Abstraction has 629 states and 941 transitions.
[2022-11-02 20:55:35,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 941 transitions.
[2022-11-02 20:55:35,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2022-11-02 20:55:35,951 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:35,951 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:35,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0
[2022-11-02 20:55:36,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3
[2022-11-02 20:55:36,168 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:36,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1045011737, now seen corresponding path program 1 times
[2022-11-02 20:55:36,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-02 20:55:36,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399795963]
[2022-11-02 20:55:36,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:36,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-11-02 20:55:36,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat
[2022-11-02 20:55:36,171 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2022-11-02 20:55:36,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2022-11-02 20:55:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:37,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-11-02 20:55:37,059 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:55:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked.
[2022-11-02 20:55:37,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:55:37,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-02 20:55:37,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399795963]
[2022-11-02 20:55:37,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399795963] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:37,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:37,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:55:37,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143666940]
[2022-11-02 20:55:37,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:37,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:55:37,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-02 20:55:37,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:55:37,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:37,217 INFO L87 Difference]: Start difference. First operand 629 states and 941 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:37,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:37,899 INFO L93 Difference]: Finished difference Result 1246 states and 1875 transitions.
[2022-11-02 20:55:37,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:55:37,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117
[2022-11-02 20:55:37,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:37,903 INFO L225 Difference]: With dead ends: 1246
[2022-11-02 20:55:37,903 INFO L226 Difference]: Without dead ends: 751
[2022-11-02 20:55:37,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:55:37,905 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 149 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:37,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-11-02 20:55:37,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states.
[2022-11-02 20:55:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751.
[2022-11-02 20:55:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 1.496) internal successors, (1122), 750 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:37,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1122 transitions.
[2022-11-02 20:55:37,928 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1122 transitions. Word has length 117
[2022-11-02 20:55:37,928 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:37,928 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 1122 transitions.
[2022-11-02 20:55:37,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1122 transitions.
[2022-11-02 20:55:37,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2022-11-02 20:55:37,931 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:37,931 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:37,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0
[2022-11-02 20:55:38,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3
[2022-11-02 20:55:38,148 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:38,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:38,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1006485834, now seen corresponding path program 1 times
[2022-11-02 20:55:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-02 20:55:38,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531192528]
[2022-11-02 20:55:38,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:38,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-11-02 20:55:38,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat
[2022-11-02 20:55:38,150 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2022-11-02 20:55:38,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2022-11-02 20:55:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:39,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 29 conjunts are in the unsatisfiable core
[2022-11-02 20:55:39,623 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:55:39,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9
[2022-11-02 20:55:39,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9
[2022-11-02 20:55:39,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 78 treesize of output 85
[2022-11-02 20:55:39,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 85
[2022-11-02 20:55:39,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 49
[2022-11-02 20:55:39,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49
[2022-11-02 20:55:39,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7
[2022-11-02 20:55:39,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7
[2022-11-02 20:55:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked.
[2022-11-02 20:55:39,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:55:39,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-02 20:55:39,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531192528]
[2022-11-02 20:55:39,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531192528] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:39,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:39,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-11-02 20:55:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208057297]
[2022-11-02 20:55:39,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:39,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-11-02 20:55:39,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-02 20:55:39,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-11-02 20:55:39,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:55:39,985 INFO L87 Difference]: Start difference. First operand 751 states and 1122 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:42,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:55:44,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:55:47,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:55:48,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:55:54,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:55:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:55:55,852 INFO L93 Difference]: Finished difference Result 1499 states and 2240 transitions.
[2022-11-02 20:55:55,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-11-02 20:55:55,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129
[2022-11-02 20:55:55,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:55:55,863 INFO L225 Difference]: With dead ends: 1499
[2022-11-02 20:55:55,863 INFO L226 Difference]: Without dead ends: 751
[2022-11-02 20:55:55,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2022-11-02 20:55:55,866 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time
[2022-11-02 20:55:55,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 15.7s Time]
[2022-11-02 20:55:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states.
[2022-11-02 20:55:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751.
[2022-11-02 20:55:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 1.4946666666666666) internal successors, (1121), 750 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:55,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1121 transitions.
[2022-11-02 20:55:55,893 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1121 transitions. Word has length 129
[2022-11-02 20:55:55,893 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:55:55,893 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 1121 transitions.
[2022-11-02 20:55:55,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:55:55,894 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1121 transitions.
[2022-11-02 20:55:55,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2022-11-02 20:55:55,898 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:55:55,898 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:55:55,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0
[2022-11-02 20:55:56,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3
[2022-11-02 20:55:56,112 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:55:56,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:55:56,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1440991432, now seen corresponding path program 1 times
[2022-11-02 20:55:56,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-02 20:55:56,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803313895]
[2022-11-02 20:55:56,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:55:56,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-11-02 20:55:56,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat
[2022-11-02 20:55:56,114 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2022-11-02 20:55:56,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2022-11-02 20:55:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:55:58,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-11-02 20:55:58,086 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:55:58,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 38
[2022-11-02 20:55:58,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 50
[2022-11-02 20:55:58,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-11-02 20:55:58,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 14
[2022-11-02 20:55:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2022-11-02 20:55:58,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:55:58,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2022-11-02 20:55:58,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803313895]
[2022-11-02 20:55:58,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803313895] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:55:58,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:55:58,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:55:58,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696577903]
[2022-11-02 20:55:58,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:55:58,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:55:58,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2022-11-02 20:55:58,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:55:58,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:55:58,293 INFO L87 Difference]: Start difference. First operand 751 states and 1121 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:56:00,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:56:02,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:56:04,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:56:07,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-11-02 20:56:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:56:10,158 INFO L93 Difference]: Finished difference Result 1770 states and 2646 transitions.
[2022-11-02 20:56:10,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:56:10,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129
[2022-11-02 20:56:10,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:56:10,165 INFO L225 Difference]: With dead ends: 1770
[2022-11-02 20:56:10,165 INFO L226 Difference]: Without dead ends: 1029
[2022-11-02 20:56:10,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:56:10,167 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 36 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time
[2022-11-02 20:56:10,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 590 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 138 Invalid, 2 Unknown, 40 Unchecked, 11.8s Time]
[2022-11-02 20:56:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states.
[2022-11-02 20:56:10,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 906.
[2022-11-02 20:56:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 905 states have (on average 1.529281767955801) internal successors, (1384), 905 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:56:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1384 transitions.
[2022-11-02 20:56:10,201 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1384 transitions. Word has length 129
[2022-11-02 20:56:10,201 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:56:10,201 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 1384 transitions.
[2022-11-02 20:56:10,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:56:10,202 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1384 transitions.
[2022-11-02 20:56:10,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2022-11-02 20:56:10,204 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:56:10,205 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:56:10,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0
[2022-11-02 20:56:10,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3
[2022-11-02 20:56:10,434 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:56:10,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:56:10,434 INFO L85 PathProgramCache]: Analyzing trace with hash 895401078, now seen corresponding path program 1 times
[2022-11-02 20:56:10,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2022-11-02 20:56:10,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228500460]
[2022-11-02 20:56:10,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:56:10,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2022-11-02 20:56:10,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat
[2022-11-02 20:56:10,437 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2022-11-02 20:56:10,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process
[2022-11-02 20:56:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 20:56:22,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-02 20:56:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 20:56:25,459 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2022-11-02 20:56:25,459 INFO L359 BasicCegarLoop]: Counterexample is feasible
[2022-11-02 20:56:25,460 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-11-02 20:56:25,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0
[2022-11-02 20:56:25,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3
[2022-11-02 20:56:25,686 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:56:25,689 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-11-02 20:56:25,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:56:25 BoogieIcfgContainer
[2022-11-02 20:56:25,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-11-02 20:56:25,876 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2022-11-02 20:56:25,876 INFO L271 PluginConnector]: Initializing Witness Printer...
[2022-11-02 20:56:25,877 INFO L275 PluginConnector]: Witness Printer initialized
[2022-11-02 20:56:25,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:55:28" (3/4) ...
[2022-11-02 20:56:25,881 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2022-11-02 20:56:26,014 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/witness.graphml
[2022-11-02 20:56:26,015 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2022-11-02 20:56:26,015 INFO L158 Benchmark]: Toolchain (without parser) took 67726.03ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 71.5MB in the beginning and 62.4MB in the end (delta: 9.1MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB.
[2022-11-02 20:56:26,016 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 88.1MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2022-11-02 20:56:26,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1024.60ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 71.3MB in the beginning and 80.4MB in the end (delta: -9.1MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB.
[2022-11-02 20:56:26,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 132.32ms. Allocated memory is still 107.0MB. Free memory was 80.4MB in the beginning and 75.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2022-11-02 20:56:26,017 INFO L158 Benchmark]: Boogie Preprocessor took 80.16ms. Allocated memory is still 107.0MB. Free memory was 75.8MB in the beginning and 68.2MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2022-11-02 20:56:26,017 INFO L158 Benchmark]: RCFGBuilder took 8967.81ms. Allocated memory is still 107.0MB. Free memory was 68.2MB in the beginning and 46.6MB in the end (delta: 21.6MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB.
[2022-11-02 20:56:26,018 INFO L158 Benchmark]: TraceAbstraction took 57372.71ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 46.1MB in the beginning and 77.1MB in the end (delta: -31.0MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB.
[2022-11-02 20:56:26,018 INFO L158 Benchmark]: Witness Printer took 138.61ms. Allocated memory is still 157.3MB. Free memory was 77.1MB in the beginning and 62.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2022-11-02 20:56:26,024 INFO L339 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 88.1MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 1024.60ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 71.3MB in the beginning and 80.4MB in the end (delta: -9.1MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 132.32ms. Allocated memory is still 107.0MB. Free memory was 80.4MB in the beginning and 75.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 80.16ms. Allocated memory is still 107.0MB. Free memory was 75.8MB in the beginning and 68.2MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 8967.81ms. Allocated memory is still 107.0MB. Free memory was 68.2MB in the beginning and 46.6MB in the end (delta: 21.6MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB.
* TraceAbstraction took 57372.71ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 46.1MB in the beginning and 77.1MB in the end (delta: -31.0MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB.
* Witness Printer took 138.61ms. Allocated memory is still 157.3MB. Free memory was 77.1MB in the beginning and 62.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- CounterExampleResult [Line: 1757]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L1054] static int init = 1;
[L1055] static SSL_METHOD SSLv3_server_data ;
VAL [init=1, SSLv3_server_data={4:0}]
[L1077] SSL *s ;
[L1078] int tmp ;
[L1082] s = malloc(sizeof(SSL))
[L1083] s->s3 = malloc(sizeof(struct ssl3_state_st))
[L1084] s->ctx = malloc(sizeof(SSL_CTX))
[L1085] s->session = malloc(sizeof(SSL_SESSION))
[L1087] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong()
[L1088] s->options = __VERIFIER_nondet_ulong()
[L1089] s->verify_mode = __VERIFIER_nondet_int()
[L1090] EXPR s->session
[L1090] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong()
[L1091] EXPR s->s3
[L1091] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int()
[L1092] EXPR s->s3
[L1092] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st))
[L1093] EXPR s->s3
[L1093] EXPR (s->s3)->tmp.new_cipher
[L1093] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong()
[L1094] EXPR s->s3
[L1094] EXPR (s->s3)->tmp.new_cipher
[L1094] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong()
[L1095] COND FALSE !(__VERIFIER_nondet_int())
[L1101] s->cert = malloc(sizeof(struct cert_st))
[L1102] EXPR s->cert
[L1102] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong()
[L1105] CALL ssl3_accept(s)
[L1111] BUF_MEM *buf ;
[L1112] unsigned long l ;
[L1113] unsigned long Time ;
[L1114] unsigned long tmp ;
[L1115] void (*cb)() ;
[L1116] long num1 ;
[L1117] int ret ;
[L1118] int new_state ;
[L1119] int state ;
[L1120] int skip ;
[L1121] int got_new_session ;
[L1122] int tmp___1 = __VERIFIER_nondet_int() ;
[L1123] int tmp___2 = __VERIFIER_nondet_int() ;
[L1124] int tmp___3 = __VERIFIER_nondet_int() ;
[L1125] int tmp___4 = __VERIFIER_nondet_int() ;
[L1126] int tmp___5 = __VERIFIER_nondet_int() ;
[L1127] int tmp___6 = __VERIFIER_nondet_int() ;
[L1128] int tmp___7 ;
[L1129] long tmp___8 = __VERIFIER_nondet_long() ;
[L1130] int tmp___9 = __VERIFIER_nondet_int() ;
[L1131] int tmp___10 = __VERIFIER_nondet_int() ;
[L1132] int blastFlag ;
[L1136] s->state = 8464
[L1137] blastFlag = 0
[L1138] s->hit=__VERIFIER_nondet_int ()
[L1139] s->state = 8464
[L1140] tmp = __VERIFIER_nondet_int()
[L1141] Time = tmp
[L1142] cb = (void (*)())((void *)0)
[L1143] ret = -1
[L1144] skip = 0
[L1145] got_new_session = 0
[L1146] EXPR s->info_callback
VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483642:0}, s={-2147483642:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5]
[L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0)
[L1147] EXPR s->info_callback
[L1147] cb = s->info_callback
[L1151] EXPR s->in_handshake
[L1151] s->in_handshake += 1
[L1152] COND FALSE !(tmp___1 & 12288)
VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0]
[L1161] EXPR s->cert
VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483642:0}, s={-2147483642:0}, s->cert={-2147483641:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0]
[L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0))
[L1167] COND TRUE 1
VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0]
[L1169] EXPR s->state
[L1169] state = s->state
[L1170] EXPR s->state
VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483642:0}, s={-2147483642:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0]
[L1170] COND FALSE !(s->state == 12292)
[L1173] EXPR s->state
VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483642:0}, s={-2147483642:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0]
[L1173] COND FALSE !(s->state == 16384)
[L1176] EXPR s->state
VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483642:0}, s={-2147483642:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0]
[L1176] COND FALSE !(s->state == 8192)
[L1179] EXPR s->state
VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483642:0}, s={-2147483642:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0]
[L1179] COND FALSE !(s->state == 24576)
[L1182] EXPR s->state
VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483642:0}, s={-2147483642:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0]
[L1182] COND FALSE !(s->state == 8195)
[L1185] EXPR s->state
VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483642:0}, s={-2147483642:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0]
[L1185] COND FALSE !(s->state == 8480)
[L1188] EXPR s->state
VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483642:0}, s={-2147483642:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0]
[L1188] COND FALSE !(s->state == 8481)
[L1191] EXPR s->state
VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483642:0}, s={-2147483642:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0]
[L1191] COND FALSE !(s->state == 8482)
[L1194] EXPR s->state
VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483642:0}, s={-2147483642:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0]
[L1194] COND TRUE s->state == 8464
[L1354] s->shutdown = 0
[L1355] ret = __VERIFIER_nondet_int()
[L1356] COND TRUE blastFlag == 0
[L1357] blastFlag = 1
VAL [={0:-2147483648}, blastFlag=1, got_new_session=0, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0]
[L1361] COND FALSE !(ret <= 0)
[L1366] got_new_session = 1
[L1367] s->state = 8496
[L1368] s->init_num = 0
VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0]
[L1716] EXPR s->s3
[L1716] EXPR (s->s3)->tmp.reuse_message
VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->s3={1073741828:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0]
[L1716] COND FALSE !(! (s->s3)->tmp.reuse_message)
[L1745] skip = 0
VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0]
[L1167] COND TRUE 1
VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0]
[L1169] EXPR s->state
[L1169] state = s->state
[L1170] EXPR s->state
VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1170] COND FALSE !(s->state == 12292)
[L1173] EXPR s->state
VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1173] COND FALSE !(s->state == 16384)
[L1176] EXPR s->state
VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1176] COND FALSE !(s->state == 8192)
[L1179] EXPR s->state
VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1179] COND FALSE !(s->state == 24576)
[L1182] EXPR s->state
VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1182] COND FALSE !(s->state == 8195)
[L1185] EXPR s->state
VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1185] COND FALSE !(s->state == 8480)
[L1188] EXPR s->state
VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1188] COND FALSE !(s->state == 8481)
[L1191] EXPR s->state
VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1191] COND FALSE !(s->state == 8482)
[L1194] EXPR s->state
VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1194] COND FALSE !(s->state == 8464)
[L1197] EXPR s->state
VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1197] COND FALSE !(s->state == 8465)
[L1200] EXPR s->state
VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1200] COND FALSE !(s->state == 8466)
[L1203] EXPR s->state
VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1203] COND TRUE s->state == 8496
[L1372] ret = __VERIFIER_nondet_int()
[L1373] COND TRUE blastFlag == 1
[L1374] blastFlag = 2
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1378] COND FALSE !(ret <= 0)
[L1383] s->hit
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->hit=0, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1383] COND FALSE !(s->hit)
[L1386] s->state = 8512
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1388] s->init_num = 0
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1716] EXPR s->s3
[L1716] EXPR (s->s3)->tmp.reuse_message
VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->s3={1073741828:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1716] COND FALSE !(! (s->s3)->tmp.reuse_message)
[L1745] skip = 0
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1167] COND TRUE 1
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0]
[L1169] EXPR s->state
[L1169] state = s->state
[L1170] EXPR s->state
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1170] COND FALSE !(s->state == 12292)
[L1173] EXPR s->state
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1173] COND FALSE !(s->state == 16384)
[L1176] EXPR s->state
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1176] COND FALSE !(s->state == 8192)
[L1179] EXPR s->state
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1179] COND FALSE !(s->state == 24576)
[L1182] EXPR s->state
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1182] COND FALSE !(s->state == 8195)
[L1185] EXPR s->state
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1185] COND FALSE !(s->state == 8480)
[L1188] EXPR s->state
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1188] COND FALSE !(s->state == 8481)
[L1191] EXPR s->state
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1191] COND FALSE !(s->state == 8482)
[L1194] EXPR s->state
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1194] COND FALSE !(s->state == 8464)
[L1197] EXPR s->state
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1197] COND FALSE !(s->state == 8465)
[L1200] EXPR s->state
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1200] COND FALSE !(s->state == 8466)
[L1203] EXPR s->state
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1203] COND FALSE !(s->state == 8496)
[L1206] EXPR s->state
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1206] COND FALSE !(s->state == 8497)
[L1209] EXPR s->state
VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1209] COND TRUE s->state == 8512
[L1392] EXPR s->s3
[L1392] EXPR (s->s3)->tmp.new_cipher
[L1392] EXPR ((s->s3)->tmp.new_cipher)->algorithms
VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={6:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->s3={1073741828:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1392] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL)
[L1395] ret = __VERIFIER_nondet_int()
[L1396] COND TRUE blastFlag == 2
[L1397] blastFlag = 6
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1401] COND FALSE !(ret <= 0)
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1407] s->state = 8528
[L1408] s->init_num = 0
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1716] EXPR s->s3
[L1716] EXPR (s->s3)->tmp.reuse_message
VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->s3={1073741828:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1716] COND FALSE !(! (s->s3)->tmp.reuse_message)
[L1745] skip = 0
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1167] COND TRUE 1
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0]
[L1169] EXPR s->state
[L1169] state = s->state
[L1170] EXPR s->state
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1170] COND FALSE !(s->state == 12292)
[L1173] EXPR s->state
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1173] COND FALSE !(s->state == 16384)
[L1176] EXPR s->state
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1176] COND FALSE !(s->state == 8192)
[L1179] EXPR s->state
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1179] COND FALSE !(s->state == 24576)
[L1182] EXPR s->state
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1182] COND FALSE !(s->state == 8195)
[L1185] EXPR s->state
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1185] COND FALSE !(s->state == 8480)
[L1188] EXPR s->state
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1188] COND FALSE !(s->state == 8481)
[L1191] EXPR s->state
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1191] COND FALSE !(s->state == 8482)
[L1194] EXPR s->state
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1194] COND FALSE !(s->state == 8464)
[L1197] EXPR s->state
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1197] COND FALSE !(s->state == 8465)
[L1200] EXPR s->state
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1200] COND FALSE !(s->state == 8466)
[L1203] EXPR s->state
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1203] COND FALSE !(s->state == 8496)
[L1206] EXPR s->state
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1206] COND FALSE !(s->state == 8497)
[L1209] EXPR s->state
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1209] COND FALSE !(s->state == 8512)
[L1212] EXPR s->state
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1212] COND FALSE !(s->state == 8513)
[L1215] EXPR s->state
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1215] COND TRUE s->state == 8528
[L1412] EXPR s->s3
[L1412] EXPR (s->s3)->tmp.new_cipher
[L1412] EXPR ((s->s3)->tmp.new_cipher)->algorithms
[L1412] l = ((s->s3)->tmp.new_cipher)->algorithms
[L1413] EXPR s->options
VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->options=2097152, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1413] COND TRUE s->options & 2097152UL
[L1414] EXPR s->s3
[L1414] (s->s3)->tmp.use_rsa_tmp = 1
[L1418] EXPR s->s3
[L1418] (s->s3)->tmp.use_rsa_tmp
VAL [={0:-2147483648}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=6, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->s3={1073741828:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1418] COND TRUE (s->s3)->tmp.use_rsa_tmp
[L1436] ret = __VERIFIER_nondet_int()
[L1437] COND TRUE blastFlag == 6
[L1438] blastFlag = 7
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1442] COND FALSE !(ret <= 0)
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1459] s->state = 8544
[L1460] s->init_num = 0
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1716] EXPR s->s3
[L1716] EXPR (s->s3)->tmp.reuse_message
VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->s3={1073741828:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1716] COND FALSE !(! (s->s3)->tmp.reuse_message)
[L1745] skip = 0
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1167] COND TRUE 1
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0]
[L1169] EXPR s->state
[L1169] state = s->state
[L1170] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1170] COND FALSE !(s->state == 12292)
[L1173] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1173] COND FALSE !(s->state == 16384)
[L1176] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1176] COND FALSE !(s->state == 8192)
[L1179] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1179] COND FALSE !(s->state == 24576)
[L1182] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1182] COND FALSE !(s->state == 8195)
[L1185] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1185] COND FALSE !(s->state == 8480)
[L1188] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1188] COND FALSE !(s->state == 8481)
[L1191] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1191] COND FALSE !(s->state == 8482)
[L1194] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1194] COND FALSE !(s->state == 8464)
[L1197] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1197] COND FALSE !(s->state == 8465)
[L1200] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1200] COND FALSE !(s->state == 8466)
[L1203] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1203] COND FALSE !(s->state == 8496)
[L1206] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1206] COND FALSE !(s->state == 8497)
[L1209] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1209] COND FALSE !(s->state == 8512)
[L1212] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1212] COND FALSE !(s->state == 8513)
[L1215] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1215] COND FALSE !(s->state == 8528)
[L1218] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1218] COND FALSE !(s->state == 8529)
[L1221] EXPR s->state
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1221] COND TRUE s->state == 8544
[L1464] EXPR s->verify_mode
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->verify_mode=1, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1464] COND TRUE s->verify_mode & 1
[L1465] EXPR s->session
[L1465] EXPR (s->session)->peer
VAL [={0:-2147483648}, (s->session)->peer={0:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->session={-2147483643:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1465] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0))
[L1475] EXPR s->s3
[L1475] EXPR (s->s3)->tmp.new_cipher
[L1475] EXPR ((s->s3)->tmp.new_cipher)->algorithms
VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={6:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={-2147483642:0}, s={-2147483642:0}, s->s3={1073741828:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1475] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL)
[L1485] EXPR s->s3
[L1485] (s->s3)->tmp.cert_request = 1
[L1486] ret = __VERIFIER_nondet_int()
[L1487] COND TRUE blastFlag == 7
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=9, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
[L1757] reach_error()
VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=9, s={-2147483642:0}, s={-2147483642:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.1s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 843 SdHoareTripleChecker+Valid, 30.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 843 mSDsluCounter, 3999 SdHoareTripleChecker+Invalid, 29.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 40 IncrementalHoareTripleChecker+Unchecked, 1789 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 454 IncrementalHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 2210 mSDtfsCounter, 454 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 638 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=906occurred in iteration=7, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 123 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 16.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 771 NumberOfCodeBlocks, 771 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 635 ConstructedInterpolants, 1 QuantifiedInterpolants, 1232 SizeOfPredicates, 11 NumberOfNonLiveVariables, 5501 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 534/534 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 proved your program to be incorrect!
[2022-11-02 20:56:26,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ec1e989-13e1-46ec-8836-d206c4860960/bin/uautomizer-Dbtcem3rbc/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
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE