./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 08:27:28,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 08:27:28,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 08:27:28,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 08:27:28,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 08:27:28,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 08:27:28,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 08:27:28,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 08:27:28,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 08:27:28,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 08:27:28,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 08:27:28,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 08:27:28,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 08:27:28,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 08:27:28,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 08:27:28,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 08:27:28,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 08:27:28,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 08:27:28,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 08:27:28,423 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 08:27:28,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 08:27:28,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 08:27:28,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 08:27:28,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 08:27:28,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 08:27:28,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 08:27:28,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 08:27:28,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 08:27:28,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 08:27:28,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 08:27:28,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 08:27:28,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 08:27:28,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 08:27:28,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 08:27:28,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 08:27:28,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 08:27:28,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 08:27:28,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 08:27:28,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 08:27:28,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 08:27:28,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 08:27:28,456 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-07 08:27:28,498 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 08:27:28,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 08:27:28,501 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 08:27:28,502 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 08:27:28,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 08:27:28,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 08:27:28,510 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 08:27:28,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 08:27:28,510 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 08:27:28,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 08:27:28,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 08:27:28,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 08:27:28,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 08:27:28,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 08:27:28,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 08:27:28,513 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 08:27:28,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 08:27:28,513 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 08:27:28,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 08:27:28,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 08:27:28,514 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 08:27:28,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 08:27:28,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:27:28,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 08:27:28,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 08:27:28,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 08:27:28,515 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 08:27:28,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 08:27:28,516 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 08:27:28,517 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 08:27:28,518 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 08:27:28,518 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 08:27:28,518 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_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/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_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 [2021-11-07 08:27:28,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 08:27:28,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 08:27:28,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 08:27:28,800 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 08:27:28,801 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 08:27:28,802 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-11-07 08:27:28,891 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/data/79b6eae75/0021cc03eb7542d6b6a8111b497dc187/FLAG7c5d60b94 [2021-11-07 08:27:29,576 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 08:27:29,577 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-11-07 08:27:29,598 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/data/79b6eae75/0021cc03eb7542d6b6a8111b497dc187/FLAG7c5d60b94 [2021-11-07 08:27:29,749 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/data/79b6eae75/0021cc03eb7542d6b6a8111b497dc187 [2021-11-07 08:27:29,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 08:27:29,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 08:27:29,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 08:27:29,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 08:27:29,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 08:27:29,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:27:29" (1/1) ... [2021-11-07 08:27:29,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e4cea59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:29, skipping insertion in model container [2021-11-07 08:27:29,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:27:29" (1/1) ... [2021-11-07 08:27:29,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 08:27:29,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 08:27:30,228 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_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382] [2021-11-07 08:27:30,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:27:30,251 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 08:27:30,371 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_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382] [2021-11-07 08:27:30,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:27:30,404 INFO L208 MainTranslator]: Completed translation [2021-11-07 08:27:30,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:30 WrapperNode [2021-11-07 08:27:30,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 08:27:30,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 08:27:30,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 08:27:30,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 08:27:30,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:30" (1/1) ... [2021-11-07 08:27:30,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:30" (1/1) ... [2021-11-07 08:27:30,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 08:27:30,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 08:27:30,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 08:27:30,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 08:27:30,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:30" (1/1) ... [2021-11-07 08:27:30,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:30" (1/1) ... [2021-11-07 08:27:30,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:30" (1/1) ... [2021-11-07 08:27:30,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:30" (1/1) ... [2021-11-07 08:27:30,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:30" (1/1) ... [2021-11-07 08:27:30,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:30" (1/1) ... [2021-11-07 08:27:30,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:30" (1/1) ... [2021-11-07 08:27:30,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 08:27:30,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 08:27:30,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 08:27:30,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 08:27:30,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:30" (1/1) ... [2021-11-07 08:27:30,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:27:30,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:27:30,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 08:27:30,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 08:27:30,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 08:27:30,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 08:27:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 08:27:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 08:27:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 08:27:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 08:27:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 08:27:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 08:27:30,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 08:27:30,913 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 08:27:32,409 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-11-07 08:27:32,410 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-11-07 08:27:32,420 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 08:27:32,420 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-11-07 08:27:32,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:27:32 BoogieIcfgContainer [2021-11-07 08:27:32,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 08:27:32,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 08:27:32,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 08:27:32,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 08:27:32,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:27:29" (1/3) ... [2021-11-07 08:27:32,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a55e8d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:27:32, skipping insertion in model container [2021-11-07 08:27:32,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:27:30" (2/3) ... [2021-11-07 08:27:32,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a55e8d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:27:32, skipping insertion in model container [2021-11-07 08:27:32,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:27:32" (3/3) ... [2021-11-07 08:27:32,431 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2021-11-07 08:27:32,436 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 08:27:32,436 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 08:27:32,484 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 08:27:32,490 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-07 08:27:32,491 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 08:27:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:27:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 08:27:32,545 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:32,545 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] [2021-11-07 08:27:32,546 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:32,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:32,552 INFO L85 PathProgramCache]: Analyzing trace with hash -442385417, now seen corresponding path program 1 times [2021-11-07 08:27:32,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:32,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550594070] [2021-11-07 08:27:32,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:32,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:32,933 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-07 08:27:32,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:32,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550594070] [2021-11-07 08:27:32,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550594070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:32,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:32,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:32,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823384429] [2021-11-07 08:27:32,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:32,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:32,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:32,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:32,959 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:27:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:35,517 INFO L93 Difference]: Finished difference Result 325 states and 550 transitions. [2021-11-07 08:27:35,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:27:35,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-07 08:27:35,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:35,528 INFO L225 Difference]: With dead ends: 325 [2021-11-07 08:27:35,528 INFO L226 Difference]: Without dead ends: 165 [2021-11-07 08:27:35,530 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:27:35,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-11-07 08:27:35,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2021-11-07 08:27:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.5578231292517006) internal successors, (229), 147 states have internal predecessors, (229), 0 states have call successors, (0), 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-07 08:27:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 229 transitions. [2021-11-07 08:27:35,582 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 229 transitions. Word has length 37 [2021-11-07 08:27:35,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:35,583 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 229 transitions. [2021-11-07 08:27:35,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:27:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 229 transitions. [2021-11-07 08:27:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-07 08:27:35,586 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:35,586 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:35,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 08:27:35,587 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:35,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:35,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1650885502, now seen corresponding path program 1 times [2021-11-07 08:27:35,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:35,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389260966] [2021-11-07 08:27:35,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:35,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:27:35,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:35,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389260966] [2021-11-07 08:27:35,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389260966] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:35,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:35,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:35,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131308623] [2021-11-07 08:27:35,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:35,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:35,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:35,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:35,766 INFO L87 Difference]: Start difference. First operand 148 states and 229 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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-07 08:27:38,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:38,163 INFO L93 Difference]: Finished difference Result 292 states and 446 transitions. [2021-11-07 08:27:38,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:27:38,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2021-11-07 08:27:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:38,167 INFO L225 Difference]: With dead ends: 292 [2021-11-07 08:27:38,167 INFO L226 Difference]: Without dead ends: 165 [2021-11-07 08:27:38,180 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:27:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-11-07 08:27:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2021-11-07 08:27:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.5510204081632653) internal successors, (228), 147 states have internal predecessors, (228), 0 states have call successors, (0), 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-07 08:27:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 228 transitions. [2021-11-07 08:27:38,195 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 228 transitions. Word has length 50 [2021-11-07 08:27:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:38,195 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 228 transitions. [2021-11-07 08:27:38,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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-07 08:27:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 228 transitions. [2021-11-07 08:27:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-07 08:27:38,198 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:38,199 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:38,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 08:27:38,199 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:38,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:38,200 INFO L85 PathProgramCache]: Analyzing trace with hash -24642669, now seen corresponding path program 1 times [2021-11-07 08:27:38,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:38,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838360463] [2021-11-07 08:27:38,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:38,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:27:38,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:38,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838360463] [2021-11-07 08:27:38,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838360463] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:38,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:38,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:38,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697533400] [2021-11-07 08:27:38,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:38,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:38,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:38,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:38,310 INFO L87 Difference]: Start difference. First operand 148 states and 228 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-07 08:27:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:40,787 INFO L93 Difference]: Finished difference Result 291 states and 444 transitions. [2021-11-07 08:27:40,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:27:40,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-07 08:27:40,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:40,790 INFO L225 Difference]: With dead ends: 291 [2021-11-07 08:27:40,790 INFO L226 Difference]: Without dead ends: 164 [2021-11-07 08:27:40,791 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:27:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-07 08:27:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2021-11-07 08:27:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.5442176870748299) internal successors, (227), 147 states have internal predecessors, (227), 0 states have call successors, (0), 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-07 08:27:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 227 transitions. [2021-11-07 08:27:40,823 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 227 transitions. Word has length 51 [2021-11-07 08:27:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:40,824 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 227 transitions. [2021-11-07 08:27:40,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-07 08:27:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 227 transitions. [2021-11-07 08:27:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-07 08:27:40,827 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:40,827 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:40,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 08:27:40,827 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:40,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:40,828 INFO L85 PathProgramCache]: Analyzing trace with hash 840936487, now seen corresponding path program 1 times [2021-11-07 08:27:40,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:40,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479998986] [2021-11-07 08:27:40,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:40,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:27:41,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:41,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479998986] [2021-11-07 08:27:41,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479998986] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:41,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:41,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:41,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136430964] [2021-11-07 08:27:41,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:41,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:41,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:41,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:41,013 INFO L87 Difference]: Start difference. First operand 148 states and 227 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-07 08:27:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:43,506 INFO L93 Difference]: Finished difference Result 291 states and 443 transitions. [2021-11-07 08:27:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:27:43,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-07 08:27:43,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:43,510 INFO L225 Difference]: With dead ends: 291 [2021-11-07 08:27:43,510 INFO L226 Difference]: Without dead ends: 164 [2021-11-07 08:27:43,511 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:27:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-07 08:27:43,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2021-11-07 08:27:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.5374149659863945) internal successors, (226), 147 states have internal predecessors, (226), 0 states have call successors, (0), 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-07 08:27:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 226 transitions. [2021-11-07 08:27:43,523 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 226 transitions. Word has length 51 [2021-11-07 08:27:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:43,524 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 226 transitions. [2021-11-07 08:27:43,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-07 08:27:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 226 transitions. [2021-11-07 08:27:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-07 08:27:43,528 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:43,528 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:43,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 08:27:43,529 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:43,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:43,530 INFO L85 PathProgramCache]: Analyzing trace with hash 451751422, now seen corresponding path program 1 times [2021-11-07 08:27:43,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:43,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365437988] [2021-11-07 08:27:43,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:43,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:27:43,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:43,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365437988] [2021-11-07 08:27:43,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365437988] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:43,740 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:43,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:43,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391062179] [2021-11-07 08:27:43,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:43,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:43,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:43,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:43,743 INFO L87 Difference]: Start difference. First operand 148 states and 226 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-07 08:27:45,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:45,627 INFO L93 Difference]: Finished difference Result 290 states and 441 transitions. [2021-11-07 08:27:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:27:45,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-07 08:27:45,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:45,630 INFO L225 Difference]: With dead ends: 290 [2021-11-07 08:27:45,630 INFO L226 Difference]: Without dead ends: 163 [2021-11-07 08:27:45,631 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:27:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-11-07 08:27:45,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 148. [2021-11-07 08:27:45,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.530612244897959) internal successors, (225), 147 states have internal predecessors, (225), 0 states have call successors, (0), 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-07 08:27:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 225 transitions. [2021-11-07 08:27:45,640 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 225 transitions. Word has length 51 [2021-11-07 08:27:45,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:45,640 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 225 transitions. [2021-11-07 08:27:45,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-07 08:27:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 225 transitions. [2021-11-07 08:27:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-07 08:27:45,643 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:45,643 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:45,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 08:27:45,644 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:45,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:45,645 INFO L85 PathProgramCache]: Analyzing trace with hash -88394050, now seen corresponding path program 1 times [2021-11-07 08:27:45,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:45,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395046061] [2021-11-07 08:27:45,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:45,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:27:45,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:45,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395046061] [2021-11-07 08:27:45,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395046061] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:45,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:45,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:45,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922532768] [2021-11-07 08:27:45,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:45,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:45,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:45,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:45,755 INFO L87 Difference]: Start difference. First operand 148 states and 225 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-07 08:27:48,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:48,105 INFO L93 Difference]: Finished difference Result 288 states and 438 transitions. [2021-11-07 08:27:48,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:27:48,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-07 08:27:48,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:48,108 INFO L225 Difference]: With dead ends: 288 [2021-11-07 08:27:48,108 INFO L226 Difference]: Without dead ends: 161 [2021-11-07 08:27:48,108 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:27:48,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-07 08:27:48,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2021-11-07 08:27:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.5238095238095237) internal successors, (224), 147 states have internal predecessors, (224), 0 states have call successors, (0), 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-07 08:27:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 224 transitions. [2021-11-07 08:27:48,115 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 224 transitions. Word has length 51 [2021-11-07 08:27:48,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:48,115 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 224 transitions. [2021-11-07 08:27:48,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-07 08:27:48,115 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 224 transitions. [2021-11-07 08:27:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-07 08:27:48,116 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:48,117 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:48,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 08:27:48,117 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:48,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash -388419541, now seen corresponding path program 1 times [2021-11-07 08:27:48,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:48,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938842600] [2021-11-07 08:27:48,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:48,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:27:48,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:48,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938842600] [2021-11-07 08:27:48,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938842600] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:48,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:48,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:48,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582584922] [2021-11-07 08:27:48,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:48,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:48,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:48,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:48,193 INFO L87 Difference]: Start difference. First operand 148 states and 224 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-07 08:27:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:50,548 INFO L93 Difference]: Finished difference Result 288 states and 437 transitions. [2021-11-07 08:27:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:27:50,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2021-11-07 08:27:50,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:50,551 INFO L225 Difference]: With dead ends: 288 [2021-11-07 08:27:50,551 INFO L226 Difference]: Without dead ends: 161 [2021-11-07 08:27:50,551 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:27:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-07 08:27:50,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2021-11-07 08:27:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.5170068027210883) internal successors, (223), 147 states have internal predecessors, (223), 0 states have call successors, (0), 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-07 08:27:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 223 transitions. [2021-11-07 08:27:50,557 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 223 transitions. Word has length 52 [2021-11-07 08:27:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:50,557 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 223 transitions. [2021-11-07 08:27:50,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-07 08:27:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2021-11-07 08:27:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-07 08:27:50,558 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:50,559 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:50,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 08:27:50,559 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:50,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:50,559 INFO L85 PathProgramCache]: Analyzing trace with hash -162201364, now seen corresponding path program 1 times [2021-11-07 08:27:50,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:50,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809724006] [2021-11-07 08:27:50,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:50,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:50,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:27:50,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:50,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809724006] [2021-11-07 08:27:50,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809724006] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:50,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:50,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:50,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524693493] [2021-11-07 08:27:50,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:50,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:50,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:50,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:50,633 INFO L87 Difference]: Start difference. First operand 148 states and 223 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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-07 08:27:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:52,776 INFO L93 Difference]: Finished difference Result 288 states and 436 transitions. [2021-11-07 08:27:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:27:52,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-11-07 08:27:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:52,779 INFO L225 Difference]: With dead ends: 288 [2021-11-07 08:27:52,779 INFO L226 Difference]: Without dead ends: 161 [2021-11-07 08:27:52,779 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:27:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-07 08:27:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2021-11-07 08:27:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.510204081632653) internal successors, (222), 147 states have internal predecessors, (222), 0 states have call successors, (0), 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-07 08:27:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 222 transitions. [2021-11-07 08:27:52,784 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 222 transitions. Word has length 53 [2021-11-07 08:27:52,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:52,785 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 222 transitions. [2021-11-07 08:27:52,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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-07 08:27:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 222 transitions. [2021-11-07 08:27:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-07 08:27:52,786 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:52,786 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:52,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 08:27:52,786 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:52,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:52,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2057823088, now seen corresponding path program 1 times [2021-11-07 08:27:52,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:52,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688845191] [2021-11-07 08:27:52,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:52,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:27:52,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:52,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688845191] [2021-11-07 08:27:52,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688845191] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:52,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:52,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:52,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552007378] [2021-11-07 08:27:52,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:52,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:52,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:52,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:52,857 INFO L87 Difference]: Start difference. First operand 148 states and 222 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:27:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:54,871 INFO L93 Difference]: Finished difference Result 278 states and 422 transitions. [2021-11-07 08:27:54,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:27:54,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-07 08:27:54,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:54,879 INFO L225 Difference]: With dead ends: 278 [2021-11-07 08:27:54,879 INFO L226 Difference]: Without dead ends: 151 [2021-11-07 08:27:54,880 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:27:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-11-07 08:27:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2021-11-07 08:27:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.5034013605442176) internal successors, (221), 147 states have internal predecessors, (221), 0 states have call successors, (0), 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-07 08:27:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 221 transitions. [2021-11-07 08:27:54,885 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 221 transitions. Word has length 54 [2021-11-07 08:27:54,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:54,885 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 221 transitions. [2021-11-07 08:27:54,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:27:54,885 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 221 transitions. [2021-11-07 08:27:54,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-07 08:27:54,886 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:54,886 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:54,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 08:27:54,886 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:54,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:54,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1297584632, now seen corresponding path program 1 times [2021-11-07 08:27:54,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:54,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845004904] [2021-11-07 08:27:54,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:54,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:27:55,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:55,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845004904] [2021-11-07 08:27:55,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845004904] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:55,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:55,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:55,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590116210] [2021-11-07 08:27:55,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:55,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:55,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:55,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:55,005 INFO L87 Difference]: Start difference. First operand 148 states and 221 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:27:56,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:56,180 INFO L93 Difference]: Finished difference Result 318 states and 483 transitions. [2021-11-07 08:27:56,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:27:56,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-07 08:27:56,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:56,183 INFO L225 Difference]: With dead ends: 318 [2021-11-07 08:27:56,183 INFO L226 Difference]: Without dead ends: 191 [2021-11-07 08:27:56,183 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:27:56,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-07 08:27:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2021-11-07 08:27:56,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.532544378698225) internal successors, (259), 169 states have internal predecessors, (259), 0 states have call successors, (0), 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-07 08:27:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 259 transitions. [2021-11-07 08:27:56,190 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 259 transitions. Word has length 54 [2021-11-07 08:27:56,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:56,190 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 259 transitions. [2021-11-07 08:27:56,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:27:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 259 transitions. [2021-11-07 08:27:56,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-07 08:27:56,191 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:56,192 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:56,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 08:27:56,192 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:56,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:56,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1819095073, now seen corresponding path program 1 times [2021-11-07 08:27:56,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:56,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073111465] [2021-11-07 08:27:56,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:56,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:27:56,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:56,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073111465] [2021-11-07 08:27:56,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073111465] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:56,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:56,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:56,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674936082] [2021-11-07 08:27:56,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:56,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:56,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:56,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:56,268 INFO L87 Difference]: Start difference. First operand 170 states and 259 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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-07 08:27:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:57,015 INFO L93 Difference]: Finished difference Result 340 states and 520 transitions. [2021-11-07 08:27:57,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:27:57,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-11-07 08:27:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:57,017 INFO L225 Difference]: With dead ends: 340 [2021-11-07 08:27:57,017 INFO L226 Difference]: Without dead ends: 191 [2021-11-07 08:27:57,018 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:27:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-07 08:27:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2021-11-07 08:27:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 169 states have internal predecessors, (258), 0 states have call successors, (0), 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-07 08:27:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 258 transitions. [2021-11-07 08:27:57,024 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 258 transitions. Word has length 67 [2021-11-07 08:27:57,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:57,025 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 258 transitions. [2021-11-07 08:27:57,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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-07 08:27:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 258 transitions. [2021-11-07 08:27:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-07 08:27:57,026 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:57,026 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:57,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 08:27:57,027 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:57,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:57,027 INFO L85 PathProgramCache]: Analyzing trace with hash 170572756, now seen corresponding path program 1 times [2021-11-07 08:27:57,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:57,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946286546] [2021-11-07 08:27:57,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:57,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:27:57,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:57,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946286546] [2021-11-07 08:27:57,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946286546] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:57,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:57,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:57,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324147438] [2021-11-07 08:27:57,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:57,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:57,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:57,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:57,096 INFO L87 Difference]: Start difference. First operand 170 states and 258 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-07 08:27:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:58,327 INFO L93 Difference]: Finished difference Result 339 states and 517 transitions. [2021-11-07 08:27:58,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:27:58,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-11-07 08:27:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:58,329 INFO L225 Difference]: With dead ends: 339 [2021-11-07 08:27:58,329 INFO L226 Difference]: Without dead ends: 190 [2021-11-07 08:27:58,329 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:27:58,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-11-07 08:27:58,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 170. [2021-11-07 08:27:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.5207100591715976) internal successors, (257), 169 states have internal predecessors, (257), 0 states have call successors, (0), 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-07 08:27:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 257 transitions. [2021-11-07 08:27:58,335 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 257 transitions. Word has length 68 [2021-11-07 08:27:58,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:58,335 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 257 transitions. [2021-11-07 08:27:58,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-07 08:27:58,335 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 257 transitions. [2021-11-07 08:27:58,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-07 08:27:58,336 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:58,336 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-11-07 08:27:58,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 08:27:58,337 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:58,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:58,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1036151912, now seen corresponding path program 1 times [2021-11-07 08:27:58,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:58,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152215229] [2021-11-07 08:27:58,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:58,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:27:58,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:58,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152215229] [2021-11-07 08:27:58,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152215229] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:58,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:58,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:58,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265690970] [2021-11-07 08:27:58,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:58,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:58,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:58,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:58,400 INFO L87 Difference]: Start difference. First operand 170 states and 257 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-07 08:27:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:27:59,468 INFO L93 Difference]: Finished difference Result 339 states and 515 transitions. [2021-11-07 08:27:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:27:59,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-11-07 08:27:59,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:27:59,470 INFO L225 Difference]: With dead ends: 339 [2021-11-07 08:27:59,470 INFO L226 Difference]: Without dead ends: 190 [2021-11-07 08:27:59,471 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:27:59,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-11-07 08:27:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 170. [2021-11-07 08:27:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.514792899408284) internal successors, (256), 169 states have internal predecessors, (256), 0 states have call successors, (0), 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-07 08:27:59,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 256 transitions. [2021-11-07 08:27:59,477 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 256 transitions. Word has length 68 [2021-11-07 08:27:59,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:27:59,477 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 256 transitions. [2021-11-07 08:27:59,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-07 08:27:59,477 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 256 transitions. [2021-11-07 08:27:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-07 08:27:59,479 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:27:59,479 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2021-11-07 08:27:59,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 08:27:59,479 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:27:59,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:27:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash 646966847, now seen corresponding path program 1 times [2021-11-07 08:27:59,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:27:59,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425498166] [2021-11-07 08:27:59,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:27:59,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:27:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:27:59,572 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-07 08:27:59,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:27:59,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425498166] [2021-11-07 08:27:59,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425498166] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:27:59,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:27:59,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:27:59,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60643207] [2021-11-07 08:27:59,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:27:59,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:27:59,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:27:59,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:27:59,575 INFO L87 Difference]: Start difference. First operand 170 states and 256 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-07 08:28:00,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:00,359 INFO L93 Difference]: Finished difference Result 338 states and 512 transitions. [2021-11-07 08:28:00,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:00,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-11-07 08:28:00,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:00,361 INFO L225 Difference]: With dead ends: 338 [2021-11-07 08:28:00,361 INFO L226 Difference]: Without dead ends: 189 [2021-11-07 08:28:00,362 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-11-07 08:28:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 170. [2021-11-07 08:28:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.5088757396449703) internal successors, (255), 169 states have internal predecessors, (255), 0 states have call successors, (0), 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-07 08:28:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 255 transitions. [2021-11-07 08:28:00,371 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 255 transitions. Word has length 68 [2021-11-07 08:28:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:00,371 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 255 transitions. [2021-11-07 08:28:00,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-07 08:28:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 255 transitions. [2021-11-07 08:28:00,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-07 08:28:00,372 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:00,373 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2021-11-07 08:28:00,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 08:28:00,373 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:00,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:00,374 INFO L85 PathProgramCache]: Analyzing trace with hash 106821375, now seen corresponding path program 1 times [2021-11-07 08:28:00,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:00,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656381932] [2021-11-07 08:28:00,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:00,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:28:00,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:00,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656381932] [2021-11-07 08:28:00,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656381932] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:00,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:00,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:00,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846033557] [2021-11-07 08:28:00,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:00,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:00,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:00,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:00,449 INFO L87 Difference]: Start difference. First operand 170 states and 255 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-07 08:28:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:02,426 INFO L93 Difference]: Finished difference Result 336 states and 508 transitions. [2021-11-07 08:28:02,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:02,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-11-07 08:28:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:02,429 INFO L225 Difference]: With dead ends: 336 [2021-11-07 08:28:02,429 INFO L226 Difference]: Without dead ends: 187 [2021-11-07 08:28:02,430 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:02,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-11-07 08:28:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2021-11-07 08:28:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.5029585798816567) internal successors, (254), 169 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:28:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 254 transitions. [2021-11-07 08:28:02,438 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 254 transitions. Word has length 68 [2021-11-07 08:28:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:02,439 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 254 transitions. [2021-11-07 08:28:02,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-07 08:28:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 254 transitions. [2021-11-07 08:28:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-07 08:28:02,440 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:02,441 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-11-07 08:28:02,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 08:28:02,441 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:02,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1368291338, now seen corresponding path program 1 times [2021-11-07 08:28:02,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:02,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507215332] [2021-11-07 08:28:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:02,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:02,519 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-07 08:28:02,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:02,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507215332] [2021-11-07 08:28:02,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507215332] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:02,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:02,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:02,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712102955] [2021-11-07 08:28:02,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:02,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:02,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:02,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:02,529 INFO L87 Difference]: Start difference. First operand 170 states and 254 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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-07 08:28:04,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:04,774 INFO L93 Difference]: Finished difference Result 336 states and 506 transitions. [2021-11-07 08:28:04,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:04,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2021-11-07 08:28:04,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:04,776 INFO L225 Difference]: With dead ends: 336 [2021-11-07 08:28:04,776 INFO L226 Difference]: Without dead ends: 187 [2021-11-07 08:28:04,776 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:04,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-11-07 08:28:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2021-11-07 08:28:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.4970414201183433) internal successors, (253), 169 states have internal predecessors, (253), 0 states have call successors, (0), 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-07 08:28:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 253 transitions. [2021-11-07 08:28:04,782 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 253 transitions. Word has length 69 [2021-11-07 08:28:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:04,783 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 253 transitions. [2021-11-07 08:28:04,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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-07 08:28:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 253 transitions. [2021-11-07 08:28:04,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-07 08:28:04,784 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:04,784 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:04,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 08:28:04,784 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:04,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:04,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1538738963, now seen corresponding path program 1 times [2021-11-07 08:28:04,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:04,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382852640] [2021-11-07 08:28:04,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:04,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:28:04,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:04,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382852640] [2021-11-07 08:28:04,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382852640] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:04,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:04,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:04,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843392036] [2021-11-07 08:28:04,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:04,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:04,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:04,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:04,843 INFO L87 Difference]: Start difference. First operand 170 states and 253 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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-07 08:28:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:06,222 INFO L93 Difference]: Finished difference Result 336 states and 504 transitions. [2021-11-07 08:28:06,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:06,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-11-07 08:28:06,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:06,224 INFO L225 Difference]: With dead ends: 336 [2021-11-07 08:28:06,224 INFO L226 Difference]: Without dead ends: 187 [2021-11-07 08:28:06,224 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-11-07 08:28:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2021-11-07 08:28:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.4911242603550297) internal successors, (252), 169 states have internal predecessors, (252), 0 states have call successors, (0), 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-07 08:28:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 252 transitions. [2021-11-07 08:28:06,232 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 252 transitions. Word has length 70 [2021-11-07 08:28:06,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:06,233 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 252 transitions. [2021-11-07 08:28:06,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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-07 08:28:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 252 transitions. [2021-11-07 08:28:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-07 08:28:06,234 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:06,234 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2021-11-07 08:28:06,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 08:28:06,235 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:06,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:06,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1780815697, now seen corresponding path program 1 times [2021-11-07 08:28:06,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:06,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423425699] [2021-11-07 08:28:06,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:06,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:06,317 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:28:06,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:06,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423425699] [2021-11-07 08:28:06,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423425699] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:06,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:06,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:06,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425508988] [2021-11-07 08:28:06,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:06,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:06,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:06,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:06,321 INFO L87 Difference]: Start difference. First operand 170 states and 252 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-07 08:28:08,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:08,109 INFO L93 Difference]: Finished difference Result 326 states and 489 transitions. [2021-11-07 08:28:08,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:08,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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 71 [2021-11-07 08:28:08,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:08,111 INFO L225 Difference]: With dead ends: 326 [2021-11-07 08:28:08,111 INFO L226 Difference]: Without dead ends: 177 [2021-11-07 08:28:08,112 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:08,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-07 08:28:08,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2021-11-07 08:28:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.485207100591716) internal successors, (251), 169 states have internal predecessors, (251), 0 states have call successors, (0), 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-07 08:28:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 251 transitions. [2021-11-07 08:28:08,117 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 251 transitions. Word has length 71 [2021-11-07 08:28:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:08,118 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 251 transitions. [2021-11-07 08:28:08,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-07 08:28:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 251 transitions. [2021-11-07 08:28:08,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-07 08:28:08,119 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:08,119 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:08,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 08:28:08,120 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:08,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:08,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2072838766, now seen corresponding path program 1 times [2021-11-07 08:28:08,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:08,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258952483] [2021-11-07 08:28:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:08,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:08,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:08,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258952483] [2021-11-07 08:28:08,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258952483] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:08,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:08,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:08,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116000136] [2021-11-07 08:28:08,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:08,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:08,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:08,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:08,192 INFO L87 Difference]: Start difference. First operand 170 states and 251 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:28:10,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:10,658 INFO L93 Difference]: Finished difference Result 426 states and 642 transitions. [2021-11-07 08:28:10,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:10,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-07 08:28:10,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:10,662 INFO L225 Difference]: With dead ends: 426 [2021-11-07 08:28:10,662 INFO L226 Difference]: Without dead ends: 277 [2021-11-07 08:28:10,663 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:10,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-11-07 08:28:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 200. [2021-11-07 08:28:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.5226130653266332) internal successors, (303), 199 states have internal predecessors, (303), 0 states have call successors, (0), 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-07 08:28:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 303 transitions. [2021-11-07 08:28:10,673 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 303 transitions. Word has length 76 [2021-11-07 08:28:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:10,673 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 303 transitions. [2021-11-07 08:28:10,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:28:10,674 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 303 transitions. [2021-11-07 08:28:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-07 08:28:10,675 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:10,675 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:10,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 08:28:10,676 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2000452208, now seen corresponding path program 1 times [2021-11-07 08:28:10,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:10,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434416658] [2021-11-07 08:28:10,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:10,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:10,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:10,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434416658] [2021-11-07 08:28:10,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434416658] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:10,769 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:10,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:10,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292427679] [2021-11-07 08:28:10,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:10,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:10,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:10,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:10,771 INFO L87 Difference]: Start difference. First operand 200 states and 303 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:28:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:13,097 INFO L93 Difference]: Finished difference Result 429 states and 658 transitions. [2021-11-07 08:28:13,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:13,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-07 08:28:13,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:13,100 INFO L225 Difference]: With dead ends: 429 [2021-11-07 08:28:13,100 INFO L226 Difference]: Without dead ends: 250 [2021-11-07 08:28:13,101 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:13,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-11-07 08:28:13,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 224. [2021-11-07 08:28:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.547085201793722) internal successors, (345), 223 states have internal predecessors, (345), 0 states have call successors, (0), 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-07 08:28:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 345 transitions. [2021-11-07 08:28:13,109 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 345 transitions. Word has length 76 [2021-11-07 08:28:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:13,111 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 345 transitions. [2021-11-07 08:28:13,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:28:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 345 transitions. [2021-11-07 08:28:13,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-07 08:28:13,113 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:13,113 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:13,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 08:28:13,113 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:13,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:13,114 INFO L85 PathProgramCache]: Analyzing trace with hash -2072837020, now seen corresponding path program 1 times [2021-11-07 08:28:13,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:13,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777706356] [2021-11-07 08:28:13,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:13,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:13,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:13,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777706356] [2021-11-07 08:28:13,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777706356] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:13,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:13,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:13,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192449240] [2021-11-07 08:28:13,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:13,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:13,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:13,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:13,196 INFO L87 Difference]: Start difference. First operand 224 states and 345 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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-07 08:28:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:15,543 INFO L93 Difference]: Finished difference Result 496 states and 764 transitions. [2021-11-07 08:28:15,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:15,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 77 [2021-11-07 08:28:15,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:15,546 INFO L225 Difference]: With dead ends: 496 [2021-11-07 08:28:15,546 INFO L226 Difference]: Without dead ends: 293 [2021-11-07 08:28:15,546 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-11-07 08:28:15,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 225. [2021-11-07 08:28:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.5446428571428572) internal successors, (346), 224 states have internal predecessors, (346), 0 states have call successors, (0), 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-07 08:28:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 346 transitions. [2021-11-07 08:28:15,555 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 346 transitions. Word has length 77 [2021-11-07 08:28:15,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:15,555 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 346 transitions. [2021-11-07 08:28:15,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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-07 08:28:15,556 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 346 transitions. [2021-11-07 08:28:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-07 08:28:15,557 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:15,557 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:15,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 08:28:15,557 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:15,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:15,558 INFO L85 PathProgramCache]: Analyzing trace with hash 240748658, now seen corresponding path program 1 times [2021-11-07 08:28:15,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:15,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379636981] [2021-11-07 08:28:15,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:15,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:15,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:15,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379636981] [2021-11-07 08:28:15,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379636981] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:15,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:15,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:15,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088415208] [2021-11-07 08:28:15,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:15,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:15,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:15,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:15,631 INFO L87 Difference]: Start difference. First operand 225 states and 346 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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-07 08:28:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:17,952 INFO L93 Difference]: Finished difference Result 497 states and 764 transitions. [2021-11-07 08:28:17,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:17,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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 83 [2021-11-07 08:28:17,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:17,956 INFO L225 Difference]: With dead ends: 497 [2021-11-07 08:28:17,956 INFO L226 Difference]: Without dead ends: 293 [2021-11-07 08:28:17,956 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-11-07 08:28:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 235. [2021-11-07 08:28:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.5598290598290598) internal successors, (365), 234 states have internal predecessors, (365), 0 states have call successors, (0), 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-07 08:28:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 365 transitions. [2021-11-07 08:28:17,963 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 365 transitions. Word has length 83 [2021-11-07 08:28:17,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:17,963 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 365 transitions. [2021-11-07 08:28:17,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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-07 08:28:17,964 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 365 transitions. [2021-11-07 08:28:17,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-07 08:28:17,965 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:17,965 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:17,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 08:28:17,966 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:17,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:17,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1344832479, now seen corresponding path program 1 times [2021-11-07 08:28:17,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:17,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207765580] [2021-11-07 08:28:17,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:17,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:18,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:18,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207765580] [2021-11-07 08:28:18,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207765580] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:18,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:18,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:18,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450030278] [2021-11-07 08:28:18,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:18,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:18,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:18,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:18,043 INFO L87 Difference]: Start difference. First operand 235 states and 365 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:28:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:20,479 INFO L93 Difference]: Finished difference Result 499 states and 771 transitions. [2021-11-07 08:28:20,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:20,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-07 08:28:20,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:20,482 INFO L225 Difference]: With dead ends: 499 [2021-11-07 08:28:20,482 INFO L226 Difference]: Without dead ends: 285 [2021-11-07 08:28:20,483 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:20,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-11-07 08:28:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 236. [2021-11-07 08:28:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.5574468085106383) internal successors, (366), 235 states have internal predecessors, (366), 0 states have call successors, (0), 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-07 08:28:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 366 transitions. [2021-11-07 08:28:20,492 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 366 transitions. Word has length 84 [2021-11-07 08:28:20,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:20,493 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 366 transitions. [2021-11-07 08:28:20,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:28:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 366 transitions. [2021-11-07 08:28:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-07 08:28:20,495 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:20,495 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:20,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-07 08:28:20,496 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:20,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:20,496 INFO L85 PathProgramCache]: Analyzing trace with hash -523718805, now seen corresponding path program 1 times [2021-11-07 08:28:20,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:20,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928664543] [2021-11-07 08:28:20,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:20,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:20,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:20,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928664543] [2021-11-07 08:28:20,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928664543] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:20,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:20,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:20,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911716790] [2021-11-07 08:28:20,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:20,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:20,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:20,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:20,580 INFO L87 Difference]: Start difference. First operand 236 states and 366 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-07 08:28:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:21,760 INFO L93 Difference]: Finished difference Result 500 states and 771 transitions. [2021-11-07 08:28:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:21,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 89 [2021-11-07 08:28:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:21,762 INFO L225 Difference]: With dead ends: 500 [2021-11-07 08:28:21,763 INFO L226 Difference]: Without dead ends: 285 [2021-11-07 08:28:21,763 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:21,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-11-07 08:28:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 236. [2021-11-07 08:28:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.553191489361702) internal successors, (365), 235 states have internal predecessors, (365), 0 states have call successors, (0), 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-07 08:28:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 365 transitions. [2021-11-07 08:28:21,770 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 365 transitions. Word has length 89 [2021-11-07 08:28:21,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:21,771 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 365 transitions. [2021-11-07 08:28:21,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-07 08:28:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 365 transitions. [2021-11-07 08:28:21,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-07 08:28:21,772 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:21,773 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:21,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 08:28:21,773 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:21,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:21,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1404553897, now seen corresponding path program 1 times [2021-11-07 08:28:21,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:21,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323965861] [2021-11-07 08:28:21,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:21,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:21,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:21,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323965861] [2021-11-07 08:28:21,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323965861] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:21,835 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:21,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:21,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040643453] [2021-11-07 08:28:21,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:21,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:21,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:21,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:21,837 INFO L87 Difference]: Start difference. First operand 236 states and 365 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-07 08:28:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:23,298 INFO L93 Difference]: Finished difference Result 477 states and 739 transitions. [2021-11-07 08:28:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:23,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 89 [2021-11-07 08:28:23,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:23,301 INFO L225 Difference]: With dead ends: 477 [2021-11-07 08:28:23,301 INFO L226 Difference]: Without dead ends: 262 [2021-11-07 08:28:23,301 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:23,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-11-07 08:28:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 236. [2021-11-07 08:28:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.548936170212766) internal successors, (364), 235 states have internal predecessors, (364), 0 states have call successors, (0), 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-07 08:28:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 364 transitions. [2021-11-07 08:28:23,308 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 364 transitions. Word has length 89 [2021-11-07 08:28:23,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:23,308 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 364 transitions. [2021-11-07 08:28:23,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-07 08:28:23,309 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 364 transitions. [2021-11-07 08:28:23,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-07 08:28:23,310 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:23,310 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:23,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 08:28:23,310 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:23,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:23,311 INFO L85 PathProgramCache]: Analyzing trace with hash 557786570, now seen corresponding path program 1 times [2021-11-07 08:28:23,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:23,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449208831] [2021-11-07 08:28:23,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:23,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:23,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:23,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449208831] [2021-11-07 08:28:23,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449208831] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:23,373 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:23,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:23,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060982008] [2021-11-07 08:28:23,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:23,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:23,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:23,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:23,375 INFO L87 Difference]: Start difference. First operand 236 states and 364 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 08:28:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:24,939 INFO L93 Difference]: Finished difference Result 499 states and 766 transitions. [2021-11-07 08:28:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:24,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 90 [2021-11-07 08:28:24,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:24,949 INFO L225 Difference]: With dead ends: 499 [2021-11-07 08:28:24,949 INFO L226 Difference]: Without dead ends: 284 [2021-11-07 08:28:24,950 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:24,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-11-07 08:28:24,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 236. [2021-11-07 08:28:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.5446808510638297) internal successors, (363), 235 states have internal predecessors, (363), 0 states have call successors, (0), 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-07 08:28:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 363 transitions. [2021-11-07 08:28:24,957 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 363 transitions. Word has length 90 [2021-11-07 08:28:24,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:24,957 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 363 transitions. [2021-11-07 08:28:24,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 08:28:24,958 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 363 transitions. [2021-11-07 08:28:24,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-07 08:28:24,959 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:24,959 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:24,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-07 08:28:24,960 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:24,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1423365726, now seen corresponding path program 1 times [2021-11-07 08:28:24,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:24,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934825437] [2021-11-07 08:28:24,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:24,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-07 08:28:25,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:25,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934825437] [2021-11-07 08:28:25,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934825437] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:25,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:25,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:28:25,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979814202] [2021-11-07 08:28:25,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:28:25,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:25,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:28:25,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:25,065 INFO L87 Difference]: Start difference. First operand 236 states and 363 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-07 08:28:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:28,616 INFO L93 Difference]: Finished difference Result 472 states and 731 transitions. [2021-11-07 08:28:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 08:28:28,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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 90 [2021-11-07 08:28:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:28,618 INFO L225 Difference]: With dead ends: 472 [2021-11-07 08:28:28,618 INFO L226 Difference]: Without dead ends: 257 [2021-11-07 08:28:28,619 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:28:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-11-07 08:28:28,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2021-11-07 08:28:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.5254901960784313) internal successors, (389), 255 states have internal predecessors, (389), 0 states have call successors, (0), 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-07 08:28:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2021-11-07 08:28:28,659 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 90 [2021-11-07 08:28:28,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:28,659 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2021-11-07 08:28:28,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-07 08:28:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2021-11-07 08:28:28,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-07 08:28:28,661 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:28,661 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:28,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-07 08:28:28,661 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:28,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:28,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1034180661, now seen corresponding path program 1 times [2021-11-07 08:28:28,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:28,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118244557] [2021-11-07 08:28:28,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:28,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:28,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:28,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118244557] [2021-11-07 08:28:28,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118244557] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:28,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:28,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:28,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342433058] [2021-11-07 08:28:28,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:28,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:28,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:28,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:28,731 INFO L87 Difference]: Start difference. First operand 256 states and 389 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 08:28:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:30,614 INFO L93 Difference]: Finished difference Result 538 states and 814 transitions. [2021-11-07 08:28:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:30,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 90 [2021-11-07 08:28:30,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:30,616 INFO L225 Difference]: With dead ends: 538 [2021-11-07 08:28:30,617 INFO L226 Difference]: Without dead ends: 303 [2021-11-07 08:28:30,617 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:30,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-11-07 08:28:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 256. [2021-11-07 08:28:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.5215686274509803) internal successors, (388), 255 states have internal predecessors, (388), 0 states have call successors, (0), 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-07 08:28:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 388 transitions. [2021-11-07 08:28:30,626 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 388 transitions. Word has length 90 [2021-11-07 08:28:30,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:30,626 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 388 transitions. [2021-11-07 08:28:30,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 08:28:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 388 transitions. [2021-11-07 08:28:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-07 08:28:30,628 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:30,628 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:30,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-07 08:28:30,629 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:30,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:30,629 INFO L85 PathProgramCache]: Analyzing trace with hash 494035189, now seen corresponding path program 1 times [2021-11-07 08:28:30,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:30,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300094861] [2021-11-07 08:28:30,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:30,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:30,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:30,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300094861] [2021-11-07 08:28:30,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300094861] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:30,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:30,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:30,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582701289] [2021-11-07 08:28:30,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:30,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:30,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:30,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:30,713 INFO L87 Difference]: Start difference. First operand 256 states and 388 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 08:28:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:33,103 INFO L93 Difference]: Finished difference Result 536 states and 810 transitions. [2021-11-07 08:28:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:33,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 90 [2021-11-07 08:28:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:33,106 INFO L225 Difference]: With dead ends: 536 [2021-11-07 08:28:33,107 INFO L226 Difference]: Without dead ends: 301 [2021-11-07 08:28:33,107 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:33,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-07 08:28:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 256. [2021-11-07 08:28:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.5176470588235293) internal successors, (387), 255 states have internal predecessors, (387), 0 states have call successors, (0), 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-07 08:28:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 387 transitions. [2021-11-07 08:28:33,116 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 387 transitions. Word has length 90 [2021-11-07 08:28:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:33,117 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 387 transitions. [2021-11-07 08:28:33,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 08:28:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 387 transitions. [2021-11-07 08:28:33,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-07 08:28:33,118 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:33,118 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:33,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-07 08:28:33,119 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:33,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:33,120 INFO L85 PathProgramCache]: Analyzing trace with hash 681092279, now seen corresponding path program 1 times [2021-11-07 08:28:33,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:33,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951100718] [2021-11-07 08:28:33,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:33,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:33,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:33,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951100718] [2021-11-07 08:28:33,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951100718] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:33,186 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:33,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:33,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263678469] [2021-11-07 08:28:33,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:33,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:33,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:33,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:33,187 INFO L87 Difference]: Start difference. First operand 256 states and 387 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 08:28:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:35,469 INFO L93 Difference]: Finished difference Result 515 states and 780 transitions. [2021-11-07 08:28:35,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:35,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 90 [2021-11-07 08:28:35,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:35,471 INFO L225 Difference]: With dead ends: 515 [2021-11-07 08:28:35,471 INFO L226 Difference]: Without dead ends: 280 [2021-11-07 08:28:35,472 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-11-07 08:28:35,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2021-11-07 08:28:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.5137254901960784) internal successors, (386), 255 states have internal predecessors, (386), 0 states have call successors, (0), 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-07 08:28:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 386 transitions. [2021-11-07 08:28:35,480 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 386 transitions. Word has length 90 [2021-11-07 08:28:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:35,481 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 386 transitions. [2021-11-07 08:28:35,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 08:28:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 386 transitions. [2021-11-07 08:28:35,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-07 08:28:35,483 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:35,483 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:35,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-07 08:28:35,483 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:35,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:35,484 INFO L85 PathProgramCache]: Analyzing trace with hash 140946807, now seen corresponding path program 1 times [2021-11-07 08:28:35,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:35,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296609791] [2021-11-07 08:28:35,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:35,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:35,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:35,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296609791] [2021-11-07 08:28:35,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296609791] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:35,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:35,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:35,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826504702] [2021-11-07 08:28:35,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:35,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:35,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:35,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:35,586 INFO L87 Difference]: Start difference. First operand 256 states and 386 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 08:28:37,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:37,890 INFO L93 Difference]: Finished difference Result 513 states and 776 transitions. [2021-11-07 08:28:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:37,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 90 [2021-11-07 08:28:37,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:37,893 INFO L225 Difference]: With dead ends: 513 [2021-11-07 08:28:37,893 INFO L226 Difference]: Without dead ends: 278 [2021-11-07 08:28:37,894 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:37,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-07 08:28:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2021-11-07 08:28:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.5098039215686274) internal successors, (385), 255 states have internal predecessors, (385), 0 states have call successors, (0), 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-07 08:28:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 385 transitions. [2021-11-07 08:28:37,904 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 385 transitions. Word has length 90 [2021-11-07 08:28:37,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:37,904 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 385 transitions. [2021-11-07 08:28:37,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 08:28:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 385 transitions. [2021-11-07 08:28:37,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-07 08:28:37,906 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:37,906 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:37,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-07 08:28:37,907 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:37,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:37,908 INFO L85 PathProgramCache]: Analyzing trace with hash 618167687, now seen corresponding path program 1 times [2021-11-07 08:28:37,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:37,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842985719] [2021-11-07 08:28:37,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:37,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:37,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:37,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842985719] [2021-11-07 08:28:37,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842985719] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:37,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:37,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:37,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186523409] [2021-11-07 08:28:37,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:37,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:37,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:37,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:37,983 INFO L87 Difference]: Start difference. First operand 256 states and 385 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 08:28:40,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:40,353 INFO L93 Difference]: Finished difference Result 536 states and 804 transitions. [2021-11-07 08:28:40,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:40,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 91 [2021-11-07 08:28:40,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:40,355 INFO L225 Difference]: With dead ends: 536 [2021-11-07 08:28:40,355 INFO L226 Difference]: Without dead ends: 301 [2021-11-07 08:28:40,356 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-07 08:28:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 256. [2021-11-07 08:28:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.5058823529411764) internal successors, (384), 255 states have internal predecessors, (384), 0 states have call successors, (0), 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-07 08:28:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 384 transitions. [2021-11-07 08:28:40,364 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 384 transitions. Word has length 91 [2021-11-07 08:28:40,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:40,365 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 384 transitions. [2021-11-07 08:28:40,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 08:28:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 384 transitions. [2021-11-07 08:28:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-07 08:28:40,366 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:40,366 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:40,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-07 08:28:40,367 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:40,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:40,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1737637563, now seen corresponding path program 1 times [2021-11-07 08:28:40,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:40,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100406744] [2021-11-07 08:28:40,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:40,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:40,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:40,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100406744] [2021-11-07 08:28:40,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100406744] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:40,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:40,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:40,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848894675] [2021-11-07 08:28:40,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:40,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:40,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:40,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:40,440 INFO L87 Difference]: Start difference. First operand 256 states and 384 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 08:28:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:42,803 INFO L93 Difference]: Finished difference Result 513 states and 772 transitions. [2021-11-07 08:28:42,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:42,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 91 [2021-11-07 08:28:42,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:42,806 INFO L225 Difference]: With dead ends: 513 [2021-11-07 08:28:42,806 INFO L226 Difference]: Without dead ends: 278 [2021-11-07 08:28:42,807 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-07 08:28:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2021-11-07 08:28:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.5019607843137255) internal successors, (383), 255 states have internal predecessors, (383), 0 states have call successors, (0), 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-07 08:28:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 383 transitions. [2021-11-07 08:28:42,817 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 383 transitions. Word has length 91 [2021-11-07 08:28:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:42,817 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 383 transitions. [2021-11-07 08:28:42,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 08:28:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 383 transitions. [2021-11-07 08:28:42,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-07 08:28:42,819 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:42,819 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:42,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-07 08:28:42,820 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:42,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:42,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1656149457, now seen corresponding path program 1 times [2021-11-07 08:28:42,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:42,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373852813] [2021-11-07 08:28:42,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:42,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:42,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:42,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373852813] [2021-11-07 08:28:42,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373852813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:42,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:42,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:42,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202367384] [2021-11-07 08:28:42,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:42,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:42,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:42,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:42,896 INFO L87 Difference]: Start difference. First operand 256 states and 383 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:28:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:44,473 INFO L93 Difference]: Finished difference Result 536 states and 800 transitions. [2021-11-07 08:28:44,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:44,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-11-07 08:28:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:44,476 INFO L225 Difference]: With dead ends: 536 [2021-11-07 08:28:44,476 INFO L226 Difference]: Without dead ends: 301 [2021-11-07 08:28:44,476 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-07 08:28:44,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 256. [2021-11-07 08:28:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4980392156862745) internal successors, (382), 255 states have internal predecessors, (382), 0 states have call successors, (0), 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-07 08:28:44,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2021-11-07 08:28:44,486 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 92 [2021-11-07 08:28:44,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:44,487 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2021-11-07 08:28:44,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:28:44,487 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2021-11-07 08:28:44,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-07 08:28:44,488 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:44,489 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:44,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-07 08:28:44,489 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:44,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:44,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1640630739, now seen corresponding path program 1 times [2021-11-07 08:28:44,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:44,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093067265] [2021-11-07 08:28:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:44,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:44,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:44,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093067265] [2021-11-07 08:28:44,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093067265] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:44,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:44,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:44,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071477615] [2021-11-07 08:28:44,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:44,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:44,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:44,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:44,565 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:28:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:46,926 INFO L93 Difference]: Finished difference Result 513 states and 768 transitions. [2021-11-07 08:28:46,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:46,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-11-07 08:28:46,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:46,928 INFO L225 Difference]: With dead ends: 513 [2021-11-07 08:28:46,928 INFO L226 Difference]: Without dead ends: 278 [2021-11-07 08:28:46,929 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:46,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-07 08:28:46,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2021-11-07 08:28:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4941176470588236) internal successors, (381), 255 states have internal predecessors, (381), 0 states have call successors, (0), 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-07 08:28:46,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 381 transitions. [2021-11-07 08:28:46,938 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 381 transitions. Word has length 92 [2021-11-07 08:28:46,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:46,938 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 381 transitions. [2021-11-07 08:28:46,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:28:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 381 transitions. [2021-11-07 08:28:46,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-07 08:28:46,940 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:46,940 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:46,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-07 08:28:46,941 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:46,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:46,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1808188638, now seen corresponding path program 1 times [2021-11-07 08:28:46,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:46,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517390180] [2021-11-07 08:28:46,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:46,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:47,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:47,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517390180] [2021-11-07 08:28:47,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517390180] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:47,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:47,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:47,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297420644] [2021-11-07 08:28:47,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:47,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:47,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:47,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:47,023 INFO L87 Difference]: Start difference. First operand 256 states and 381 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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-07 08:28:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:49,458 INFO L93 Difference]: Finished difference Result 536 states and 796 transitions. [2021-11-07 08:28:49,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:49,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 93 [2021-11-07 08:28:49,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:49,461 INFO L225 Difference]: With dead ends: 536 [2021-11-07 08:28:49,461 INFO L226 Difference]: Without dead ends: 301 [2021-11-07 08:28:49,461 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-07 08:28:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 256. [2021-11-07 08:28:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4901960784313726) internal successors, (380), 255 states have internal predecessors, (380), 0 states have call successors, (0), 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-07 08:28:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 380 transitions. [2021-11-07 08:28:49,471 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 380 transitions. Word has length 93 [2021-11-07 08:28:49,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:49,471 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 380 transitions. [2021-11-07 08:28:49,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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-07 08:28:49,472 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 380 transitions. [2021-11-07 08:28:49,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-07 08:28:49,473 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:49,473 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:49,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-07 08:28:49,474 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:49,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:49,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2005698400, now seen corresponding path program 1 times [2021-11-07 08:28:49,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:49,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260754999] [2021-11-07 08:28:49,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:49,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:49,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:49,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260754999] [2021-11-07 08:28:49,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260754999] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:49,549 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:49,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:49,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859781772] [2021-11-07 08:28:49,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:49,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:49,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:49,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:49,551 INFO L87 Difference]: Start difference. First operand 256 states and 380 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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-07 08:28:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:51,934 INFO L93 Difference]: Finished difference Result 513 states and 764 transitions. [2021-11-07 08:28:51,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:51,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 93 [2021-11-07 08:28:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:51,936 INFO L225 Difference]: With dead ends: 513 [2021-11-07 08:28:51,936 INFO L226 Difference]: Without dead ends: 278 [2021-11-07 08:28:51,936 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:51,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-07 08:28:51,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2021-11-07 08:28:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4862745098039216) internal successors, (379), 255 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:28:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2021-11-07 08:28:51,943 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 93 [2021-11-07 08:28:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:51,944 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2021-11-07 08:28:51,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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-07 08:28:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2021-11-07 08:28:51,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-07 08:28:51,945 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:51,945 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:51,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-07 08:28:51,946 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:51,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:51,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1184445516, now seen corresponding path program 1 times [2021-11-07 08:28:51,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:51,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354636958] [2021-11-07 08:28:51,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:51,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:52,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:52,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354636958] [2021-11-07 08:28:52,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354636958] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:52,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:52,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:52,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047391161] [2021-11-07 08:28:52,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:52,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:52,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:52,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:52,016 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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-07 08:28:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:53,564 INFO L93 Difference]: Finished difference Result 526 states and 780 transitions. [2021-11-07 08:28:53,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:53,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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 94 [2021-11-07 08:28:53,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:53,572 INFO L225 Difference]: With dead ends: 526 [2021-11-07 08:28:53,572 INFO L226 Difference]: Without dead ends: 291 [2021-11-07 08:28:53,573 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:53,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-11-07 08:28:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 256. [2021-11-07 08:28:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4823529411764707) internal successors, (378), 255 states have internal predecessors, (378), 0 states have call successors, (0), 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-07 08:28:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 378 transitions. [2021-11-07 08:28:53,583 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 378 transitions. Word has length 94 [2021-11-07 08:28:53,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:53,583 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 378 transitions. [2021-11-07 08:28:53,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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-07 08:28:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 378 transitions. [2021-11-07 08:28:53,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-07 08:28:53,585 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:53,585 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:53,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-07 08:28:53,586 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:53,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:53,586 INFO L85 PathProgramCache]: Analyzing trace with hash -844140594, now seen corresponding path program 1 times [2021-11-07 08:28:53,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:53,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845895111] [2021-11-07 08:28:53,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:53,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:53,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:53,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845895111] [2021-11-07 08:28:53,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845895111] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:53,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:53,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:53,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964881304] [2021-11-07 08:28:53,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:53,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:53,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:53,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:53,667 INFO L87 Difference]: Start difference. First operand 256 states and 378 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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-07 08:28:55,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:55,952 INFO L93 Difference]: Finished difference Result 503 states and 748 transitions. [2021-11-07 08:28:55,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:55,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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 94 [2021-11-07 08:28:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:55,954 INFO L225 Difference]: With dead ends: 503 [2021-11-07 08:28:55,954 INFO L226 Difference]: Without dead ends: 268 [2021-11-07 08:28:55,955 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:55,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-07 08:28:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 256. [2021-11-07 08:28:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4784313725490197) internal successors, (377), 255 states have internal predecessors, (377), 0 states have call successors, (0), 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-07 08:28:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 377 transitions. [2021-11-07 08:28:55,961 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 377 transitions. Word has length 94 [2021-11-07 08:28:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:55,961 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 377 transitions. [2021-11-07 08:28:55,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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-07 08:28:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 377 transitions. [2021-11-07 08:28:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-07 08:28:55,962 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:55,963 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:55,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-07 08:28:55,963 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:55,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1986994926, now seen corresponding path program 1 times [2021-11-07 08:28:55,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:55,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241967479] [2021-11-07 08:28:55,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:55,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:28:56,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:56,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241967479] [2021-11-07 08:28:56,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241967479] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:56,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:56,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:28:56,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595326762] [2021-11-07 08:28:56,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:28:56,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:56,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:28:56,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:28:56,043 INFO L87 Difference]: Start difference. First operand 256 states and 377 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:28:58,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:58,456 INFO L93 Difference]: Finished difference Result 526 states and 776 transitions. [2021-11-07 08:28:58,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:28:58,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-11-07 08:28:58,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:58,459 INFO L225 Difference]: With dead ends: 526 [2021-11-07 08:28:58,459 INFO L226 Difference]: Without dead ends: 291 [2021-11-07 08:28:58,460 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-11-07 08:28:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 256. [2021-11-07 08:28:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4745098039215687) internal successors, (376), 255 states have internal predecessors, (376), 0 states have call successors, (0), 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-07 08:28:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 376 transitions. [2021-11-07 08:28:58,469 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 376 transitions. Word has length 98 [2021-11-07 08:28:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:58,469 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 376 transitions. [2021-11-07 08:28:58,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:28:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 376 transitions. [2021-11-07 08:28:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-07 08:28:58,471 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:58,471 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:58,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-07 08:28:58,471 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:58,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:58,472 INFO L85 PathProgramCache]: Analyzing trace with hash -600209516, now seen corresponding path program 1 times [2021-11-07 08:28:58,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:58,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032924860] [2021-11-07 08:28:58,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:58,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-07 08:28:58,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:58,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032924860] [2021-11-07 08:28:58,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032924860] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:58,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:58,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:28:58,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903504907] [2021-11-07 08:28:58,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:28:58,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:58,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:28:58,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:28:58,550 INFO L87 Difference]: Start difference. First operand 256 states and 376 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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-07 08:28:58,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:58,615 INFO L93 Difference]: Finished difference Result 721 states and 1074 transitions. [2021-11-07 08:28:58,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:28:58,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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-07 08:28:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:58,620 INFO L225 Difference]: With dead ends: 721 [2021-11-07 08:28:58,620 INFO L226 Difference]: Without dead ends: 486 [2021-11-07 08:28:58,621 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-07 08:28:58,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-11-07 08:28:58,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2021-11-07 08:28:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 1.4701030927835053) internal successors, (713), 485 states have internal predecessors, (713), 0 states have call successors, (0), 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-07 08:28:58,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 713 transitions. [2021-11-07 08:28:58,638 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 713 transitions. Word has length 98 [2021-11-07 08:28:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:58,638 INFO L470 AbstractCegarLoop]: Abstraction has 486 states and 713 transitions. [2021-11-07 08:28:58,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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-07 08:28:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 713 transitions. [2021-11-07 08:28:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-07 08:28:58,640 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:58,641 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:58,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-07 08:28:58,641 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:58,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:58,642 INFO L85 PathProgramCache]: Analyzing trace with hash 660707734, now seen corresponding path program 1 times [2021-11-07 08:28:58,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:58,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820727932] [2021-11-07 08:28:58,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:58,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-07 08:28:58,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:58,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820727932] [2021-11-07 08:28:58,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820727932] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:58,700 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:58,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:28:58,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270696123] [2021-11-07 08:28:58,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:28:58,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:58,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:28:58,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:28:58,702 INFO L87 Difference]: Start difference. First operand 486 states and 713 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 08:28:58,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:58,747 INFO L93 Difference]: Finished difference Result 978 states and 1438 transitions. [2021-11-07 08:28:58,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:28:58,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 08:28:58,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:58,751 INFO L225 Difference]: With dead ends: 978 [2021-11-07 08:28:58,751 INFO L226 Difference]: Without dead ends: 513 [2021-11-07 08:28:58,752 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-07 08:28:58,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-11-07 08:28:58,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2021-11-07 08:28:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.4609375) internal successors, (748), 512 states have internal predecessors, (748), 0 states have call successors, (0), 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-07 08:28:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 748 transitions. [2021-11-07 08:28:58,768 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 748 transitions. Word has length 98 [2021-11-07 08:28:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:58,768 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 748 transitions. [2021-11-07 08:28:58,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 08:28:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 748 transitions. [2021-11-07 08:28:58,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-07 08:28:58,770 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:58,770 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:58,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-07 08:28:58,771 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:58,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:58,771 INFO L85 PathProgramCache]: Analyzing trace with hash 687773336, now seen corresponding path program 1 times [2021-11-07 08:28:58,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:58,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047096399] [2021-11-07 08:28:58,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:58,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-11-07 08:28:58,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:58,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047096399] [2021-11-07 08:28:58,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047096399] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:58,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:58,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:28:58,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214767726] [2021-11-07 08:28:58,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:28:58,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:58,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:28:58,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:28:58,818 INFO L87 Difference]: Start difference. First operand 513 states and 748 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-07 08:28:58,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:58,851 INFO L93 Difference]: Finished difference Result 1007 states and 1474 transitions. [2021-11-07 08:28:58,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:28:58,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-07 08:28:58,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:58,855 INFO L225 Difference]: With dead ends: 1007 [2021-11-07 08:28:58,855 INFO L226 Difference]: Without dead ends: 515 [2021-11-07 08:28:58,856 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-07 08:28:58,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-11-07 08:28:58,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2021-11-07 08:28:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 1.4591439688715953) internal successors, (750), 514 states have internal predecessors, (750), 0 states have call successors, (0), 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-07 08:28:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 750 transitions. [2021-11-07 08:28:58,875 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 750 transitions. Word has length 98 [2021-11-07 08:28:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:58,877 INFO L470 AbstractCegarLoop]: Abstraction has 515 states and 750 transitions. [2021-11-07 08:28:58,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-07 08:28:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 750 transitions. [2021-11-07 08:28:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-07 08:28:58,879 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:58,880 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:58,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-07 08:28:58,880 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:58,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:58,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1575564738, now seen corresponding path program 1 times [2021-11-07 08:28:58,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:58,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752084649] [2021-11-07 08:28:58,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:58,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-07 08:28:58,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:58,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752084649] [2021-11-07 08:28:58,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752084649] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:58,948 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:58,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:28:58,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422339050] [2021-11-07 08:28:58,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:28:58,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:58,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:28:58,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:28:58,950 INFO L87 Difference]: Start difference. First operand 515 states and 750 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-07 08:28:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:59,008 INFO L93 Difference]: Finished difference Result 1242 states and 1824 transitions. [2021-11-07 08:28:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:28:59,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-07 08:28:59,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:59,014 INFO L225 Difference]: With dead ends: 1242 [2021-11-07 08:28:59,014 INFO L226 Difference]: Without dead ends: 750 [2021-11-07 08:28:59,015 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-07 08:28:59,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2021-11-07 08:28:59,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 748. [2021-11-07 08:28:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 1.4698795180722892) internal successors, (1098), 747 states have internal predecessors, (1098), 0 states have call successors, (0), 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-07 08:28:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1098 transitions. [2021-11-07 08:28:59,068 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1098 transitions. Word has length 100 [2021-11-07 08:28:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:59,068 INFO L470 AbstractCegarLoop]: Abstraction has 748 states and 1098 transitions. [2021-11-07 08:28:59,069 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-07 08:28:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1098 transitions. [2021-11-07 08:28:59,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-07 08:28:59,070 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:59,070 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:59,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-07 08:28:59,071 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:59,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:59,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1668917598, now seen corresponding path program 1 times [2021-11-07 08:28:59,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:59,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269529169] [2021-11-07 08:28:59,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:59,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-07 08:28:59,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:59,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269529169] [2021-11-07 08:28:59,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269529169] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:59,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:59,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:28:59,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711814368] [2021-11-07 08:28:59,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:28:59,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:59,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:28:59,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:28:59,139 INFO L87 Difference]: Start difference. First operand 748 states and 1098 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 08:28:59,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:59,206 INFO L93 Difference]: Finished difference Result 1708 states and 2518 transitions. [2021-11-07 08:28:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:28:59,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 107 [2021-11-07 08:28:59,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:59,212 INFO L225 Difference]: With dead ends: 1708 [2021-11-07 08:28:59,212 INFO L226 Difference]: Without dead ends: 983 [2021-11-07 08:28:59,214 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-07 08:28:59,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2021-11-07 08:28:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 981. [2021-11-07 08:28:59,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.4612244897959183) internal successors, (1432), 980 states have internal predecessors, (1432), 0 states have call successors, (0), 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-07 08:28:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1432 transitions. [2021-11-07 08:28:59,249 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1432 transitions. Word has length 107 [2021-11-07 08:28:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:59,250 INFO L470 AbstractCegarLoop]: Abstraction has 981 states and 1432 transitions. [2021-11-07 08:28:59,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 08:28:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1432 transitions. [2021-11-07 08:28:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-07 08:28:59,253 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:59,253 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 08:28:59,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-07 08:28:59,254 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:59,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:59,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1034789415, now seen corresponding path program 1 times [2021-11-07 08:28:59,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:59,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260064383] [2021-11-07 08:28:59,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:59,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-07 08:28:59,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:59,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260064383] [2021-11-07 08:28:59,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260064383] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:59,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:59,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:28:59,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105085715] [2021-11-07 08:28:59,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:28:59,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:59,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:28:59,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:28:59,340 INFO L87 Difference]: Start difference. First operand 981 states and 1432 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-07 08:28:59,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:28:59,418 INFO L93 Difference]: Finished difference Result 2172 states and 3185 transitions. [2021-11-07 08:28:59,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:28:59,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 124 [2021-11-07 08:28:59,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:28:59,427 INFO L225 Difference]: With dead ends: 2172 [2021-11-07 08:28:59,427 INFO L226 Difference]: Without dead ends: 1214 [2021-11-07 08:28:59,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-07 08:28:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2021-11-07 08:28:59,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2021-11-07 08:28:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1213 states have (on average 1.4649629018961252) internal successors, (1777), 1213 states have internal predecessors, (1777), 0 states have call successors, (0), 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-07 08:28:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1777 transitions. [2021-11-07 08:28:59,475 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1777 transitions. Word has length 124 [2021-11-07 08:28:59,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:28:59,476 INFO L470 AbstractCegarLoop]: Abstraction has 1214 states and 1777 transitions. [2021-11-07 08:28:59,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-07 08:28:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1777 transitions. [2021-11-07 08:28:59,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-07 08:28:59,479 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:28:59,480 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:28:59,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-07 08:28:59,480 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:28:59,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:28:59,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1329906676, now seen corresponding path program 1 times [2021-11-07 08:28:59,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:28:59,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741764758] [2021-11-07 08:28:59,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:28:59,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:28:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:28:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-11-07 08:28:59,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:28:59,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741764758] [2021-11-07 08:28:59,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741764758] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:28:59,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:28:59,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:28:59,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289202391] [2021-11-07 08:28:59,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:28:59,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:28:59,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:28:59,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:28:59,878 INFO L87 Difference]: Start difference. First operand 1214 states and 1777 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:29:03,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:29:03,214 INFO L93 Difference]: Finished difference Result 2425 states and 3550 transitions. [2021-11-07 08:29:03,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 08:29:03,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2021-11-07 08:29:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:29:03,222 INFO L225 Difference]: With dead ends: 2425 [2021-11-07 08:29:03,222 INFO L226 Difference]: Without dead ends: 1214 [2021-11-07 08:29:03,224 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:29:03,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2021-11-07 08:29:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2021-11-07 08:29:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1213 states have (on average 1.4641384995877988) internal successors, (1776), 1213 states have internal predecessors, (1776), 0 states have call successors, (0), 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-07 08:29:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1776 transitions. [2021-11-07 08:29:03,265 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1776 transitions. Word has length 129 [2021-11-07 08:29:03,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:29:03,265 INFO L470 AbstractCegarLoop]: Abstraction has 1214 states and 1776 transitions. [2021-11-07 08:29:03,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:29:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1776 transitions. [2021-11-07 08:29:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-07 08:29:03,272 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:29:03,273 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:29:03,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-07 08:29:03,273 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:29:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:29:03,274 INFO L85 PathProgramCache]: Analyzing trace with hash 895401078, now seen corresponding path program 1 times [2021-11-07 08:29:03,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:29:03,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209716515] [2021-11-07 08:29:03,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:29:03,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:29:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:29:03,912 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:29:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:29:04,406 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:29:04,407 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 08:29:04,408 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:29:04,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-07 08:29:04,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:29:04,418 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 08:29:04,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:29:04 BoogieIcfgContainer [2021-11-07 08:29:04,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 08:29:04,609 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 08:29:04,609 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 08:29:04,609 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 08:29:04,610 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:27:32" (3/4) ... [2021-11-07 08:29:04,615 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 08:29:04,615 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 08:29:04,617 INFO L168 Benchmark]: Toolchain (without parser) took 94860.23 ms. Allocated memory was 146.8 MB in the beginning and 199.2 MB in the end (delta: 52.4 MB). Free memory was 112.2 MB in the beginning and 59.5 MB in the end (delta: 52.7 MB). Peak memory consumption was 104.4 MB. Max. memory is 16.1 GB. [2021-11-07 08:29:04,617 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 83.9 MB. Free memory was 37.6 MB in the beginning and 37.5 MB in the end (delta: 44.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 08:29:04,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 645.37 ms. Allocated memory is still 146.8 MB. Free memory was 111.9 MB in the beginning and 100.9 MB in the end (delta: 11.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 08:29:04,620 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.40 ms. Allocated memory is still 146.8 MB. Free memory was 100.9 MB in the beginning and 95.7 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 08:29:04,620 INFO L168 Benchmark]: Boogie Preprocessor took 93.45 ms. Allocated memory is still 146.8 MB. Free memory was 95.7 MB in the beginning and 89.0 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 08:29:04,620 INFO L168 Benchmark]: RCFGBuilder took 1817.70 ms. Allocated memory is still 146.8 MB. Free memory was 89.0 MB in the beginning and 59.1 MB in the end (delta: 29.9 MB). Peak memory consumption was 31.7 MB. Max. memory is 16.1 GB. [2021-11-07 08:29:04,621 INFO L168 Benchmark]: TraceAbstraction took 92183.99 ms. Allocated memory was 146.8 MB in the beginning and 199.2 MB in the end (delta: 52.4 MB). Free memory was 59.1 MB in the beginning and 60.5 MB in the end (delta: -1.4 MB). Peak memory consumption was 62.2 MB. Max. memory is 16.1 GB. [2021-11-07 08:29:04,621 INFO L168 Benchmark]: Witness Printer took 6.71 ms. Allocated memory is still 199.2 MB. Free memory was 60.5 MB in the beginning and 59.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 08:29:04,624 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.24 ms. Allocated memory is still 83.9 MB. Free memory was 37.6 MB in the beginning and 37.5 MB in the end (delta: 44.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 645.37 ms. Allocated memory is still 146.8 MB. Free memory was 111.9 MB in the beginning and 100.9 MB in the end (delta: 11.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 103.40 ms. Allocated memory is still 146.8 MB. Free memory was 100.9 MB in the beginning and 95.7 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 93.45 ms. Allocated memory is still 146.8 MB. Free memory was 95.7 MB in the beginning and 89.0 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1817.70 ms. Allocated memory is still 146.8 MB. Free memory was 89.0 MB in the beginning and 59.1 MB in the end (delta: 29.9 MB). Peak memory consumption was 31.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 92183.99 ms. Allocated memory was 146.8 MB in the beginning and 199.2 MB in the end (delta: 52.4 MB). Free memory was 59.1 MB in the beginning and 60.5 MB in the end (delta: -1.4 MB). Peak memory consumption was 62.2 MB. Max. memory is 16.1 GB. * Witness Printer took 6.71 ms. Allocated memory is still 199.2 MB. Free memory was 60.5 MB in the beginning and 59.5 MB in the end (delta: 1.0 MB). There was no memory consumed. 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 - UnprovableResult [Line: 1757]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1475. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={15:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1087] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1088] s->options = __VERIFIER_nondet_ulong() [L1089] s->verify_mode = __VERIFIER_nondet_int() [L1090] EXPR s->session [L1090] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1091] EXPR s->s3 [L1091] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1093] EXPR s->s3 [L1093] EXPR (s->s3)->tmp.new_cipher [L1093] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1095] COND FALSE !(__VERIFIER_nondet_int()) [L1101] s->cert = malloc(sizeof(struct cert_st)) [L1102] EXPR s->cert [L1102] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1111] BUF_MEM *buf ; [L1112] unsigned long l ; [L1113] unsigned long Time ; [L1114] unsigned long tmp ; [L1115] void (*cb)() ; [L1116] long num1 ; [L1117] int ret ; [L1118] int new_state ; [L1119] int state ; [L1120] int skip ; [L1121] int got_new_session ; [L1122] int tmp___1 = __VERIFIER_nondet_int() ; [L1123] int tmp___2 = __VERIFIER_nondet_int() ; [L1124] int tmp___3 = __VERIFIER_nondet_int() ; [L1125] int tmp___4 = __VERIFIER_nondet_int() ; [L1126] int tmp___5 = __VERIFIER_nondet_int() ; [L1127] int tmp___6 = __VERIFIER_nondet_int() ; [L1128] int tmp___7 ; [L1129] long tmp___8 = __VERIFIER_nondet_long() ; [L1130] int tmp___9 = __VERIFIER_nondet_int() ; [L1131] int tmp___10 = __VERIFIER_nondet_int() ; [L1132] int blastFlag ; [L1136] s->state = 8464 [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [init=1, SSLv3_server_data={15:0}] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={15:0}] [L1161] EXPR s->cert VAL [init=1, SSLv3_server_data={15:0}] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [init=1, SSLv3_server_data={15:0}] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [init=1, SSLv3_server_data={15:0}] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [init=1, SSLv3_server_data={15:0}] [L1383] COND FALSE !(s->hit) [L1386] s->state = 8512 VAL [init=1, SSLv3_server_data={15:0}] [L1388] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1209] COND TRUE s->state == 8512 [L1392] EXPR s->s3 [L1392] EXPR (s->s3)->tmp.new_cipher [L1392] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={15:0}] [L1392] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1395] ret = __VERIFIER_nondet_int() [L1396] COND TRUE blastFlag == 2 [L1397] blastFlag = 6 VAL [init=1, SSLv3_server_data={15:0}] [L1401] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={15:0}] [L1407] s->state = 8528 [L1408] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1215] COND TRUE s->state == 8528 [L1412] EXPR s->s3 [L1412] EXPR (s->s3)->tmp.new_cipher [L1412] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1412] l = ((s->s3)->tmp.new_cipher)->algorithms [L1413] EXPR s->options VAL [init=1, SSLv3_server_data={15:0}] [L1413] COND TRUE s->options & 2097152UL [L1414] EXPR s->s3 [L1414] (s->s3)->tmp.use_rsa_tmp = 1 [L1418] EXPR s->s3 [L1418] (s->s3)->tmp.use_rsa_tmp VAL [init=1, SSLv3_server_data={15:0}] [L1418] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1436] ret = __VERIFIER_nondet_int() [L1437] COND TRUE blastFlag == 6 [L1438] blastFlag = 7 VAL [init=1, SSLv3_server_data={15:0}] [L1442] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={15:0}] [L1459] s->state = 8544 [L1460] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1221] COND TRUE s->state == 8544 [L1464] EXPR s->verify_mode VAL [init=1, SSLv3_server_data={15:0}] [L1464] COND TRUE s->verify_mode & 1 [L1465] EXPR s->session [L1465] EXPR (s->session)->peer VAL [init=1, SSLv3_server_data={15:0}] [L1465] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1475] EXPR s->s3 [L1475] EXPR (s->s3)->tmp.new_cipher [L1475] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={15:0}] [L1475] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1485] EXPR s->s3 [L1485] (s->s3)->tmp.cert_request = 1 [L1486] ret = __VERIFIER_nondet_int() [L1487] COND TRUE blastFlag == 7 VAL [init=1, SSLv3_server_data={15:0}] [L1757] reach_error() VAL [init=1, SSLv3_server_data={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 91.9s, OverallIterations: 48, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 85.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 9637 SDtfs, 2854 SDslu, 13795 SDs, 0 SdLazy, 7902 SolverSat, 413 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 80.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 95 SyntacticMatches, 32 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1214occurred in iteration=46, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 47 MinimizatonAttempts, 1109 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 3888 NumberOfCodeBlocks, 3888 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3712 ConstructedInterpolants, 0 QuantifiedInterpolants, 11017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 47 PerfectInterpolantSequences, 2280/2280 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-07 08:29:04,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 08:29:07,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 08:29:07,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 08:29:07,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 08:29:07,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 08:29:07,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 08:29:07,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 08:29:07,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 08:29:07,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 08:29:07,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 08:29:07,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 08:29:07,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 08:29:07,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 08:29:07,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 08:29:07,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 08:29:07,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 08:29:07,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 08:29:07,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 08:29:07,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 08:29:07,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 08:29:07,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 08:29:07,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 08:29:07,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 08:29:07,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 08:29:07,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 08:29:07,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 08:29:07,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 08:29:07,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 08:29:07,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 08:29:07,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 08:29:07,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 08:29:07,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 08:29:07,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 08:29:07,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 08:29:07,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 08:29:07,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 08:29:07,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 08:29:07,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 08:29:07,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 08:29:07,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 08:29:07,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 08:29:07,520 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-07 08:29:07,572 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 08:29:07,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 08:29:07,574 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 08:29:07,574 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 08:29:07,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 08:29:07,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 08:29:07,577 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 08:29:07,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 08:29:07,577 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 08:29:07,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 08:29:07,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 08:29:07,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 08:29:07,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 08:29:07,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 08:29:07,580 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 08:29:07,580 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 08:29:07,581 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 08:29:07,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 08:29:07,581 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 08:29:07,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 08:29:07,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 08:29:07,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 08:29:07,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 08:29:07,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:29:07,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 08:29:07,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 08:29:07,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 08:29:07,584 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-07 08:29:07,584 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 08:29:07,585 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 08:29:07,585 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 08:29:07,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 08:29:07,586 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 08:29:07,586 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 08:29:07,586 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/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_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 [2021-11-07 08:29:08,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 08:29:08,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 08:29:08,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 08:29:08,083 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 08:29:08,084 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 08:29:08,085 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-11-07 08:29:08,170 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/data/e7b4d749a/ce57c301761f49cf9cb76c4eea5eb45c/FLAG95567a4dc [2021-11-07 08:29:09,108 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 08:29:09,110 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-11-07 08:29:09,132 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/data/e7b4d749a/ce57c301761f49cf9cb76c4eea5eb45c/FLAG95567a4dc [2021-11-07 08:29:09,209 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/data/e7b4d749a/ce57c301761f49cf9cb76c4eea5eb45c [2021-11-07 08:29:09,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 08:29:09,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 08:29:09,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 08:29:09,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 08:29:09,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 08:29:09,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:29:09" (1/1) ... [2021-11-07 08:29:09,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db139d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:09, skipping insertion in model container [2021-11-07 08:29:09,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:29:09" (1/1) ... [2021-11-07 08:29:09,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 08:29:09,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 08:29:09,850 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_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382] [2021-11-07 08:29:09,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:29:09,884 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 08:29:10,161 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_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382] [2021-11-07 08:29:10,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:29:10,193 INFO L208 MainTranslator]: Completed translation [2021-11-07 08:29:10,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:10 WrapperNode [2021-11-07 08:29:10,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 08:29:10,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 08:29:10,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 08:29:10,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 08:29:10,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:10" (1/1) ... [2021-11-07 08:29:10,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:10" (1/1) ... [2021-11-07 08:29:10,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 08:29:10,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 08:29:10,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 08:29:10,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 08:29:10,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:10" (1/1) ... [2021-11-07 08:29:10,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:10" (1/1) ... [2021-11-07 08:29:10,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:10" (1/1) ... [2021-11-07 08:29:10,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:10" (1/1) ... [2021-11-07 08:29:10,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:10" (1/1) ... [2021-11-07 08:29:10,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:10" (1/1) ... [2021-11-07 08:29:10,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:10" (1/1) ... [2021-11-07 08:29:10,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 08:29:10,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 08:29:10,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 08:29:10,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 08:29:10,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:10" (1/1) ... [2021-11-07 08:29:10,532 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:29:10,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:29:10,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 08:29:10,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 08:29:10,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 08:29:10,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 08:29:10,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 08:29:10,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-07 08:29:10,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 08:29:10,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 08:29:10,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 08:29:10,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 08:29:10,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-07 08:29:10,925 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 08:29:15,262 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-11-07 08:29:15,263 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-11-07 08:29:15,273 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 08:29:15,277 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-11-07 08:29:15,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:29:15 BoogieIcfgContainer [2021-11-07 08:29:15,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 08:29:15,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 08:29:15,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 08:29:15,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 08:29:15,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:29:09" (1/3) ... [2021-11-07 08:29:15,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c235e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:29:15, skipping insertion in model container [2021-11-07 08:29:15,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:10" (2/3) ... [2021-11-07 08:29:15,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c235e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:29:15, skipping insertion in model container [2021-11-07 08:29:15,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:29:15" (3/3) ... [2021-11-07 08:29:15,293 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2021-11-07 08:29:15,299 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 08:29:15,300 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 08:29:15,353 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 08:29:15,358 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-07 08:29:15,359 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 08:29:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:29:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 08:29:15,386 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:29:15,387 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] [2021-11-07 08:29:15,388 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:29:15,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:29:15,394 INFO L85 PathProgramCache]: Analyzing trace with hash -442385417, now seen corresponding path program 1 times [2021-11-07 08:29:15,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 08:29:15,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642223683] [2021-11-07 08:29:15,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:29:15,408 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 08:29:15,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 08:29:15,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 08:29:15,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 08:29:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:29:15,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 08:29:15,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:29:16,054 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-07 08:29:16,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 08:29:16,396 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-07 08:29:16,397 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 08:29:16,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642223683] [2021-11-07 08:29:16,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642223683] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 08:29:16,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:29:16,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-07 08:29:16,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926435750] [2021-11-07 08:29:16,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:29:16,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 08:29:16,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:29:16,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:29:16,439 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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-07 08:29:16,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:29:16,753 INFO L93 Difference]: Finished difference Result 563 states and 960 transitions. [2021-11-07 08:29:16,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:29:16,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-07 08:29:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:29:16,773 INFO L225 Difference]: With dead ends: 563 [2021-11-07 08:29:16,773 INFO L226 Difference]: Without dead ends: 384 [2021-11-07 08:29:16,778 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:29:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-11-07 08:29:16,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2021-11-07 08:29:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.5275590551181102) internal successors, (582), 381 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-07 08:29:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 582 transitions. [2021-11-07 08:29:16,849 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 582 transitions. Word has length 37 [2021-11-07 08:29:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:29:16,850 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 582 transitions. [2021-11-07 08:29:16,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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-07 08:29:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 582 transitions. [2021-11-07 08:29:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-07 08:29:16,855 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:29:16,856 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:29:16,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-07 08:29:17,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 08:29:17,061 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:29:17,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:29:17,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1287801256, now seen corresponding path program 1 times [2021-11-07 08:29:17,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 08:29:17,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764957635] [2021-11-07 08:29:17,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:29:17,064 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 08:29:17,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 08:29:17,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 08:29:17,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 08:29:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:29:17,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 08:29:17,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:29:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:29:17,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 08:29:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:29:18,008 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 08:29:18,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764957635] [2021-11-07 08:29:18,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764957635] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 08:29:18,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:29:18,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-07 08:29:18,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933212206] [2021-11-07 08:29:18,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:29:18,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 08:29:18,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:29:18,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:29:18,014 INFO L87 Difference]: Start difference. First operand 382 states and 582 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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-07 08:29:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:29:18,332 INFO L93 Difference]: Finished difference Result 878 states and 1348 transitions. [2021-11-07 08:29:18,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:29:18,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-07 08:29:18,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:29:18,339 INFO L225 Difference]: With dead ends: 878 [2021-11-07 08:29:18,339 INFO L226 Difference]: Without dead ends: 630 [2021-11-07 08:29:18,342 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:29:18,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2021-11-07 08:29:18,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 628. [2021-11-07 08:29:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.5199362041467304) internal successors, (953), 627 states have internal predecessors, (953), 0 states have call successors, (0), 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-07 08:29:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 953 transitions. [2021-11-07 08:29:18,407 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 953 transitions. Word has length 61 [2021-11-07 08:29:18,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:29:18,408 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 953 transitions. [2021-11-07 08:29:18,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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-07 08:29:18,408 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 953 transitions. [2021-11-07 08:29:18,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-07 08:29:18,423 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:29:18,423 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:29:18,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-07 08:29:18,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 08:29:18,638 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:29:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:29:18,639 INFO L85 PathProgramCache]: Analyzing trace with hash 393853380, now seen corresponding path program 1 times [2021-11-07 08:29:18,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 08:29:18,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647062590] [2021-11-07 08:29:18,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:29:18,641 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 08:29:18,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 08:29:18,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 08:29:18,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 08:29:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:29:18,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 08:29:18,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:29:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:29:19,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 08:29:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 08:29:19,899 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 08:29:19,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647062590] [2021-11-07 08:29:19,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647062590] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 08:29:19,900 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:29:19,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-07 08:29:19,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772794118] [2021-11-07 08:29:19,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:29:19,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 08:29:19,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:29:19,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:29:19,908 INFO L87 Difference]: Start difference. First operand 628 states and 953 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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-07 08:29:20,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:29:20,194 INFO L93 Difference]: Finished difference Result 1368 states and 2088 transitions. [2021-11-07 08:29:20,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:29:20,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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-07 08:29:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:29:20,203 INFO L225 Difference]: With dead ends: 1368 [2021-11-07 08:29:20,204 INFO L226 Difference]: Without dead ends: 874 [2021-11-07 08:29:20,206 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:29:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-11-07 08:29:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2021-11-07 08:29:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.5154639175257731) internal successors, (1323), 873 states have internal predecessors, (1323), 0 states have call successors, (0), 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-07 08:29:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1323 transitions. [2021-11-07 08:29:20,251 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1323 transitions. Word has length 105 [2021-11-07 08:29:20,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:29:20,251 INFO L470 AbstractCegarLoop]: Abstraction has 874 states and 1323 transitions. [2021-11-07 08:29:20,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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-07 08:29:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1323 transitions. [2021-11-07 08:29:20,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-07 08:29:20,257 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:29:20,258 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:29:20,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-07 08:29:20,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 08:29:20,476 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:29:20,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:29:20,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1006485834, now seen corresponding path program 1 times [2021-11-07 08:29:20,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 08:29:20,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139811289] [2021-11-07 08:29:20,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:29:20,478 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 08:29:20,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 08:29:20,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 08:29:20,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-07 08:29:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:29:21,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-07 08:29:21,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:29:21,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-07 08:29:21,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-07 08:29:21,324 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-11-07 08:29:21,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 41 [2021-11-07 08:29:21,363 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-11-07 08:29:21,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-11-07 08:29:21,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:29:21,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:29:21,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:29:21,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 22 [2021-11-07 08:29:21,524 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-11-07 08:29:21,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-11-07 08:29:21,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 08:29:21,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-11-07 08:29:21,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-11-07 08:29:21,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-07 08:29:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-11-07 08:29:22,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 08:29:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-11-07 08:29:23,035 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 08:29:23,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139811289] [2021-11-07 08:29:23,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139811289] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 08:29:23,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:29:23,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-07 08:29:23,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765433513] [2021-11-07 08:29:23,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 08:29:23,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 08:29:23,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 08:29:23,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:29:23,040 INFO L87 Difference]: Start difference. First operand 874 states and 1323 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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-07 08:29:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:29:34,305 INFO L93 Difference]: Finished difference Result 1745 states and 2642 transitions. [2021-11-07 08:29:34,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 08:29:34,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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 129 [2021-11-07 08:29:34,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:29:34,314 INFO L225 Difference]: With dead ends: 1745 [2021-11-07 08:29:34,314 INFO L226 Difference]: Without dead ends: 874 [2021-11-07 08:29:34,316 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-07 08:29:34,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-11-07 08:29:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2021-11-07 08:29:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.5143184421534936) internal successors, (1322), 873 states have internal predecessors, (1322), 0 states have call successors, (0), 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-07 08:29:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1322 transitions. [2021-11-07 08:29:34,362 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1322 transitions. Word has length 129 [2021-11-07 08:29:34,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:29:34,363 INFO L470 AbstractCegarLoop]: Abstraction has 874 states and 1322 transitions. [2021-11-07 08:29:34,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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-07 08:29:34,363 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1322 transitions. [2021-11-07 08:29:34,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-07 08:29:34,367 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:29:34,368 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:29:34,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-07 08:29:34,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 08:29:34,585 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:29:34,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:29:34,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1440991432, now seen corresponding path program 1 times [2021-11-07 08:29:34,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 08:29:34,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484418610] [2021-11-07 08:29:34,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:29:34,587 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 08:29:34,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 08:29:34,589 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 08:29:34,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-07 08:29:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:29:35,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 08:29:35,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:29:35,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-07 08:29:35,510 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-07 08:29:35,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-07 08:29:35,949 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-07 08:29:35,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-11-07 08:29:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-07 08:29:36,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 08:29:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-07 08:29:36,895 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 08:29:36,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484418610] [2021-11-07 08:29:36,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484418610] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 08:29:36,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:29:36,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2021-11-07 08:29:36,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957020838] [2021-11-07 08:29:36,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 08:29:36,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 08:29:36,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 08:29:36,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:29:36,899 INFO L87 Difference]: Start difference. First operand 874 states and 1322 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 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-07 08:29:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:29:49,181 INFO L93 Difference]: Finished difference Result 3290 states and 5000 transitions. [2021-11-07 08:29:49,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 08:29:49,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2021-11-07 08:29:49,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:29:49,199 INFO L225 Difference]: With dead ends: 3290 [2021-11-07 08:29:49,200 INFO L226 Difference]: Without dead ends: 2426 [2021-11-07 08:29:49,202 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 08:29:49,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2021-11-07 08:29:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 1048. [2021-11-07 08:29:49,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1047 states have (on average 1.5491881566380135) internal successors, (1622), 1047 states have internal predecessors, (1622), 0 states have call successors, (0), 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-07 08:29:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1622 transitions. [2021-11-07 08:29:49,292 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1622 transitions. Word has length 129 [2021-11-07 08:29:49,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:29:49,292 INFO L470 AbstractCegarLoop]: Abstraction has 1048 states and 1622 transitions. [2021-11-07 08:29:49,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 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-07 08:29:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1622 transitions. [2021-11-07 08:29:49,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-07 08:29:49,296 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:29:49,297 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:29:49,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-07 08:29:49,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 08:29:49,517 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 08:29:49,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:29:49,518 INFO L85 PathProgramCache]: Analyzing trace with hash 895401078, now seen corresponding path program 1 times [2021-11-07 08:29:49,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 08:29:49,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913895838] [2021-11-07 08:29:49,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:29:49,519 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 08:29:49,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 08:29:49,521 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 08:29:49,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-07 08:29:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:29:51,440 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:29:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:29:53,658 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-11-07 08:29:53,658 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 08:29:53,659 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:29:53,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-07 08:29:53,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 08:29:53,887 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2021-11-07 08:29:53,891 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 08:29:54,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:29:54 BoogieIcfgContainer [2021-11-07 08:29:54,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 08:29:54,073 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 08:29:54,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 08:29:54,073 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 08:29:54,080 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:29:15" (3/4) ... [2021-11-07 08:29:54,083 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 08:29:54,285 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/witness.graphml [2021-11-07 08:29:54,286 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 08:29:54,287 INFO L168 Benchmark]: Toolchain (without parser) took 45072.96 ms. Allocated memory was 65.0 MB in the beginning and 113.2 MB in the end (delta: 48.2 MB). Free memory was 39.0 MB in the beginning and 38.0 MB in the end (delta: 918.4 kB). Peak memory consumption was 53.7 MB. Max. memory is 16.1 GB. [2021-11-07 08:29:54,288 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 50.3 MB. Free memory was 30.5 MB in the beginning and 30.4 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 08:29:54,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 979.00 ms. Allocated memory is still 65.0 MB. Free memory was 38.6 MB in the beginning and 36.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 16.1 GB. [2021-11-07 08:29:54,289 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.57 ms. Allocated memory is still 65.0 MB. Free memory was 36.6 MB in the beginning and 31.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 08:29:54,289 INFO L168 Benchmark]: Boogie Preprocessor took 188.12 ms. Allocated memory is still 65.0 MB. Free memory was 31.9 MB in the beginning and 37.1 MB in the end (delta: -5.3 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB. [2021-11-07 08:29:54,290 INFO L168 Benchmark]: RCFGBuilder took 4761.81 ms. Allocated memory was 65.0 MB in the beginning and 94.4 MB in the end (delta: 29.4 MB). Free memory was 37.1 MB in the beginning and 64.4 MB in the end (delta: -27.3 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. [2021-11-07 08:29:54,290 INFO L168 Benchmark]: TraceAbstraction took 38787.90 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 63.8 MB in the beginning and 52.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 57.0 MB. Max. memory is 16.1 GB. [2021-11-07 08:29:54,291 INFO L168 Benchmark]: Witness Printer took 213.05 ms. Allocated memory is still 113.2 MB. Free memory was 51.8 MB in the beginning and 38.0 MB in the end (delta: 13.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-07 08:29:54,298 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.29 ms. Allocated memory is still 50.3 MB. Free memory was 30.5 MB in the beginning and 30.4 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 979.00 ms. Allocated memory is still 65.0 MB. Free memory was 38.6 MB in the beginning and 36.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 133.57 ms. Allocated memory is still 65.0 MB. Free memory was 36.6 MB in the beginning and 31.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 188.12 ms. Allocated memory is still 65.0 MB. Free memory was 31.9 MB in the beginning and 37.1 MB in the end (delta: -5.3 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4761.81 ms. Allocated memory was 65.0 MB in the beginning and 94.4 MB in the end (delta: 29.4 MB). Free memory was 37.1 MB in the beginning and 64.4 MB in the end (delta: -27.3 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 38787.90 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 63.8 MB in the beginning and 52.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 57.0 MB. Max. memory is 16.1 GB. * Witness Printer took 213.05 ms. Allocated memory is still 113.2 MB. Free memory was 51.8 MB in the beginning and 38.0 MB in the end (delta: 13.8 MB). Peak memory consumption was 14.7 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 - CounterExampleResult [Line: 1757]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1087] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1088] s->options = __VERIFIER_nondet_ulong() [L1089] s->verify_mode = __VERIFIER_nondet_int() [L1090] EXPR s->session [L1090] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1091] EXPR s->s3 [L1091] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1093] EXPR s->s3 [L1093] EXPR (s->s3)->tmp.new_cipher [L1093] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1095] COND FALSE !(__VERIFIER_nondet_int()) [L1101] s->cert = malloc(sizeof(struct cert_st)) [L1102] EXPR s->cert [L1102] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1111] BUF_MEM *buf ; [L1112] unsigned long l ; [L1113] unsigned long Time ; [L1114] unsigned long tmp ; [L1115] void (*cb)() ; [L1116] long num1 ; [L1117] int ret ; [L1118] int new_state ; [L1119] int state ; [L1120] int skip ; [L1121] int got_new_session ; [L1122] int tmp___1 = __VERIFIER_nondet_int() ; [L1123] int tmp___2 = __VERIFIER_nondet_int() ; [L1124] int tmp___3 = __VERIFIER_nondet_int() ; [L1125] int tmp___4 = __VERIFIER_nondet_int() ; [L1126] int tmp___5 = __VERIFIER_nondet_int() ; [L1127] int tmp___6 = __VERIFIER_nondet_int() ; [L1128] int tmp___7 ; [L1129] long tmp___8 = __VERIFIER_nondet_long() ; [L1130] int tmp___9 = __VERIFIER_nondet_int() ; [L1131] int tmp___10 = __VERIFIER_nondet_int() ; [L1132] int blastFlag ; [L1136] s->state = 8464 [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1161] EXPR s->cert VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1383] COND FALSE !(s->hit) [L1386] s->state = 8512 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1388] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1209] COND TRUE s->state == 8512 [L1392] EXPR s->s3 [L1392] EXPR (s->s3)->tmp.new_cipher [L1392] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1392] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1395] ret = __VERIFIER_nondet_int() [L1396] COND TRUE blastFlag == 2 [L1397] blastFlag = 6 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1401] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1407] s->state = 8528 [L1408] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1215] COND TRUE s->state == 8528 [L1412] EXPR s->s3 [L1412] EXPR (s->s3)->tmp.new_cipher [L1412] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1412] l = ((s->s3)->tmp.new_cipher)->algorithms [L1413] EXPR s->options VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1413] COND TRUE s->options & 2097152UL [L1414] EXPR s->s3 [L1414] (s->s3)->tmp.use_rsa_tmp = 1 [L1418] EXPR s->s3 [L1418] (s->s3)->tmp.use_rsa_tmp VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1418] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1436] ret = __VERIFIER_nondet_int() [L1437] COND TRUE blastFlag == 6 [L1438] blastFlag = 7 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1442] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1459] s->state = 8544 [L1460] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1221] COND TRUE s->state == 8544 [L1464] EXPR s->verify_mode VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1464] COND TRUE s->verify_mode & 1 [L1465] EXPR s->session [L1465] EXPR (s->session)->peer VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1465] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1475] EXPR s->s3 [L1475] EXPR (s->s3)->tmp.new_cipher [L1475] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1475] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1485] EXPR s->s3 [L1485] (s->s3)->tmp.cert_request = 1 [L1486] ret = __VERIFIER_nondet_int() [L1487] COND TRUE blastFlag == 7 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1757] reach_error() VAL [init=1, SSLv3_server_data={-1073741793:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.5s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1360 SDtfs, 1297 SDslu, 2406 SDs, 0 SdLazy, 1151 SolverSat, 141 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 22.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 916 GetRequests, 893 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1048occurred in iteration=5, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 1382 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 590 NumberOfCodeBlocks, 590 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 912 ConstructedInterpolants, 1 QuantifiedInterpolants, 2131 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1343 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 814/814 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-07 08:29:54,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f49b1288-2e85-4a9e-9b28-5fd830ca2c11/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE