./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX --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 e3e7c439a8bb023cdb2d5bca3cc1f30b1cca1673759440246e0abb092be693fe --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 10:50:57,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 10:50:57,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 10:50:57,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 10:50:57,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 10:50:57,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 10:50:57,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 10:50:57,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 10:50:57,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 10:50:57,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 10:50:57,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 10:50:57,563 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 10:50:57,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 10:50:57,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 10:50:57,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 10:50:57,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 10:50:57,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 10:50:57,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 10:50:57,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 10:50:57,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 10:50:57,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 10:50:57,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 10:50:57,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 10:50:57,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 10:50:57,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 10:50:57,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 10:50:57,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 10:50:57,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 10:50:57,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 10:50:57,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 10:50:57,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 10:50:57,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 10:50:57,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 10:50:57,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 10:50:57,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 10:50:57,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 10:50:57,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 10:50:57,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 10:50:57,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 10:50:57,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 10:50:57,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 10:50:57,643 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-09 10:50:57,705 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 10:50:57,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 10:50:57,706 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 10:50:57,707 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 10:50:57,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 10:50:57,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 10:50:57,710 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 10:50:57,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 10:50:57,711 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 10:50:57,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 10:50:57,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 10:50:57,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 10:50:57,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 10:50:57,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 10:50:57,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 10:50:57,714 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 10:50:57,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 10:50:57,715 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 10:50:57,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 10:50:57,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 10:50:57,716 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 10:50:57,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 10:50:57,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 10:50:57,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 10:50:57,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 10:50:57,717 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 10:50:57,718 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 10:50:57,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 10:50:57,718 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 10:50:57,720 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 10:50:57,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 10:50:57,721 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 10:50:57,721 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_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/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_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX 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 -> e3e7c439a8bb023cdb2d5bca3cc1f30b1cca1673759440246e0abb092be693fe [2021-11-09 10:50:58,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 10:50:58,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 10:50:58,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 10:50:58,097 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 10:50:58,098 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 10:50:58,099 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2021-11-09 10:50:58,173 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/data/fd2b0bcf8/3336eb060fe94f868873cae1bec23141/FLAG29460c33b [2021-11-09 10:50:58,809 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 10:50:58,810 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2021-11-09 10:50:58,844 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/data/fd2b0bcf8/3336eb060fe94f868873cae1bec23141/FLAG29460c33b [2021-11-09 10:50:59,128 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/data/fd2b0bcf8/3336eb060fe94f868873cae1bec23141 [2021-11-09 10:50:59,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 10:50:59,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 10:50:59,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 10:50:59,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 10:50:59,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 10:50:59,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:50:59" (1/1) ... [2021-11-09 10:50:59,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d12286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:59, skipping insertion in model container [2021-11-09 10:50:59,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:50:59" (1/1) ... [2021-11-09 10:50:59,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 10:50:59,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 10:50:59,583 WARN L228 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_5d10615d-c0f7-4098-8621-da60cad79b2e/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c[42848,42861] [2021-11-09 10:50:59,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 10:50:59,610 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 10:50:59,722 WARN L228 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_5d10615d-c0f7-4098-8621-da60cad79b2e/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c[42848,42861] [2021-11-09 10:50:59,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 10:50:59,754 INFO L208 MainTranslator]: Completed translation [2021-11-09 10:50:59,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:59 WrapperNode [2021-11-09 10:50:59,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 10:50:59,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 10:50:59,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 10:50:59,758 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 10:50:59,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:59" (1/1) ... [2021-11-09 10:50:59,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:59" (1/1) ... [2021-11-09 10:50:59,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 10:50:59,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 10:50:59,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 10:50:59,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 10:50:59,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:59" (1/1) ... [2021-11-09 10:50:59,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:59" (1/1) ... [2021-11-09 10:50:59,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:59" (1/1) ... [2021-11-09 10:50:59,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:59" (1/1) ... [2021-11-09 10:50:59,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:59" (1/1) ... [2021-11-09 10:50:59,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:59" (1/1) ... [2021-11-09 10:50:59,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:59" (1/1) ... [2021-11-09 10:50:59,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 10:50:59,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 10:50:59,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 10:50:59,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 10:50:59,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:59" (1/1) ... [2021-11-09 10:50:59,944 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 10:50:59,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:50:59,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 10:50:59,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 10:51:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 10:51:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 10:51:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 10:51:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 10:51:00,170 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 10:51:00,894 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-11-09 10:51:00,895 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-11-09 10:51:00,910 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 10:51:00,911 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-11-09 10:51:00,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:51:00 BoogieIcfgContainer [2021-11-09 10:51:00,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 10:51:00,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 10:51:00,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 10:51:00,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 10:51:00,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:50:59" (1/3) ... [2021-11-09 10:51:00,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c72543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:51:00, skipping insertion in model container [2021-11-09 10:51:00,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:59" (2/3) ... [2021-11-09 10:51:00,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c72543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:51:00, skipping insertion in model container [2021-11-09 10:51:00,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:51:00" (3/3) ... [2021-11-09 10:51:00,927 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2021-11-09 10:51:00,934 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 10:51:00,935 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-09 10:51:01,003 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 10:51:01,012 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-09 10:51:01,012 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-09 10:51:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 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) [2021-11-09 10:51:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-09 10:51:01,048 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:01,049 INFO L513 BasicCegarLoop]: 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] [2021-11-09 10:51:01,050 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:01,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:01,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1632005994, now seen corresponding path program 1 times [2021-11-09 10:51:01,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:01,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971260794] [2021-11-09 10:51:01,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:01,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:51:01,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:01,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971260794] [2021-11-09 10:51:01,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971260794] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:01,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:01,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:01,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112828765] [2021-11-09 10:51:01,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:01,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:01,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:01,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:01,532 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 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 14.666666666666666) internal successors, (44), 3 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) [2021-11-09 10:51:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:02,035 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2021-11-09 10:51:02,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:02,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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 [2021-11-09 10:51:02,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:02,053 INFO L225 Difference]: With dead ends: 328 [2021-11-09 10:51:02,053 INFO L226 Difference]: Without dead ends: 175 [2021-11-09 10:51:02,057 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:02,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-09 10:51:02,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2021-11-09 10:51:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.6272189349112427) internal successors, (275), 169 states have internal predecessors, (275), 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) [2021-11-09 10:51:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2021-11-09 10:51:02,131 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2021-11-09 10:51:02,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:02,132 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2021-11-09 10:51:02,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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) [2021-11-09 10:51:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2021-11-09 10:51:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-09 10:51:02,137 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:02,137 INFO L513 BasicCegarLoop]: 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, 1] [2021-11-09 10:51:02,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 10:51:02,138 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:02,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:02,139 INFO L85 PathProgramCache]: Analyzing trace with hash -954576436, now seen corresponding path program 1 times [2021-11-09 10:51:02,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:02,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055570629] [2021-11-09 10:51:02,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:02,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:51:02,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:02,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055570629] [2021-11-09 10:51:02,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055570629] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:02,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:02,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:02,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453893517] [2021-11-09 10:51:02,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:02,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:02,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:02,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:02,236 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2021-11-09 10:51:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:02,496 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2021-11-09 10:51:02,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:02,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 45 [2021-11-09 10:51:02,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:02,505 INFO L225 Difference]: With dead ends: 380 [2021-11-09 10:51:02,505 INFO L226 Difference]: Without dead ends: 216 [2021-11-09 10:51:02,511 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-09 10:51:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2021-11-09 10:51:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.6761904761904762) internal successors, (352), 210 states have internal predecessors, (352), 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) [2021-11-09 10:51:02,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2021-11-09 10:51:02,554 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2021-11-09 10:51:02,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:02,554 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2021-11-09 10:51:02,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2021-11-09 10:51:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2021-11-09 10:51:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-09 10:51:02,559 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:02,560 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2021-11-09 10:51:02,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 10:51:02,561 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:02,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1754997851, now seen corresponding path program 1 times [2021-11-09 10:51:02,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:02,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757349356] [2021-11-09 10:51:02,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:02,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:51:02,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:02,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757349356] [2021-11-09 10:51:02,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757349356] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:02,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:02,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:02,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653598371] [2021-11-09 10:51:02,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:02,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:02,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:02,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:02,681 INFO L87 Difference]: Start difference. First operand 211 states and 352 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) [2021-11-09 10:51:02,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:02,930 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2021-11-09 10:51:02,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:02,931 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 72 [2021-11-09 10:51:02,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:02,934 INFO L225 Difference]: With dead ends: 445 [2021-11-09 10:51:02,934 INFO L226 Difference]: Without dead ends: 242 [2021-11-09 10:51:02,936 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-09 10:51:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-11-09 10:51:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.6929460580912863) internal successors, (408), 241 states have internal predecessors, (408), 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) [2021-11-09 10:51:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2021-11-09 10:51:02,970 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2021-11-09 10:51:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:02,977 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2021-11-09 10:51:02,977 INFO L471 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) [2021-11-09 10:51:02,977 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2021-11-09 10:51:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-09 10:51:02,988 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:02,989 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-09 10:51:02,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-09 10:51:02,989 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:02,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:02,990 INFO L85 PathProgramCache]: Analyzing trace with hash -479038981, now seen corresponding path program 1 times [2021-11-09 10:51:02,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:02,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765268221] [2021-11-09 10:51:02,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:02,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-09 10:51:03,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:03,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765268221] [2021-11-09 10:51:03,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765268221] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:03,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:03,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:03,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417533331] [2021-11-09 10:51:03,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:03,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:03,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:03,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:03,156 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 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) [2021-11-09 10:51:03,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:03,325 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2021-11-09 10:51:03,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:03,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 [2021-11-09 10:51:03,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:03,329 INFO L225 Difference]: With dead ends: 493 [2021-11-09 10:51:03,329 INFO L226 Difference]: Without dead ends: 259 [2021-11-09 10:51:03,332 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-11-09 10:51:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2021-11-09 10:51:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.68359375) internal successors, (431), 256 states have internal predecessors, (431), 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) [2021-11-09 10:51:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2021-11-09 10:51:03,355 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2021-11-09 10:51:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:03,356 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2021-11-09 10:51:03,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 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) [2021-11-09 10:51:03,357 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2021-11-09 10:51:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-09 10:51:03,360 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:03,360 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-09 10:51:03,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-09 10:51:03,361 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:03,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:03,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1816808322, now seen corresponding path program 1 times [2021-11-09 10:51:03,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:03,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212708776] [2021-11-09 10:51:03,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:03,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:51:03,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:03,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212708776] [2021-11-09 10:51:03,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212708776] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:03,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:03,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:03,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887555025] [2021-11-09 10:51:03,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:03,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:03,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:03,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:03,451 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2021-11-09 10:51:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:03,669 INFO L93 Difference]: Finished difference Result 553 states and 933 transitions. [2021-11-09 10:51:03,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:03,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 [2021-11-09 10:51:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:03,677 INFO L225 Difference]: With dead ends: 553 [2021-11-09 10:51:03,677 INFO L226 Difference]: Without dead ends: 304 [2021-11-09 10:51:03,678 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-11-09 10:51:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 299. [2021-11-09 10:51:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6946308724832215) internal successors, (505), 298 states have internal predecessors, (505), 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) [2021-11-09 10:51:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2021-11-09 10:51:03,697 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2021-11-09 10:51:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:03,697 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2021-11-09 10:51:03,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2021-11-09 10:51:03,698 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2021-11-09 10:51:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-09 10:51:03,701 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:03,701 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-09 10:51:03,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-09 10:51:03,702 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:03,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1697148062, now seen corresponding path program 1 times [2021-11-09 10:51:03,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:03,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326773830] [2021-11-09 10:51:03,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:03,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-09 10:51:03,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:03,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326773830] [2021-11-09 10:51:03,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326773830] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:03,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:03,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:03,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188960538] [2021-11-09 10:51:03,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:03,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:03,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:03,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:03,776 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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) [2021-11-09 10:51:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:03,940 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2021-11-09 10:51:03,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:03,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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 85 [2021-11-09 10:51:03,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:03,953 INFO L225 Difference]: With dead ends: 592 [2021-11-09 10:51:03,953 INFO L226 Difference]: Without dead ends: 301 [2021-11-09 10:51:03,954 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:03,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-09 10:51:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2021-11-09 10:51:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6812080536912752) internal successors, (501), 298 states have internal predecessors, (501), 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) [2021-11-09 10:51:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2021-11-09 10:51:03,972 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2021-11-09 10:51:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:03,972 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2021-11-09 10:51:03,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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) [2021-11-09 10:51:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2021-11-09 10:51:03,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-09 10:51:03,981 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:03,982 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-09 10:51:03,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-09 10:51:03,982 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:03,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:03,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1432172412, now seen corresponding path program 1 times [2021-11-09 10:51:03,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:03,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951894323] [2021-11-09 10:51:03,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:03,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:51:04,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:04,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951894323] [2021-11-09 10:51:04,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951894323] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:04,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:04,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:04,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069507945] [2021-11-09 10:51:04,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:04,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:04,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:04,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:04,121 INFO L87 Difference]: Start difference. First operand 299 states and 501 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2021-11-09 10:51:04,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:04,293 INFO L93 Difference]: Finished difference Result 595 states and 997 transitions. [2021-11-09 10:51:04,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:04,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 85 [2021-11-09 10:51:04,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:04,296 INFO L225 Difference]: With dead ends: 595 [2021-11-09 10:51:04,297 INFO L226 Difference]: Without dead ends: 302 [2021-11-09 10:51:04,298 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-11-09 10:51:04,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2021-11-09 10:51:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.6756756756756757) internal successors, (496), 296 states have internal predecessors, (496), 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) [2021-11-09 10:51:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2021-11-09 10:51:04,313 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2021-11-09 10:51:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:04,314 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2021-11-09 10:51:04,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2021-11-09 10:51:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2021-11-09 10:51:04,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-09 10:51:04,316 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:04,316 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-11-09 10:51:04,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-09 10:51:04,318 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:04,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:04,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1085183485, now seen corresponding path program 1 times [2021-11-09 10:51:04,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:04,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332591176] [2021-11-09 10:51:04,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:04,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-09 10:51:04,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:04,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332591176] [2021-11-09 10:51:04,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332591176] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:04,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:04,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:04,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610359112] [2021-11-09 10:51:04,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:04,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:04,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:04,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:04,406 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2021-11-09 10:51:04,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:04,522 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2021-11-09 10:51:04,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:04,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 [2021-11-09 10:51:04,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:04,526 INFO L225 Difference]: With dead ends: 595 [2021-11-09 10:51:04,526 INFO L226 Difference]: Without dead ends: 306 [2021-11-09 10:51:04,527 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:04,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-11-09 10:51:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-11-09 10:51:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.6459016393442623) internal successors, (502), 305 states have internal predecessors, (502), 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) [2021-11-09 10:51:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2021-11-09 10:51:04,547 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2021-11-09 10:51:04,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:04,547 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2021-11-09 10:51:04,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2021-11-09 10:51:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2021-11-09 10:51:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-09 10:51:04,550 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:04,550 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-09 10:51:04,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-09 10:51:04,551 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:04,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:04,551 INFO L85 PathProgramCache]: Analyzing trace with hash -860132162, now seen corresponding path program 1 times [2021-11-09 10:51:04,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:04,552 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120292228] [2021-11-09 10:51:04,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:04,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-09 10:51:04,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:04,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120292228] [2021-11-09 10:51:04,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120292228] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:04,624 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:04,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:04,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378519549] [2021-11-09 10:51:04,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:04,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:04,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:04,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:04,627 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2021-11-09 10:51:04,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:04,800 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2021-11-09 10:51:04,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:04,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 [2021-11-09 10:51:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:04,806 INFO L225 Difference]: With dead ends: 635 [2021-11-09 10:51:04,806 INFO L226 Difference]: Without dead ends: 337 [2021-11-09 10:51:04,811 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-11-09 10:51:04,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-11-09 10:51:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6437125748502994) internal successors, (549), 334 states have internal predecessors, (549), 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) [2021-11-09 10:51:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2021-11-09 10:51:04,830 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2021-11-09 10:51:04,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:04,831 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2021-11-09 10:51:04,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2021-11-09 10:51:04,831 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2021-11-09 10:51:04,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-09 10:51:04,833 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:04,834 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-09 10:51:04,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-09 10:51:04,834 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:04,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:04,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1120928325, now seen corresponding path program 1 times [2021-11-09 10:51:04,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:04,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757674348] [2021-11-09 10:51:04,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:04,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-09 10:51:04,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:04,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757674348] [2021-11-09 10:51:04,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757674348] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:04,917 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:04,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:04,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975566554] [2021-11-09 10:51:04,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:04,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:04,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:04,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:04,920 INFO L87 Difference]: Start difference. First operand 335 states and 549 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) [2021-11-09 10:51:05,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:05,113 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2021-11-09 10:51:05,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:05,113 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 99 [2021-11-09 10:51:05,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:05,117 INFO L225 Difference]: With dead ends: 664 [2021-11-09 10:51:05,117 INFO L226 Difference]: Without dead ends: 337 [2021-11-09 10:51:05,118 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:05,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-11-09 10:51:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-11-09 10:51:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6317365269461077) internal successors, (545), 334 states have internal predecessors, (545), 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) [2021-11-09 10:51:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2021-11-09 10:51:05,141 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2021-11-09 10:51:05,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:05,143 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2021-11-09 10:51:05,143 INFO L471 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) [2021-11-09 10:51:05,144 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2021-11-09 10:51:05,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-09 10:51:05,146 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:05,146 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-09 10:51:05,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-09 10:51:05,147 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:05,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:05,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1084775058, now seen corresponding path program 1 times [2021-11-09 10:51:05,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:05,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754384481] [2021-11-09 10:51:05,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:05,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-09 10:51:05,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:05,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754384481] [2021-11-09 10:51:05,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754384481] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:05,224 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:05,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:05,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812046942] [2021-11-09 10:51:05,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:05,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:05,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:05,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:05,234 INFO L87 Difference]: Start difference. First operand 335 states and 545 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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) [2021-11-09 10:51:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:05,411 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2021-11-09 10:51:05,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:05,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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 100 [2021-11-09 10:51:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:05,415 INFO L225 Difference]: With dead ends: 697 [2021-11-09 10:51:05,415 INFO L226 Difference]: Without dead ends: 370 [2021-11-09 10:51:05,416 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-11-09 10:51:05,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-11-09 10:51:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.626038781163435) internal successors, (587), 361 states have internal predecessors, (587), 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) [2021-11-09 10:51:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2021-11-09 10:51:05,435 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2021-11-09 10:51:05,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:05,435 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2021-11-09 10:51:05,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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) [2021-11-09 10:51:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2021-11-09 10:51:05,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-09 10:51:05,438 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:05,438 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-09 10:51:05,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-09 10:51:05,439 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:05,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:05,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1691577195, now seen corresponding path program 1 times [2021-11-09 10:51:05,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:05,440 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281329168] [2021-11-09 10:51:05,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:05,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-09 10:51:05,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:05,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281329168] [2021-11-09 10:51:05,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281329168] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:05,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:05,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:05,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785397210] [2021-11-09 10:51:05,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:05,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:05,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:05,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:05,483 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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) [2021-11-09 10:51:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:05,661 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2021-11-09 10:51:05,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:05,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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 101 [2021-11-09 10:51:05,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:05,669 INFO L225 Difference]: With dead ends: 724 [2021-11-09 10:51:05,669 INFO L226 Difference]: Without dead ends: 370 [2021-11-09 10:51:05,670 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-11-09 10:51:05,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-11-09 10:51:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.6121883656509695) internal successors, (582), 361 states have internal predecessors, (582), 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) [2021-11-09 10:51:05,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2021-11-09 10:51:05,689 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2021-11-09 10:51:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:05,690 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2021-11-09 10:51:05,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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) [2021-11-09 10:51:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2021-11-09 10:51:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-09 10:51:05,692 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:05,692 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2021-11-09 10:51:05,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-09 10:51:05,693 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:05,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:05,694 INFO L85 PathProgramCache]: Analyzing trace with hash -479008336, now seen corresponding path program 1 times [2021-11-09 10:51:05,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:05,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103391597] [2021-11-09 10:51:05,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:05,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-09 10:51:05,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:05,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103391597] [2021-11-09 10:51:05,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103391597] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:05,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:05,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:05,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472200622] [2021-11-09 10:51:05,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:05,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:05,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:05,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:05,754 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) [2021-11-09 10:51:05,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:05,927 INFO L93 Difference]: Finished difference Result 741 states and 1193 transitions. [2021-11-09 10:51:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:05,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 [2021-11-09 10:51:05,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:05,931 INFO L225 Difference]: With dead ends: 741 [2021-11-09 10:51:05,931 INFO L226 Difference]: Without dead ends: 387 [2021-11-09 10:51:05,932 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-11-09 10:51:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2021-11-09 10:51:05,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5994764397905759) internal successors, (611), 382 states have internal predecessors, (611), 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) [2021-11-09 10:51:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2021-11-09 10:51:05,952 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2021-11-09 10:51:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:05,952 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2021-11-09 10:51:05,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) [2021-11-09 10:51:05,953 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2021-11-09 10:51:05,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-09 10:51:05,955 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:05,955 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2021-11-09 10:51:05,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-09 10:51:05,956 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:05,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:05,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2118869193, now seen corresponding path program 1 times [2021-11-09 10:51:05,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:05,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393044662] [2021-11-09 10:51:05,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:05,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-09 10:51:06,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:06,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393044662] [2021-11-09 10:51:06,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393044662] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:06,004 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:06,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:06,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643391984] [2021-11-09 10:51:06,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:06,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:06,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:06,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:06,007 INFO L87 Difference]: Start difference. First operand 383 states and 611 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) [2021-11-09 10:51:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:06,154 INFO L93 Difference]: Finished difference Result 762 states and 1216 transitions. [2021-11-09 10:51:06,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:06,154 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 [2021-11-09 10:51:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:06,158 INFO L225 Difference]: With dead ends: 762 [2021-11-09 10:51:06,158 INFO L226 Difference]: Without dead ends: 387 [2021-11-09 10:51:06,160 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-11-09 10:51:06,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2021-11-09 10:51:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5837696335078535) internal successors, (605), 382 states have internal predecessors, (605), 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) [2021-11-09 10:51:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2021-11-09 10:51:06,180 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2021-11-09 10:51:06,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:06,180 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2021-11-09 10:51:06,180 INFO L471 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) [2021-11-09 10:51:06,181 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2021-11-09 10:51:06,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-09 10:51:06,183 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:06,183 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 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] [2021-11-09 10:51:06,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-09 10:51:06,184 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:06,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:06,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1932137040, now seen corresponding path program 1 times [2021-11-09 10:51:06,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:06,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497777913] [2021-11-09 10:51:06,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:06,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-11-09 10:51:06,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:06,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497777913] [2021-11-09 10:51:06,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497777913] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:06,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:06,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:06,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277329119] [2021-11-09 10:51:06,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:06,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:06,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:06,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:06,259 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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) [2021-11-09 10:51:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:06,316 INFO L93 Difference]: Finished difference Result 758 states and 1198 transitions. [2021-11-09 10:51:06,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:06,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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 121 [2021-11-09 10:51:06,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:06,323 INFO L225 Difference]: With dead ends: 758 [2021-11-09 10:51:06,323 INFO L226 Difference]: Without dead ends: 756 [2021-11-09 10:51:06,326 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2021-11-09 10:51:06,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2021-11-09 10:51:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.5841059602649006) internal successors, (1196), 755 states have internal predecessors, (1196), 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) [2021-11-09 10:51:06,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1196 transitions. [2021-11-09 10:51:06,372 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1196 transitions. Word has length 121 [2021-11-09 10:51:06,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:06,373 INFO L470 AbstractCegarLoop]: Abstraction has 756 states and 1196 transitions. [2021-11-09 10:51:06,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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) [2021-11-09 10:51:06,373 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1196 transitions. [2021-11-09 10:51:06,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-11-09 10:51:06,376 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:06,377 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 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] [2021-11-09 10:51:06,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-09 10:51:06,377 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:06,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:06,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1552830339, now seen corresponding path program 1 times [2021-11-09 10:51:06,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:06,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577171849] [2021-11-09 10:51:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:06,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:06,443 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 10:51:06,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:06,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577171849] [2021-11-09 10:51:06,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577171849] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:06,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:06,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:06,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429509580] [2021-11-09 10:51:06,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:06,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:06,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:06,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:06,449 INFO L87 Difference]: Start difference. First operand 756 states and 1196 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) [2021-11-09 10:51:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:06,521 INFO L93 Difference]: Finished difference Result 1832 states and 2900 transitions. [2021-11-09 10:51:06,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:06,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 122 [2021-11-09 10:51:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:06,530 INFO L225 Difference]: With dead ends: 1832 [2021-11-09 10:51:06,530 INFO L226 Difference]: Without dead ends: 1084 [2021-11-09 10:51:06,532 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:06,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2021-11-09 10:51:06,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2021-11-09 10:51:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 1.5817174515235457) internal successors, (1713), 1083 states have internal predecessors, (1713), 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) [2021-11-09 10:51:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1713 transitions. [2021-11-09 10:51:06,605 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1713 transitions. Word has length 122 [2021-11-09 10:51:06,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:06,606 INFO L470 AbstractCegarLoop]: Abstraction has 1084 states and 1713 transitions. [2021-11-09 10:51:06,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) [2021-11-09 10:51:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1713 transitions. [2021-11-09 10:51:06,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-11-09 10:51:06,609 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:06,610 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 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] [2021-11-09 10:51:06,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-09 10:51:06,610 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:06,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:06,611 INFO L85 PathProgramCache]: Analyzing trace with hash 323652479, now seen corresponding path program 1 times [2021-11-09 10:51:06,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:06,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588927147] [2021-11-09 10:51:06,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:06,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-09 10:51:06,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:06,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588927147] [2021-11-09 10:51:06,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588927147] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:06,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:06,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:06,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882304635] [2021-11-09 10:51:06,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:06,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:06,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:06,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:06,664 INFO L87 Difference]: Start difference. First operand 1084 states and 1713 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) [2021-11-09 10:51:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:06,754 INFO L93 Difference]: Finished difference Result 2529 states and 4000 transitions. [2021-11-09 10:51:06,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:06,755 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 122 [2021-11-09 10:51:06,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:06,766 INFO L225 Difference]: With dead ends: 2529 [2021-11-09 10:51:06,766 INFO L226 Difference]: Without dead ends: 1453 [2021-11-09 10:51:06,772 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2021-11-09 10:51:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2021-11-09 10:51:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1452 states have (on average 1.5805785123966942) internal successors, (2295), 1452 states have internal predecessors, (2295), 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) [2021-11-09 10:51:06,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2295 transitions. [2021-11-09 10:51:06,865 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2295 transitions. Word has length 122 [2021-11-09 10:51:06,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:06,865 INFO L470 AbstractCegarLoop]: Abstraction has 1453 states and 2295 transitions. [2021-11-09 10:51:06,866 INFO L471 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) [2021-11-09 10:51:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2295 transitions. [2021-11-09 10:51:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-11-09 10:51:06,870 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:06,870 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 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] [2021-11-09 10:51:06,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-09 10:51:06,871 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:06,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:06,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1712946493, now seen corresponding path program 1 times [2021-11-09 10:51:06,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:06,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287047069] [2021-11-09 10:51:06,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:06,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-11-09 10:51:06,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:06,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287047069] [2021-11-09 10:51:06,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287047069] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:06,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:06,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:06,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443087604] [2021-11-09 10:51:06,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:06,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:06,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:06,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:06,916 INFO L87 Difference]: Start difference. First operand 1453 states and 2295 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2021-11-09 10:51:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:07,021 INFO L93 Difference]: Finished difference Result 3249 states and 5133 transitions. [2021-11-09 10:51:07,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:07,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 122 [2021-11-09 10:51:07,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:07,035 INFO L225 Difference]: With dead ends: 3249 [2021-11-09 10:51:07,035 INFO L226 Difference]: Without dead ends: 1804 [2021-11-09 10:51:07,038 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:07,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2021-11-09 10:51:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2021-11-09 10:51:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.5784803105934553) internal successors, (2846), 1803 states have internal predecessors, (2846), 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) [2021-11-09 10:51:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2846 transitions. [2021-11-09 10:51:07,172 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2846 transitions. Word has length 122 [2021-11-09 10:51:07,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:07,172 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 2846 transitions. [2021-11-09 10:51:07,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2021-11-09 10:51:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2846 transitions. [2021-11-09 10:51:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-11-09 10:51:07,179 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:07,180 INFO L513 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-09 10:51:07,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-09 10:51:07,181 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:07,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:07,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1532697181, now seen corresponding path program 1 times [2021-11-09 10:51:07,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:07,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886793128] [2021-11-09 10:51:07,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:07,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-11-09 10:51:07,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:07,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886793128] [2021-11-09 10:51:07,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886793128] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:07,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:07,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:07,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098464765] [2021-11-09 10:51:07,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:07,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:07,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:07,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:07,266 INFO L87 Difference]: Start difference. First operand 1804 states and 2846 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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) [2021-11-09 10:51:07,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:07,516 INFO L93 Difference]: Finished difference Result 3650 states and 5740 transitions. [2021-11-09 10:51:07,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:07,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 199 [2021-11-09 10:51:07,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:07,530 INFO L225 Difference]: With dead ends: 3650 [2021-11-09 10:51:07,531 INFO L226 Difference]: Without dead ends: 1854 [2021-11-09 10:51:07,534 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2021-11-09 10:51:07,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1804. [2021-11-09 10:51:07,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.538546866333888) internal successors, (2774), 1803 states have internal predecessors, (2774), 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) [2021-11-09 10:51:07,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2774 transitions. [2021-11-09 10:51:07,650 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2774 transitions. Word has length 199 [2021-11-09 10:51:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:07,651 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 2774 transitions. [2021-11-09 10:51:07,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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) [2021-11-09 10:51:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2774 transitions. [2021-11-09 10:51:07,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-11-09 10:51:07,658 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:07,679 INFO L513 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-09 10:51:07,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-09 10:51:07,680 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:07,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:07,680 INFO L85 PathProgramCache]: Analyzing trace with hash -995291011, now seen corresponding path program 1 times [2021-11-09 10:51:07,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:07,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661476573] [2021-11-09 10:51:07,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:07,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-11-09 10:51:07,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:07,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661476573] [2021-11-09 10:51:07,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661476573] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:07,749 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:07,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:07,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454308934] [2021-11-09 10:51:07,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:07,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:07,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:07,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:07,752 INFO L87 Difference]: Start difference. First operand 1804 states and 2774 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2021-11-09 10:51:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:08,034 INFO L93 Difference]: Finished difference Result 3667 states and 5613 transitions. [2021-11-09 10:51:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:08,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 213 [2021-11-09 10:51:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:08,049 INFO L225 Difference]: With dead ends: 3667 [2021-11-09 10:51:08,050 INFO L226 Difference]: Without dead ends: 1871 [2021-11-09 10:51:08,053 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:08,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2021-11-09 10:51:08,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1804. [2021-11-09 10:51:08,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.4963948973932335) internal successors, (2698), 1803 states have internal predecessors, (2698), 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) [2021-11-09 10:51:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2698 transitions. [2021-11-09 10:51:08,160 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2698 transitions. Word has length 213 [2021-11-09 10:51:08,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:08,161 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 2698 transitions. [2021-11-09 10:51:08,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2021-11-09 10:51:08,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2698 transitions. [2021-11-09 10:51:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-11-09 10:51:08,169 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:08,169 INFO L513 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-09 10:51:08,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-09 10:51:08,170 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:08,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:08,171 INFO L85 PathProgramCache]: Analyzing trace with hash -344869126, now seen corresponding path program 1 times [2021-11-09 10:51:08,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:08,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570168374] [2021-11-09 10:51:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:08,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-11-09 10:51:08,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:08,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570168374] [2021-11-09 10:51:08,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570168374] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:51:08,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958895843] [2021-11-09 10:51:08,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:08,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:51:08,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:51:08,254 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 10:51:08,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-09 10:51:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:08,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-09 10:51:08,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 10:51:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-11-09 10:51:09,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958895843] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:51:09,331 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 10:51:09,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-11-09 10:51:09,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962808872] [2021-11-09 10:51:09,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:51:09,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:09,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:51:09,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:51:09,335 INFO L87 Difference]: Start difference. First operand 1804 states and 2698 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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) [2021-11-09 10:51:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:09,789 INFO L93 Difference]: Finished difference Result 4265 states and 6329 transitions. [2021-11-09 10:51:09,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 10:51:09,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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 232 [2021-11-09 10:51:09,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:09,808 INFO L225 Difference]: With dead ends: 4265 [2021-11-09 10:51:09,809 INFO L226 Difference]: Without dead ends: 2436 [2021-11-09 10:51:09,812 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:51:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2021-11-09 10:51:09,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1604. [2021-11-09 10:51:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1603 states have (on average 1.4734872114784778) internal successors, (2362), 1603 states have internal predecessors, (2362), 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) [2021-11-09 10:51:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2362 transitions. [2021-11-09 10:51:09,954 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2362 transitions. Word has length 232 [2021-11-09 10:51:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:09,955 INFO L470 AbstractCegarLoop]: Abstraction has 1604 states and 2362 transitions. [2021-11-09 10:51:09,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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) [2021-11-09 10:51:09,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2362 transitions. [2021-11-09 10:51:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2021-11-09 10:51:09,962 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:09,963 INFO L513 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-09 10:51:10,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-09 10:51:10,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:51:10,183 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:10,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:10,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1731638989, now seen corresponding path program 1 times [2021-11-09 10:51:10,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:10,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892913529] [2021-11-09 10:51:10,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:10,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:10,266 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2021-11-09 10:51:10,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:10,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892913529] [2021-11-09 10:51:10,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892913529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:10,267 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:10,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:10,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860718006] [2021-11-09 10:51:10,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:10,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:10,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:10,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:10,272 INFO L87 Difference]: Start difference. First operand 1604 states and 2362 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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) [2021-11-09 10:51:10,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:10,510 INFO L93 Difference]: Finished difference Result 3395 states and 5017 transitions. [2021-11-09 10:51:10,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:10,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 241 [2021-11-09 10:51:10,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:10,525 INFO L225 Difference]: With dead ends: 3395 [2021-11-09 10:51:10,525 INFO L226 Difference]: Without dead ends: 1679 [2021-11-09 10:51:10,528 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:10,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2021-11-09 10:51:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2021-11-09 10:51:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1678 states have (on average 1.4463647199046483) internal successors, (2427), 1678 states have internal predecessors, (2427), 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) [2021-11-09 10:51:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2427 transitions. [2021-11-09 10:51:10,627 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2427 transitions. Word has length 241 [2021-11-09 10:51:10,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:10,627 INFO L470 AbstractCegarLoop]: Abstraction has 1679 states and 2427 transitions. [2021-11-09 10:51:10,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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) [2021-11-09 10:51:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2427 transitions. [2021-11-09 10:51:10,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-11-09 10:51:10,634 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:10,635 INFO L513 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-09 10:51:10,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-09 10:51:10,635 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:10,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:10,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1272517136, now seen corresponding path program 1 times [2021-11-09 10:51:10,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:10,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612770448] [2021-11-09 10:51:10,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:10,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-09 10:51:10,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:10,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612770448] [2021-11-09 10:51:10,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612770448] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:51:10,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455408810] [2021-11-09 10:51:10,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:10,707 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:51:10,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:51:10,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 10:51:10,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-09 10:51:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:10,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-09 10:51:11,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 10:51:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-09 10:51:11,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455408810] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:51:11,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 10:51:11,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-11-09 10:51:11,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121550865] [2021-11-09 10:51:11,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:51:11,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:11,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:51:11,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:51:11,633 INFO L87 Difference]: Start difference. First operand 1679 states and 2427 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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) [2021-11-09 10:51:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:12,120 INFO L93 Difference]: Finished difference Result 5320 states and 7733 transitions. [2021-11-09 10:51:12,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 10:51:12,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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 253 [2021-11-09 10:51:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:12,147 INFO L225 Difference]: With dead ends: 5320 [2021-11-09 10:51:12,147 INFO L226 Difference]: Without dead ends: 3649 [2021-11-09 10:51:12,151 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:51:12,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2021-11-09 10:51:12,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 2004. [2021-11-09 10:51:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 2003 states have (on average 1.36245631552671) internal successors, (2729), 2003 states have internal predecessors, (2729), 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) [2021-11-09 10:51:12,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2729 transitions. [2021-11-09 10:51:12,326 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2729 transitions. Word has length 253 [2021-11-09 10:51:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:12,326 INFO L470 AbstractCegarLoop]: Abstraction has 2004 states and 2729 transitions. [2021-11-09 10:51:12,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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) [2021-11-09 10:51:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2729 transitions. [2021-11-09 10:51:12,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-11-09 10:51:12,335 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:12,335 INFO L513 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-09 10:51:12,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-09 10:51:12,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-09 10:51:12,559 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:12,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:12,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1561336526, now seen corresponding path program 1 times [2021-11-09 10:51:12,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:12,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464613029] [2021-11-09 10:51:12,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:12,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-11-09 10:51:12,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:12,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464613029] [2021-11-09 10:51:12,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464613029] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:12,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:12,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:12,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144649210] [2021-11-09 10:51:12,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:12,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:12,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:12,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:12,624 INFO L87 Difference]: Start difference. First operand 2004 states and 2729 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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) [2021-11-09 10:51:12,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:12,797 INFO L93 Difference]: Finished difference Result 5742 states and 7864 transitions. [2021-11-09 10:51:12,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:12,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 253 [2021-11-09 10:51:12,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:12,825 INFO L225 Difference]: With dead ends: 5742 [2021-11-09 10:51:12,825 INFO L226 Difference]: Without dead ends: 3746 [2021-11-09 10:51:12,829 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2021-11-09 10:51:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3744. [2021-11-09 10:51:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 3743 states have (on average 1.371627037135987) internal successors, (5134), 3743 states have internal predecessors, (5134), 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) [2021-11-09 10:51:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 5134 transitions. [2021-11-09 10:51:13,109 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 5134 transitions. Word has length 253 [2021-11-09 10:51:13,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:13,110 INFO L470 AbstractCegarLoop]: Abstraction has 3744 states and 5134 transitions. [2021-11-09 10:51:13,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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) [2021-11-09 10:51:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 5134 transitions. [2021-11-09 10:51:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-11-09 10:51:13,123 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:13,124 INFO L513 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-09 10:51:13,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-09 10:51:13,124 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:13,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:13,125 INFO L85 PathProgramCache]: Analyzing trace with hash -914284920, now seen corresponding path program 1 times [2021-11-09 10:51:13,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:13,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782671120] [2021-11-09 10:51:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:13,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-11-09 10:51:13,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:13,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782671120] [2021-11-09 10:51:13,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782671120] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:13,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:13,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:13,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516979713] [2021-11-09 10:51:13,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:13,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:13,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:13,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:13,193 INFO L87 Difference]: Start difference. First operand 3744 states and 5134 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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) [2021-11-09 10:51:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:13,521 INFO L93 Difference]: Finished difference Result 7698 states and 10554 transitions. [2021-11-09 10:51:13,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:13,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 256 [2021-11-09 10:51:13,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:13,563 INFO L225 Difference]: With dead ends: 7698 [2021-11-09 10:51:13,564 INFO L226 Difference]: Without dead ends: 3962 [2021-11-09 10:51:13,570 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:13,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2021-11-09 10:51:13,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3744. [2021-11-09 10:51:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 3743 states have (on average 1.3438418380977826) internal successors, (5030), 3743 states have internal predecessors, (5030), 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) [2021-11-09 10:51:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 5030 transitions. [2021-11-09 10:51:13,870 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 5030 transitions. Word has length 256 [2021-11-09 10:51:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:13,871 INFO L470 AbstractCegarLoop]: Abstraction has 3744 states and 5030 transitions. [2021-11-09 10:51:13,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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) [2021-11-09 10:51:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 5030 transitions. [2021-11-09 10:51:13,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2021-11-09 10:51:13,884 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:13,885 INFO L513 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2021-11-09 10:51:13,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-09 10:51:13,885 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:13,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:13,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1357789354, now seen corresponding path program 1 times [2021-11-09 10:51:13,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:13,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944476450] [2021-11-09 10:51:13,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:13,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2021-11-09 10:51:13,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:13,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944476450] [2021-11-09 10:51:13,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944476450] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:13,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:13,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:13,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791361581] [2021-11-09 10:51:13,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:13,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:13,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:13,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:13,957 INFO L87 Difference]: Start difference. First operand 3744 states and 5030 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2021-11-09 10:51:14,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:14,311 INFO L93 Difference]: Finished difference Result 7612 states and 10230 transitions. [2021-11-09 10:51:14,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:14,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 290 [2021-11-09 10:51:14,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:14,323 INFO L225 Difference]: With dead ends: 7612 [2021-11-09 10:51:14,323 INFO L226 Difference]: Without dead ends: 3876 [2021-11-09 10:51:14,328 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:14,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3876 states. [2021-11-09 10:51:14,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3876 to 3836. [2021-11-09 10:51:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3836 states, 3835 states have (on average 1.3408083441981746) internal successors, (5142), 3835 states have internal predecessors, (5142), 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) [2021-11-09 10:51:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 5142 transitions. [2021-11-09 10:51:14,531 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 5142 transitions. Word has length 290 [2021-11-09 10:51:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:14,532 INFO L470 AbstractCegarLoop]: Abstraction has 3836 states and 5142 transitions. [2021-11-09 10:51:14,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2021-11-09 10:51:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 5142 transitions. [2021-11-09 10:51:14,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2021-11-09 10:51:14,544 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:14,546 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1] [2021-11-09 10:51:14,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-09 10:51:14,547 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:14,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1702375352, now seen corresponding path program 1 times [2021-11-09 10:51:14,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:14,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733522602] [2021-11-09 10:51:14,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:14,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2021-11-09 10:51:14,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:14,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733522602] [2021-11-09 10:51:14,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733522602] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:14,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:14,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:14,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856037215] [2021-11-09 10:51:14,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:14,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:14,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:14,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:14,609 INFO L87 Difference]: Start difference. First operand 3836 states and 5142 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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) [2021-11-09 10:51:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:14,934 INFO L93 Difference]: Finished difference Result 8044 states and 10852 transitions. [2021-11-09 10:51:14,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:14,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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 311 [2021-11-09 10:51:14,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:14,945 INFO L225 Difference]: With dead ends: 8044 [2021-11-09 10:51:14,946 INFO L226 Difference]: Without dead ends: 4216 [2021-11-09 10:51:14,951 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4216 states. [2021-11-09 10:51:15,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4216 to 4086. [2021-11-09 10:51:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 4085 states have (on average 1.3321909424724603) internal successors, (5442), 4085 states have internal predecessors, (5442), 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) [2021-11-09 10:51:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 5442 transitions. [2021-11-09 10:51:15,165 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 5442 transitions. Word has length 311 [2021-11-09 10:51:15,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:15,165 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 5442 transitions. [2021-11-09 10:51:15,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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) [2021-11-09 10:51:15,167 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 5442 transitions. [2021-11-09 10:51:15,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2021-11-09 10:51:15,181 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:15,181 INFO L513 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1] [2021-11-09 10:51:15,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-09 10:51:15,182 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:15,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:15,183 INFO L85 PathProgramCache]: Analyzing trace with hash 602793911, now seen corresponding path program 1 times [2021-11-09 10:51:15,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:15,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038389221] [2021-11-09 10:51:15,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:15,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:15,277 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2021-11-09 10:51:15,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:15,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038389221] [2021-11-09 10:51:15,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038389221] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:15,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:15,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:15,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434522884] [2021-11-09 10:51:15,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:15,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:15,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:15,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:15,283 INFO L87 Difference]: Start difference. First operand 4086 states and 5442 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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) [2021-11-09 10:51:15,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:15,531 INFO L93 Difference]: Finished difference Result 6855 states and 9019 transitions. [2021-11-09 10:51:15,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:15,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 321 [2021-11-09 10:51:15,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:15,539 INFO L225 Difference]: With dead ends: 6855 [2021-11-09 10:51:15,539 INFO L226 Difference]: Without dead ends: 2133 [2021-11-09 10:51:15,545 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:15,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2021-11-09 10:51:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 2133. [2021-11-09 10:51:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 2132 states have (on average 1.301125703564728) internal successors, (2774), 2132 states have internal predecessors, (2774), 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) [2021-11-09 10:51:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2774 transitions. [2021-11-09 10:51:15,663 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2774 transitions. Word has length 321 [2021-11-09 10:51:15,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:15,664 INFO L470 AbstractCegarLoop]: Abstraction has 2133 states and 2774 transitions. [2021-11-09 10:51:15,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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) [2021-11-09 10:51:15,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2774 transitions. [2021-11-09 10:51:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2021-11-09 10:51:15,675 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:15,677 INFO L513 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:51:15,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-09 10:51:15,678 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:15,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:15,678 INFO L85 PathProgramCache]: Analyzing trace with hash -616309997, now seen corresponding path program 1 times [2021-11-09 10:51:15,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:15,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547737391] [2021-11-09 10:51:15,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:15,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:15,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2021-11-09 10:51:15,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:15,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547737391] [2021-11-09 10:51:15,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547737391] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:15,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:15,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:15,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908625808] [2021-11-09 10:51:15,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:15,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:15,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:15,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:15,767 INFO L87 Difference]: Start difference. First operand 2133 states and 2774 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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) [2021-11-09 10:51:15,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:15,987 INFO L93 Difference]: Finished difference Result 4298 states and 5601 transitions. [2021-11-09 10:51:15,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:15,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 337 [2021-11-09 10:51:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:15,994 INFO L225 Difference]: With dead ends: 4298 [2021-11-09 10:51:15,994 INFO L226 Difference]: Without dead ends: 2173 [2021-11-09 10:51:16,000 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2021-11-09 10:51:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 2133. [2021-11-09 10:51:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 2132 states have (on average 1.2823639774859288) internal successors, (2734), 2132 states have internal predecessors, (2734), 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) [2021-11-09 10:51:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2734 transitions. [2021-11-09 10:51:16,116 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2734 transitions. Word has length 337 [2021-11-09 10:51:16,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:16,117 INFO L470 AbstractCegarLoop]: Abstraction has 2133 states and 2734 transitions. [2021-11-09 10:51:16,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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) [2021-11-09 10:51:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2734 transitions. [2021-11-09 10:51:16,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2021-11-09 10:51:16,128 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:16,128 INFO L513 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:51:16,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-09 10:51:16,129 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:16,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:16,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1063549815, now seen corresponding path program 1 times [2021-11-09 10:51:16,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:16,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501819544] [2021-11-09 10:51:16,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:16,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:16,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2021-11-09 10:51:16,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:16,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501819544] [2021-11-09 10:51:16,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501819544] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:16,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:16,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:16,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555682526] [2021-11-09 10:51:16,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:16,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:16,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:16,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:16,214 INFO L87 Difference]: Start difference. First operand 2133 states and 2734 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2021-11-09 10:51:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:16,418 INFO L93 Difference]: Finished difference Result 4268 states and 5466 transitions. [2021-11-09 10:51:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:16,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 360 [2021-11-09 10:51:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:16,425 INFO L225 Difference]: With dead ends: 4268 [2021-11-09 10:51:16,425 INFO L226 Difference]: Without dead ends: 2143 [2021-11-09 10:51:16,429 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2021-11-09 10:51:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2133. [2021-11-09 10:51:16,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 2132 states have (on average 1.2636022514071295) internal successors, (2694), 2132 states have internal predecessors, (2694), 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) [2021-11-09 10:51:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2694 transitions. [2021-11-09 10:51:16,554 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2694 transitions. Word has length 360 [2021-11-09 10:51:16,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:16,555 INFO L470 AbstractCegarLoop]: Abstraction has 2133 states and 2694 transitions. [2021-11-09 10:51:16,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2021-11-09 10:51:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2694 transitions. [2021-11-09 10:51:16,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2021-11-09 10:51:16,567 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:16,568 INFO L513 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:51:16,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-09 10:51:16,568 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:16,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:16,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2107174257, now seen corresponding path program 1 times [2021-11-09 10:51:16,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:16,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738170143] [2021-11-09 10:51:16,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:16,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2021-11-09 10:51:16,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:16,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738170143] [2021-11-09 10:51:16,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738170143] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:51:16,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555574926] [2021-11-09 10:51:16,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:16,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:51:16,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:51:16,671 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 10:51:16,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-09 10:51:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:17,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-09 10:51:17,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 10:51:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2021-11-09 10:51:18,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555574926] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:18,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-09 10:51:18,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-11-09 10:51:18,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728887044] [2021-11-09 10:51:18,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:18,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:18,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:18,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:51:18,501 INFO L87 Difference]: Start difference. First operand 2133 states and 2694 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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) [2021-11-09 10:51:18,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:18,596 INFO L93 Difference]: Finished difference Result 2711 states and 3448 transitions. [2021-11-09 10:51:18,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:18,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 393 [2021-11-09 10:51:18,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:18,604 INFO L225 Difference]: With dead ends: 2711 [2021-11-09 10:51:18,605 INFO L226 Difference]: Without dead ends: 2573 [2021-11-09 10:51:18,606 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:51:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2021-11-09 10:51:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1997. [2021-11-09 10:51:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1996 states have (on average 1.2725450901803608) internal successors, (2540), 1996 states have internal predecessors, (2540), 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) [2021-11-09 10:51:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2540 transitions. [2021-11-09 10:51:18,710 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2540 transitions. Word has length 393 [2021-11-09 10:51:18,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:18,711 INFO L470 AbstractCegarLoop]: Abstraction has 1997 states and 2540 transitions. [2021-11-09 10:51:18,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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) [2021-11-09 10:51:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2540 transitions. [2021-11-09 10:51:18,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2021-11-09 10:51:18,724 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:18,727 INFO L513 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:51:18,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-09 10:51:18,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:51:18,942 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:18,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:18,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2021892229, now seen corresponding path program 1 times [2021-11-09 10:51:18,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:18,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286102300] [2021-11-09 10:51:18,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:18,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2021-11-09 10:51:19,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:19,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286102300] [2021-11-09 10:51:19,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286102300] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:51:19,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410723730] [2021-11-09 10:51:19,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:19,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:51:19,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:51:19,091 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 10:51:19,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-09 10:51:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:19,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-09 10:51:19,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 10:51:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2021-11-09 10:51:20,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410723730] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:51:20,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 10:51:20,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-11-09 10:51:20,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44719003] [2021-11-09 10:51:20,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:51:20,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:20,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:51:20,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:51:20,833 INFO L87 Difference]: Start difference. First operand 1997 states and 2540 transitions. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2021-11-09 10:51:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:21,224 INFO L93 Difference]: Finished difference Result 5016 states and 6404 transitions. [2021-11-09 10:51:21,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 10:51:21,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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 409 [2021-11-09 10:51:21,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:21,233 INFO L225 Difference]: With dead ends: 5016 [2021-11-09 10:51:21,233 INFO L226 Difference]: Without dead ends: 2985 [2021-11-09 10:51:21,240 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:51:21,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2021-11-09 10:51:21,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2157. [2021-11-09 10:51:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 2156 states have (on average 1.280148423005566) internal successors, (2760), 2156 states have internal predecessors, (2760), 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) [2021-11-09 10:51:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 2760 transitions. [2021-11-09 10:51:21,356 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 2760 transitions. Word has length 409 [2021-11-09 10:51:21,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:21,357 INFO L470 AbstractCegarLoop]: Abstraction has 2157 states and 2760 transitions. [2021-11-09 10:51:21,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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) [2021-11-09 10:51:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 2760 transitions. [2021-11-09 10:51:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2021-11-09 10:51:21,365 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:21,366 INFO L513 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:51:21,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-09 10:51:21,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:51:21,587 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:21,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:21,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1865506571, now seen corresponding path program 1 times [2021-11-09 10:51:21,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:21,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178472707] [2021-11-09 10:51:21,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:21,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2021-11-09 10:51:21,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:21,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178472707] [2021-11-09 10:51:21,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178472707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:21,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:21,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:21,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109173418] [2021-11-09 10:51:21,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:21,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:21,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:21,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:21,714 INFO L87 Difference]: Start difference. First operand 2157 states and 2760 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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) [2021-11-09 10:51:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:21,954 INFO L93 Difference]: Finished difference Result 4486 states and 5763 transitions. [2021-11-09 10:51:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:21,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 471 [2021-11-09 10:51:21,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:21,960 INFO L225 Difference]: With dead ends: 4486 [2021-11-09 10:51:21,961 INFO L226 Difference]: Without dead ends: 2337 [2021-11-09 10:51:21,964 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:21,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2021-11-09 10:51:22,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2327. [2021-11-09 10:51:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2327 states, 2326 states have (on average 1.2704213241616509) internal successors, (2955), 2326 states have internal predecessors, (2955), 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) [2021-11-09 10:51:22,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 2955 transitions. [2021-11-09 10:51:22,077 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 2955 transitions. Word has length 471 [2021-11-09 10:51:22,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:22,077 INFO L470 AbstractCegarLoop]: Abstraction has 2327 states and 2955 transitions. [2021-11-09 10:51:22,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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) [2021-11-09 10:51:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 2955 transitions. [2021-11-09 10:51:22,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2021-11-09 10:51:22,086 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:22,087 INFO L513 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:51:22,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-09 10:51:22,087 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:22,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:22,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1625661125, now seen corresponding path program 1 times [2021-11-09 10:51:22,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:22,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617978644] [2021-11-09 10:51:22,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:22,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2021-11-09 10:51:22,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:22,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617978644] [2021-11-09 10:51:22,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617978644] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:22,218 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:22,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:22,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103127184] [2021-11-09 10:51:22,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:22,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:22,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:22,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:22,221 INFO L87 Difference]: Start difference. First operand 2327 states and 2955 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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) [2021-11-09 10:51:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:22,426 INFO L93 Difference]: Finished difference Result 4641 states and 5888 transitions. [2021-11-09 10:51:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:22,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 533 [2021-11-09 10:51:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:22,433 INFO L225 Difference]: With dead ends: 4641 [2021-11-09 10:51:22,434 INFO L226 Difference]: Without dead ends: 2322 [2021-11-09 10:51:22,437 INFO L786 BasicCegarLoop]: 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 [2021-11-09 10:51:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2021-11-09 10:51:22,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2322. [2021-11-09 10:51:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 2321 states have (on average 1.2429987074536837) internal successors, (2885), 2321 states have internal predecessors, (2885), 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) [2021-11-09 10:51:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 2885 transitions. [2021-11-09 10:51:22,542 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 2885 transitions. Word has length 533 [2021-11-09 10:51:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:22,543 INFO L470 AbstractCegarLoop]: Abstraction has 2322 states and 2885 transitions. [2021-11-09 10:51:22,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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) [2021-11-09 10:51:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 2885 transitions. [2021-11-09 10:51:22,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2021-11-09 10:51:22,552 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:22,553 INFO L513 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:51:22,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-09 10:51:22,554 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:22,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:22,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1600887189, now seen corresponding path program 1 times [2021-11-09 10:51:22,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:22,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149553964] [2021-11-09 10:51:22,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:22,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-11-09 10:51:22,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:22,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149553964] [2021-11-09 10:51:22,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149553964] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:51:22,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091303183] [2021-11-09 10:51:22,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:22,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:51:22,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:51:22,746 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 10:51:22,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-09 10:51:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:23,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-09 10:51:23,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 10:51:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-11-09 10:51:25,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091303183] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:51:25,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 10:51:25,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-11-09 10:51:25,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063588658] [2021-11-09 10:51:25,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:51:25,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:25,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:51:25,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:51:25,254 INFO L87 Difference]: Start difference. First operand 2322 states and 2885 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 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) [2021-11-09 10:51:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:25,556 INFO L93 Difference]: Finished difference Result 3917 states and 4895 transitions. [2021-11-09 10:51:25,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 10:51:25,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 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 599 [2021-11-09 10:51:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:25,558 INFO L225 Difference]: With dead ends: 3917 [2021-11-09 10:51:25,558 INFO L226 Difference]: Without dead ends: 0 [2021-11-09 10:51:25,562 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:51:25,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-09 10:51:25,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-09 10:51:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2021-11-09 10:51:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-09 10:51:25,564 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 599 [2021-11-09 10:51:25,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:25,564 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-09 10:51:25,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 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) [2021-11-09 10:51:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-09 10:51:25,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-09 10:51:25,568 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:51:25,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-09 10:51:25,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-11-09 10:51:25,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-09 10:51:25,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:25,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:25,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:25,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:25,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:26,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:26,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:26,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:26,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:26,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:27,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:51:38,220 INFO L857 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2021-11-09 10:51:38,220 INFO L857 garLoopResultBuilder]: For program point L531-2(lines 531 535) no Hoare annotation was computed. [2021-11-09 10:51:38,220 INFO L857 garLoopResultBuilder]: For program point L399(lines 399 417) no Hoare annotation was computed. [2021-11-09 10:51:38,221 INFO L853 garLoopResultBuilder]: At program point L201(lines 197 562) the Hoare annotation is: (let ((.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse5 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse2 .cse3 .cse4))) [2021-11-09 10:51:38,221 INFO L853 garLoopResultBuilder]: At program point L168(lines 164 573) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse6 .cse7 .cse8))) [2021-11-09 10:51:38,221 INFO L853 garLoopResultBuilder]: At program point L135(lines 134 583) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10))) [2021-11-09 10:51:38,222 INFO L857 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2021-11-09 10:51:38,222 INFO L857 garLoopResultBuilder]: For program point L499(lines 499 502) no Hoare annotation was computed. [2021-11-09 10:51:38,222 INFO L857 garLoopResultBuilder]: For program point L400(lines 400 406) no Hoare annotation was computed. [2021-11-09 10:51:38,222 INFO L860 garLoopResultBuilder]: At program point L632(lines 623 634) the Hoare annotation is: true [2021-11-09 10:51:38,223 INFO L857 garLoopResultBuilder]: For program point L203(lines 203 560) no Hoare annotation was computed. [2021-11-09 10:51:38,223 INFO L857 garLoopResultBuilder]: For program point L170(lines 170 571) no Hoare annotation was computed. [2021-11-09 10:51:38,223 INFO L857 garLoopResultBuilder]: For program point L137(lines 137 582) no Hoare annotation was computed. [2021-11-09 10:51:38,223 INFO L857 garLoopResultBuilder]: For program point L600(lines 600 604) no Hoare annotation was computed. [2021-11-09 10:51:38,223 INFO L857 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2021-11-09 10:51:38,224 INFO L857 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2021-11-09 10:51:38,224 INFO L857 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2021-11-09 10:51:38,224 INFO L857 garLoopResultBuilder]: For program point L237-2(lines 219 553) no Hoare annotation was computed. [2021-11-09 10:51:38,224 INFO L857 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2021-11-09 10:51:38,224 INFO L857 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2021-11-09 10:51:38,225 INFO L857 garLoopResultBuilder]: For program point L437-1(lines 437 445) no Hoare annotation was computed. [2021-11-09 10:51:38,225 INFO L857 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2021-11-09 10:51:38,225 INFO L857 garLoopResultBuilder]: For program point L206(lines 206 559) no Hoare annotation was computed. [2021-11-09 10:51:38,225 INFO L857 garLoopResultBuilder]: For program point L173(lines 173 570) no Hoare annotation was computed. [2021-11-09 10:51:38,225 INFO L857 garLoopResultBuilder]: For program point L140(lines 140 581) no Hoare annotation was computed. [2021-11-09 10:51:38,226 INFO L857 garLoopResultBuilder]: For program point L504(lines 504 510) no Hoare annotation was computed. [2021-11-09 10:51:38,226 INFO L853 garLoopResultBuilder]: At program point L207(lines 203 560) the Hoare annotation is: (let ((.cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1 .cse3) (and .cse0 .cse1 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse4) (and .cse0 .cse2 .cse1 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) [2021-11-09 10:51:38,226 INFO L853 garLoopResultBuilder]: At program point L174(lines 170 571) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse6 .cse7 .cse8))) [2021-11-09 10:51:38,226 INFO L857 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2021-11-09 10:51:38,227 INFO L857 garLoopResultBuilder]: For program point L341(lines 341 379) no Hoare annotation was computed. [2021-11-09 10:51:38,227 INFO L857 garLoopResultBuilder]: For program point L209(lines 209 558) no Hoare annotation was computed. [2021-11-09 10:51:38,227 INFO L857 garLoopResultBuilder]: For program point L176(lines 176 569) no Hoare annotation was computed. [2021-11-09 10:51:38,227 INFO L857 garLoopResultBuilder]: For program point L143(lines 143 580) no Hoare annotation was computed. [2021-11-09 10:51:38,228 INFO L853 garLoopResultBuilder]: At program point L110-2(lines 110 609) the Hoare annotation is: (let ((.cse10 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse29 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (let ((.cse6 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not .cse27)) (.cse12 (not .cse29)) (.cse4 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse15 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse24 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse23 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse19 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse28 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse16 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse17 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse22 (not .cse10)) (.cse14 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse1 .cse18) (and .cse19 .cse20) (and .cse11 .cse21 .cse22 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse18 .cse14 .cse15) (and .cse24 .cse18 .cse19) (and .cse21 .cse20) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse10 .cse17 .cse25 .cse26) (and .cse4 .cse5 .cse24 .cse6 .cse7 .cse9 .cse0 .cse13 .cse15 .cse25) (and .cse27 .cse10 .cse14) (and .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15) (and .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse28 .cse19) (and .cse10 .cse14 .cse29) (and .cse24 .cse10 .cse18 .cse14) (and .cse1 .cse2 .cse3 .cse18 .cse14) (and .cse0 .cse20) (and .cse0 .cse23) (and .cse4 .cse5 .cse24 .cse7 .cse9 .cse13 .cse15 .cse25 .cse19) (and .cse1 .cse2 .cse22 .cse3 .cse14) (and .cse10 .cse1 .cse2 .cse3 .cse19) (and .cse11 .cse3 .cse19) (and .cse24 .cse0 .cse18) (and .cse23 .cse19) (and .cse21 .cse22 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse25 .cse26) (and .cse28 .cse0) (and .cse16 .cse17 .cse1 .cse22) (and .cse14 .cse20)))) [2021-11-09 10:51:38,228 INFO L857 garLoopResultBuilder]: For program point L507(lines 507 509) no Hoare annotation was computed. [2021-11-09 10:51:38,228 INFO L857 garLoopResultBuilder]: For program point L507-2(lines 219 553) no Hoare annotation was computed. [2021-11-09 10:51:38,229 INFO L853 garLoopResultBuilder]: At program point L408(lines 399 417) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse6 .cse7 .cse8))) [2021-11-09 10:51:38,229 INFO L857 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2021-11-09 10:51:38,229 INFO L853 garLoopResultBuilder]: At program point L177(lines 176 569) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2) (and .cse0 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (not .cse0) (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 .cse2) (and .cse3 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2))) [2021-11-09 10:51:38,229 INFO L853 garLoopResultBuilder]: At program point L144(lines 137 582) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10))) [2021-11-09 10:51:38,230 INFO L857 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2021-11-09 10:51:38,230 INFO L857 garLoopResultBuilder]: For program point L541(lines 541 547) no Hoare annotation was computed. [2021-11-09 10:51:38,230 INFO L857 garLoopResultBuilder]: For program point L541-1(lines 541 547) no Hoare annotation was computed. [2021-11-09 10:51:38,230 INFO L857 garLoopResultBuilder]: For program point L344(lines 344 378) no Hoare annotation was computed. [2021-11-09 10:51:38,230 INFO L857 garLoopResultBuilder]: For program point L344-1(lines 344 378) no Hoare annotation was computed. [2021-11-09 10:51:38,231 INFO L857 garLoopResultBuilder]: For program point L212(lines 212 557) no Hoare annotation was computed. [2021-11-09 10:51:38,231 INFO L857 garLoopResultBuilder]: For program point L179(lines 179 568) no Hoare annotation was computed. [2021-11-09 10:51:38,231 INFO L857 garLoopResultBuilder]: For program point L146(lines 146 579) no Hoare annotation was computed. [2021-11-09 10:51:38,231 INFO L857 garLoopResultBuilder]: For program point L113(lines 113 590) no Hoare annotation was computed. [2021-11-09 10:51:38,231 INFO L857 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2021-11-09 10:51:38,232 INFO L857 garLoopResultBuilder]: For program point L411(lines 411 413) no Hoare annotation was computed. [2021-11-09 10:51:38,232 INFO L857 garLoopResultBuilder]: For program point L345(lines 345 375) no Hoare annotation was computed. [2021-11-09 10:51:38,232 INFO L853 garLoopResultBuilder]: At program point L213(lines 209 558) the Hoare annotation is: (let ((.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse1) (and .cse0 .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse2 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2021-11-09 10:51:38,232 INFO L853 garLoopResultBuilder]: At program point L114(lines 113 590) the Hoare annotation is: false [2021-11-09 10:51:38,233 INFO L860 garLoopResultBuilder]: At program point L610(lines 109 611) the Hoare annotation is: true [2021-11-09 10:51:38,233 INFO L857 garLoopResultBuilder]: For program point L544(lines 544 546) no Hoare annotation was computed. [2021-11-09 10:51:38,233 INFO L857 garLoopResultBuilder]: For program point L215(lines 215 556) no Hoare annotation was computed. [2021-11-09 10:51:38,233 INFO L857 garLoopResultBuilder]: For program point L182(lines 182 567) no Hoare annotation was computed. [2021-11-09 10:51:38,233 INFO L857 garLoopResultBuilder]: For program point L149(lines 149 578) no Hoare annotation was computed. [2021-11-09 10:51:38,234 INFO L857 garLoopResultBuilder]: For program point L116(lines 116 589) no Hoare annotation was computed. [2021-11-09 10:51:38,234 INFO L857 garLoopResultBuilder]: For program point L315(lines 315 322) no Hoare annotation was computed. [2021-11-09 10:51:38,234 INFO L857 garLoopResultBuilder]: For program point L315-2(lines 315 322) no Hoare annotation was computed. [2021-11-09 10:51:38,235 INFO L853 garLoopResultBuilder]: At program point L216(lines 215 556) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-11-09 10:51:38,235 INFO L853 garLoopResultBuilder]: At program point L183(lines 179 568) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10))) [2021-11-09 10:51:38,235 INFO L853 garLoopResultBuilder]: At program point L150(lines 146 579) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-11-09 10:51:38,235 INFO L857 garLoopResultBuilder]: For program point L350(lines 350 373) no Hoare annotation was computed. [2021-11-09 10:51:38,236 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-09 10:51:38,236 INFO L853 garLoopResultBuilder]: At program point L218(lines 217 556) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-11-09 10:51:38,236 INFO L857 garLoopResultBuilder]: For program point L185(lines 185 566) no Hoare annotation was computed. [2021-11-09 10:51:38,236 INFO L857 garLoopResultBuilder]: For program point L152(lines 152 577) no Hoare annotation was computed. [2021-11-09 10:51:38,237 INFO L857 garLoopResultBuilder]: For program point L119(lines 119 588) no Hoare annotation was computed. [2021-11-09 10:51:38,237 INFO L857 garLoopResultBuilder]: For program point L615(lines 615 617) no Hoare annotation was computed. [2021-11-09 10:51:38,237 INFO L857 garLoopResultBuilder]: For program point L615-2(lines 615 617) no Hoare annotation was computed. [2021-11-09 10:51:38,237 INFO L857 garLoopResultBuilder]: For program point L516(lines 516 519) no Hoare annotation was computed. [2021-11-09 10:51:38,237 INFO L857 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2021-11-09 10:51:38,237 INFO L857 garLoopResultBuilder]: For program point L285-2(lines 219 553) no Hoare annotation was computed. [2021-11-09 10:51:38,238 INFO L857 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2021-11-09 10:51:38,238 INFO L857 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2021-11-09 10:51:38,238 INFO L857 garLoopResultBuilder]: For program point L353(lines 353 357) no Hoare annotation was computed. [2021-11-09 10:51:38,238 INFO L857 garLoopResultBuilder]: For program point L353-2(lines 353 357) no Hoare annotation was computed. [2021-11-09 10:51:38,238 INFO L857 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2021-11-09 10:51:38,239 INFO L857 garLoopResultBuilder]: For program point L188(lines 188 565) no Hoare annotation was computed. [2021-11-09 10:51:38,239 INFO L857 garLoopResultBuilder]: For program point L155(lines 155 576) no Hoare annotation was computed. [2021-11-09 10:51:38,239 INFO L857 garLoopResultBuilder]: For program point L122(lines 122 587) no Hoare annotation was computed. [2021-11-09 10:51:38,239 INFO L857 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2021-11-09 10:51:38,239 INFO L857 garLoopResultBuilder]: For program point L387(lines 387 419) no Hoare annotation was computed. [2021-11-09 10:51:38,240 INFO L857 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2021-11-09 10:51:38,240 INFO L853 garLoopResultBuilder]: At program point L222(lines 116 589) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2) (and (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse0 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2))) [2021-11-09 10:51:38,240 INFO L853 garLoopResultBuilder]: At program point L189(lines 185 566) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10))) [2021-11-09 10:51:38,241 INFO L853 garLoopResultBuilder]: At program point L156(lines 152 577) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10))) [2021-11-09 10:51:38,241 INFO L857 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2021-11-09 10:51:38,241 INFO L857 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2021-11-09 10:51:38,241 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-09 10:51:38,241 INFO L860 garLoopResultBuilder]: At program point L620(lines 22 622) the Hoare annotation is: true [2021-11-09 10:51:38,242 INFO L853 garLoopResultBuilder]: At program point L554(lines 110 609) the Hoare annotation is: (let ((.cse10 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (.cse29 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (let ((.cse6 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not .cse27)) (.cse12 (not .cse29)) (.cse4 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse15 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse24 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse23 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse19 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse28 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse16 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse17 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse22 (not .cse10)) (.cse14 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse1 .cse18) (and .cse19 .cse20) (and .cse11 .cse21 .cse22 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse18 .cse14 .cse15) (and .cse24 .cse18 .cse19) (and .cse21 .cse20) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse10 .cse17 .cse25 .cse26) (and .cse4 .cse5 .cse24 .cse6 .cse7 .cse9 .cse0 .cse13 .cse15 .cse25) (and .cse27 .cse10 .cse14) (and .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15) (and .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse28 .cse19) (and .cse10 .cse14 .cse29) (and .cse24 .cse10 .cse18 .cse14) (and .cse1 .cse2 .cse3 .cse18 .cse14) (and .cse0 .cse20) (and .cse0 .cse23) (and .cse4 .cse5 .cse24 .cse7 .cse9 .cse13 .cse15 .cse25 .cse19) (and .cse1 .cse2 .cse22 .cse3 .cse14) (and .cse10 .cse1 .cse2 .cse3 .cse19) (and .cse11 .cse3 .cse19) (and .cse24 .cse0 .cse18) (and .cse23 .cse19) (and .cse21 .cse22 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse25 .cse26) (and .cse28 .cse0) (and .cse16 .cse17 .cse1 .cse22) (and .cse14 .cse20)))) [2021-11-09 10:51:38,242 INFO L857 garLoopResultBuilder]: For program point L191(lines 191 564) no Hoare annotation was computed. [2021-11-09 10:51:38,242 INFO L857 garLoopResultBuilder]: For program point L158(lines 158 575) no Hoare annotation was computed. [2021-11-09 10:51:38,243 INFO L857 garLoopResultBuilder]: For program point L125(lines 125 586) no Hoare annotation was computed. [2021-11-09 10:51:38,243 INFO L857 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2021-11-09 10:51:38,243 INFO L857 garLoopResultBuilder]: For program point L489-2(lines 489 493) no Hoare annotation was computed. [2021-11-09 10:51:38,243 INFO L857 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2021-11-09 10:51:38,243 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-09 10:51:38,243 INFO L857 garLoopResultBuilder]: For program point L524(lines 524 526) no Hoare annotation was computed. [2021-11-09 10:51:38,244 INFO L857 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2021-11-09 10:51:38,244 INFO L857 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2021-11-09 10:51:38,244 INFO L857 garLoopResultBuilder]: For program point L194(lines 194 563) no Hoare annotation was computed. [2021-11-09 10:51:38,244 INFO L857 garLoopResultBuilder]: For program point L161(lines 161 574) no Hoare annotation was computed. [2021-11-09 10:51:38,244 INFO L857 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2021-11-09 10:51:38,245 INFO L857 garLoopResultBuilder]: For program point L128(lines 128 585) no Hoare annotation was computed. [2021-11-09 10:51:38,245 INFO L857 garLoopResultBuilder]: For program point L591(lines 591 607) no Hoare annotation was computed. [2021-11-09 10:51:38,245 INFO L853 garLoopResultBuilder]: At program point L525(lines 83 621) the Hoare annotation is: false [2021-11-09 10:51:38,245 INFO L853 garLoopResultBuilder]: At program point L195(lines 191 564) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2021-11-09 10:51:38,246 INFO L853 garLoopResultBuilder]: At program point L162(lines 158 575) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10))) [2021-11-09 10:51:38,246 INFO L857 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2021-11-09 10:51:38,246 INFO L857 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2021-11-09 10:51:38,246 INFO L857 garLoopResultBuilder]: For program point L592(lines 592 606) no Hoare annotation was computed. [2021-11-09 10:51:38,246 INFO L857 garLoopResultBuilder]: For program point L361(lines 361 369) no Hoare annotation was computed. [2021-11-09 10:51:38,247 INFO L857 garLoopResultBuilder]: For program point L593(lines 593 598) no Hoare annotation was computed. [2021-11-09 10:51:38,247 INFO L857 garLoopResultBuilder]: For program point L527(lines 527 529) no Hoare annotation was computed. [2021-11-09 10:51:38,247 INFO L857 garLoopResultBuilder]: For program point L593-2(lines 592 606) no Hoare annotation was computed. [2021-11-09 10:51:38,247 INFO L853 garLoopResultBuilder]: At program point L362(lines 338 380) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10))) [2021-11-09 10:51:38,247 INFO L857 garLoopResultBuilder]: For program point L197(lines 197 562) no Hoare annotation was computed. [2021-11-09 10:51:38,248 INFO L857 garLoopResultBuilder]: For program point L164(lines 164 573) no Hoare annotation was computed. [2021-11-09 10:51:38,248 INFO L857 garLoopResultBuilder]: For program point L131(lines 131 584) no Hoare annotation was computed. [2021-11-09 10:51:38,248 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-09 10:51:38,248 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2021-11-09 10:51:38,248 INFO L857 garLoopResultBuilder]: For program point L429(lines 429 431) no Hoare annotation was computed. [2021-11-09 10:51:38,249 INFO L853 garLoopResultBuilder]: At program point L396(lines 387 419) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse6 .cse7 .cse8))) [2021-11-09 10:51:38,249 INFO L853 garLoopResultBuilder]: At program point L132(lines 128 585) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-11-09 10:51:38,249 INFO L857 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2021-11-09 10:51:38,249 INFO L857 garLoopResultBuilder]: For program point L364(lines 364 366) no Hoare annotation was computed. [2021-11-09 10:51:38,250 INFO L857 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2021-11-09 10:51:38,250 INFO L857 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2021-11-09 10:51:38,250 INFO L857 garLoopResultBuilder]: For program point L298-2(lines 219 553) no Hoare annotation was computed. [2021-11-09 10:51:38,250 INFO L857 garLoopResultBuilder]: For program point L332(lines 332 336) no Hoare annotation was computed. [2021-11-09 10:51:38,250 INFO L857 garLoopResultBuilder]: For program point L332-2(lines 219 553) no Hoare annotation was computed. [2021-11-09 10:51:38,251 INFO L857 garLoopResultBuilder]: For program point L200(lines 200 561) no Hoare annotation was computed. [2021-11-09 10:51:38,251 INFO L857 garLoopResultBuilder]: For program point L167(lines 167 572) no Hoare annotation was computed. [2021-11-09 10:51:38,251 INFO L857 garLoopResultBuilder]: For program point L134(lines 134 583) no Hoare annotation was computed. [2021-11-09 10:51:38,251 INFO L857 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2021-11-09 10:51:38,251 INFO L857 garLoopResultBuilder]: For program point L101-1(lines 83 621) no Hoare annotation was computed. [2021-11-09 10:51:38,255 INFO L731 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, 1, 1, 1] [2021-11-09 10:51:38,257 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-09 10:51:38,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:51:38 BoogieIcfgContainer [2021-11-09 10:51:38,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-09 10:51:38,315 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 10:51:38,315 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 10:51:38,316 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 10:51:38,316 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:51:00" (3/4) ... [2021-11-09 10:51:38,320 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-09 10:51:38,341 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-11-09 10:51:38,343 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-09 10:51:38,344 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-09 10:51:38,345 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-09 10:51:38,459 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/witness.graphml [2021-11-09 10:51:38,459 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 10:51:38,461 INFO L168 Benchmark]: Toolchain (without parser) took 39326.65 ms. Allocated memory was 98.6 MB in the beginning and 490.7 MB in the end (delta: 392.2 MB). Free memory was 67.8 MB in the beginning and 276.2 MB in the end (delta: -208.4 MB). Peak memory consumption was 183.0 MB. Max. memory is 16.1 GB. [2021-11-09 10:51:38,462 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 98.6 MB. Free memory is still 55.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 10:51:38,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.83 ms. Allocated memory is still 98.6 MB. Free memory was 67.6 MB in the beginning and 70.3 MB in the end (delta: -2.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-09 10:51:38,463 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.94 ms. Allocated memory is still 98.6 MB. Free memory was 70.3 MB in the beginning and 67.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-09 10:51:38,463 INFO L168 Benchmark]: Boogie Preprocessor took 68.62 ms. Allocated memory is still 98.6 MB. Free memory was 67.5 MB in the beginning and 65.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-09 10:51:38,464 INFO L168 Benchmark]: RCFGBuilder took 981.17 ms. Allocated memory was 98.6 MB in the beginning and 130.0 MB in the end (delta: 31.5 MB). Free memory was 65.1 MB in the beginning and 93.9 MB in the end (delta: -28.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 16.1 GB. [2021-11-09 10:51:38,464 INFO L168 Benchmark]: TraceAbstraction took 37398.20 ms. Allocated memory was 130.0 MB in the beginning and 490.7 MB in the end (delta: 360.7 MB). Free memory was 93.3 MB in the beginning and 289.8 MB in the end (delta: -196.6 MB). Peak memory consumption was 294.3 MB. Max. memory is 16.1 GB. [2021-11-09 10:51:38,465 INFO L168 Benchmark]: Witness Printer took 144.32 ms. Allocated memory is still 490.7 MB. Free memory was 289.8 MB in the beginning and 276.2 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-09 10:51:38,467 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.31 ms. Allocated memory is still 98.6 MB. Free memory is still 55.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 620.83 ms. Allocated memory is still 98.6 MB. Free memory was 67.6 MB in the beginning and 70.3 MB in the end (delta: -2.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 104.94 ms. Allocated memory is still 98.6 MB. Free memory was 70.3 MB in the beginning and 67.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 68.62 ms. Allocated memory is still 98.6 MB. Free memory was 67.5 MB in the beginning and 65.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 981.17 ms. Allocated memory was 98.6 MB in the beginning and 130.0 MB in the end (delta: 31.5 MB). Free memory was 65.1 MB in the beginning and 93.9 MB in the end (delta: -28.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 37398.20 ms. Allocated memory was 130.0 MB in the beginning and 490.7 MB in the end (delta: 360.7 MB). Free memory was 93.3 MB in the beginning and 289.8 MB in the end (delta: -196.6 MB). Peak memory consumption was 294.3 MB. Max. memory is 16.1 GB. * Witness Printer took 144.32 ms. Allocated memory is still 490.7 MB. Free memory was 289.8 MB in the beginning and 276.2 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * 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 - PositiveResult [Line: 619]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.2s, OverallIterations: 35, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6694 SDtfs, 4128 SDslu, 3183 SDs, 0 SdLazy, 3455 SolverSat, 958 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1999 GetRequests, 1954 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4086occurred in iteration=27, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 4500 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 241 NumberOfFragments, 3241 HoareAnnotationTreeSize, 28 FomulaSimplifications, 154560 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 28 FomulaSimplificationsInter, 31171 FormulaSimplificationTreeSizeReductionInter, 9.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 9249 NumberOfCodeBlocks, 9249 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 9209 ConstructedInterpolants, 0 QuantifiedInterpolants, 12714 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3115 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 40 InterpolantComputations, 31 PerfectInterpolantSequences, 30536/30750 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(8560 == s__state)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1)) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__state <= 8640) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8672) && s__state <= 8672) && !(s__hit == 0)) && 8640 <= s__state) && 2 == blastFlag) || (((!(s__state == 8672) && blastFlag == 0) && s__state <= 8672) && 8640 <= s__state)) || ((((!(s__state == 8672) && s__state <= 8672) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || ((((!(s__state == 8672) && s__hit == 0) && s__state <= 8672) && 8640 <= s__state) && blastFlag == 1) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(8560 == s__state)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1)) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((blastFlag == 0 && s__state == 8608) || (s__state == 8608 && blastFlag == 1)) || (((s__hit == 0 && s__state == 8608) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((blastFlag == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && s__state == 8528) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state))) || (((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (blastFlag == 1 && s__state <= 3)) || (((s__state <= 8640 && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__state)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && s__state == 8608) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state))) || ((s__state <= 8576 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 1)) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 3)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || ((s__state == 8544 && s__hit == 0) && 2 == blastFlag)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state == 8592) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state))) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state == 8512) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state))) || (s__state == 8592 && blastFlag == 1)) || ((s__hit == 0 && 2 == blastFlag) && 8560 == s__state)) || (((s__state <= 8576 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || ((((s__state <= 8672 && !(s__state == 8657)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || (blastFlag == 0 && s__state <= 3)) || (blastFlag == 0 && s__state == 8608)) || ((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1)) || ((((s__state <= 8672 && !(s__state == 8657)) && !(s__hit == 0)) && 8640 <= s__state) && 2 == blastFlag)) || ((((s__hit == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) && blastFlag == 1)) || ((s__state <= 8640 && 8640 <= s__state) && blastFlag == 1)) || ((s__state <= 8576 && blastFlag == 0) && s__s3__tmp__next_state___0 <= 8576)) || (s__state == 8608 && blastFlag == 1)) || ((((s__s3__tmp__next_state___0 <= 8640 && !(s__hit == 0)) && 8640 <= s__s3__tmp__next_state___0) && 8448 <= s__state) && s__state <= 8448)) || (s__state == 8592 && blastFlag == 0)) || (((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) && !(s__hit == 0))) || (2 == blastFlag && s__state <= 3) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && !(8448 == s__state)) && blastFlag == 1) && s__state <= 8448) || (((blastFlag == 0 && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && s__state <= 8448)) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state)) && s__state <= 8448) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && 8448 <= s__state) && s__state <= 8448)) || (((blastFlag == 0 && s__s3__tmp__next_state___0 <= 8576) && 8448 <= s__state) && s__state <= 8448)) || ((((s__s3__tmp__next_state___0 <= 8640 && !(s__hit == 0)) && 8640 <= s__s3__tmp__next_state___0) && 8448 <= s__state) && s__state <= 8448)) || (((s__s3__tmp__next_state___0 <= 8576 && 8448 <= s__state) && blastFlag == 1) && s__state <= 8448) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(8560 == s__state)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1)) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((8672 <= s__state && blastFlag == 0) && !(12292 == s__state)) || (((8672 <= s__state && blastFlag <= 3) && !(12292 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || ((8672 <= s__state && !(12292 == s__state)) && blastFlag == 1)) || (((8672 <= s__state && blastFlag <= 3) && !(12292 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((((((((((!(8497 == s__state) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state)) || ((((((((((!(8497 == s__state) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && blastFlag == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 623]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || ((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state)) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8480) && s__state <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) || (((((((((!(s__state == 8480) && s__state <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1)) || ((((((((((!(s__state == 8480) && s__state <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((!(s__state == 8672) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8656)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) || (((((!(s__state == 8672) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8656)) && 8640 <= s__state) && blastFlag == 1)) || ((((((!(s__state == 8672) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__state)) || ((((((!(s__state == 8672) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8656)) && !(s__hit == 0)) && 8640 <= s__state) && 2 == blastFlag)) || (((((!(s__state == 8672) && blastFlag == 0) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8656)) && 8640 <= s__state) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && blastFlag == 0) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state)) && 8448 <= s__state) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((blastFlag == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && s__state == 8528) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state))) || (((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (blastFlag == 1 && s__state <= 3)) || (((s__state <= 8640 && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__state)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && s__state == 8608) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state))) || ((s__state <= 8576 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 1)) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 3)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && blastFlag == 0) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state)) || ((s__state == 8544 && s__hit == 0) && 2 == blastFlag)) || (((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state == 8592) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(8448 == s__state))) || ((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state == 8512) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && s__hit == 0) && s__state <= 8640) && !(8560 == s__state)) && !(s__state == 8545)) && 2 == blastFlag) && !(8448 == s__state))) || (s__state == 8592 && blastFlag == 1)) || ((s__hit == 0 && 2 == blastFlag) && 8560 == s__state)) || (((s__state <= 8576 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || ((((s__state <= 8672 && !(s__state == 8657)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || (blastFlag == 0 && s__state <= 3)) || (blastFlag == 0 && s__state == 8608)) || ((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8545)) && !(8448 == s__state)) && 8448 <= s__state) && blastFlag == 1)) || ((((s__state <= 8672 && !(s__state == 8657)) && !(s__hit == 0)) && 8640 <= s__state) && 2 == blastFlag)) || ((((s__hit == 0 && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state) && blastFlag == 1)) || ((s__state <= 8640 && 8640 <= s__state) && blastFlag == 1)) || ((s__state <= 8576 && blastFlag == 0) && s__s3__tmp__next_state___0 <= 8576)) || (s__state == 8608 && blastFlag == 1)) || ((((s__s3__tmp__next_state___0 <= 8640 && !(s__hit == 0)) && 8640 <= s__s3__tmp__next_state___0) && 8448 <= s__state) && s__state <= 8448)) || (s__state == 8592 && blastFlag == 0)) || (((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) && !(s__hit == 0))) || (2 == blastFlag && s__state <= 3) RESULT: Ultimate proved your program to be correct! [2021-11-09 10:51:38,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d10615d-c0f7-4098-8621-da60cad79b2e/bin/uautomizer-IVEQpCNsaX/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 Result: TRUE